oj.uz

Submission #286720

# Submission time Handle Problem Language Result Execution time Memory
286720 2020-08-30T19:33:06 Z koosaga(#5793) None (JOI12_rotate) C++17
100 / 100
 845 ms 19504 KB 
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const int MAXN = 1100000;

int nxt[MAXN][4];
char s[1111][1111];

pi Move(pi x){
	int nd = nxt[x.first][x.second];
	int pos = find(nxt[nd], nxt[nd] + 4, x.first) - nxt[nd];
	return pi(nd, pos ^ 2);
}

int main(){
	int n, q; cin >> n >> q;
	n += 2;
	auto f = [&](int x, int y){ return x * n + y;  };
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			nxt[f(i, j)][0] = f(i, j + 1);
			nxt[f(i, j)][1] = f(i - 1, j);
			nxt[f(i, j)][2] = f(i, j - 1);
			nxt[f(i, j)][3] = f(i + 1, j);
		}
	}
	for(int i=1; i<=n-2; i++) scanf("%s", s[i] + 1);
	while(q--){
		int x, y, c; scanf("%d %d %d",&x,&y,&c);
		pi mv(0, 0);
		for(int i=0; i<y-1; i++) mv = Move(mv);
		mv.second = (mv.second + 3) % 4;
		for(int i=0; i<x; i++) mv = Move(mv);
		vector<pi> SEQ[4];

		for(int it = 0; it < 4; it++){
			for(int i=0; i<c; i++){
				mv.second = (mv.second + 1) % 4;
				SEQ[it].push_back(mv);
				mv.second = (mv.second + 3) % 4;
				mv = Move(mv);
			}
			mv.second = (mv.second + 1) % 4;
			mv = Move(mv);
		}
		vector<pair<pi, pi>> ass;
		for(int i = 0; i < 4; i++){
			for(int j=0; j<c; j++){
				ass.emplace_back(SEQ[i][j], Move(SEQ[(i+3)%4][j]));
			}
		}
		for(int i=0; i<sz(ass); i++){
			pi p, q; tie(p, q) = ass[i];
			q.second ^= 2;
			nxt[p.first][p.second] = q.first;
			nxt[q.first][q.second] = p.first;
		}
	}
	pi p(0, 3);
	for(int i=0; i<n-2; i++){
		p = Move(p);
		auto q = p;
		q.second = (q.second + 1) % 4;
		for(int j=0; j<n-2; j++){
			q = Move(q);
			putchar(s[q.first / n][q.first % n]);
		}
		puts("");
	}
}

Compilation message

rotate.cpp: In function 'int main()':
rotate.cpp:31:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |  for(int i=1; i<=n-2; i++) scanf("%s", s[i] + 1);
      |                            ~~~~~^~~~~~~~~~~~~~~~
rotate.cpp:33:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |   int x, y, c; scanf("%d %d %d",&x,&y,&c);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 19504 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 19224 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 19300 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 19460 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 19468 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 699 ms 19420 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 760 ms 19444 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 808 ms 19392 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 845 ms 19504 KB Output is correct