Submission #472112
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
char board[4][4];
int main() {
rep(i,4)rep(j,4)cin>>board[i][j];
rep(i,4){
rep(j,4){
cout<<board[3-i][3-j]<<" ";
}cout<<endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 回転 |
User |
ynq1242 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
2222 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
1056 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_00.txt, 00_sample_01.txt, 01_all_dot.txt, 02_all_o.txt, 03_all_x.txt, rand_0.txt, rand_1.txt, rand_10.txt, rand_11.txt, rand_12.txt, rand_13.txt, rand_14.txt, rand_15.txt, rand_16.txt, rand_17.txt, rand_18.txt, rand_19.txt, rand_2.txt, rand_20.txt, rand_21.txt, rand_22.txt, rand_23.txt, rand_24.txt, rand_3.txt, rand_4.txt, rand_5.txt, rand_6.txt, rand_7.txt, rand_8.txt, rand_9.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_00.txt |
AC |
29 ms |
984 KB |
00_sample_01.txt |
AC |
26 ms |
1048 KB |
01_all_dot.txt |
AC |
26 ms |
1000 KB |
02_all_o.txt |
AC |
27 ms |
1052 KB |
03_all_x.txt |
AC |
27 ms |
1052 KB |
rand_0.txt |
AC |
26 ms |
936 KB |
rand_1.txt |
AC |
27 ms |
1052 KB |
rand_10.txt |
AC |
27 ms |
1052 KB |
rand_11.txt |
AC |
28 ms |
1048 KB |
rand_12.txt |
AC |
28 ms |
1048 KB |
rand_13.txt |
AC |
27 ms |
1048 KB |
rand_14.txt |
AC |
27 ms |
1052 KB |
rand_15.txt |
AC |
27 ms |
1052 KB |
rand_16.txt |
AC |
27 ms |
1048 KB |
rand_17.txt |
AC |
26 ms |
936 KB |
rand_18.txt |
AC |
26 ms |
1052 KB |
rand_19.txt |
AC |
27 ms |
1052 KB |
rand_2.txt |
AC |
28 ms |
1048 KB |
rand_20.txt |
AC |
26 ms |
944 KB |
rand_21.txt |
AC |
27 ms |
1048 KB |
rand_22.txt |
AC |
26 ms |
932 KB |
rand_23.txt |
AC |
27 ms |
1056 KB |
rand_24.txt |
AC |
27 ms |
1048 KB |
rand_3.txt |
AC |
26 ms |
1056 KB |
rand_4.txt |
AC |
27 ms |
1048 KB |
rand_5.txt |
AC |
27 ms |
1052 KB |
rand_6.txt |
AC |
31 ms |
896 KB |
rand_7.txt |
AC |
26 ms |
1048 KB |
rand_8.txt |
AC |
27 ms |
1044 KB |
rand_9.txt |
AC |
26 ms |
952 KB |