oj.uz

Submission #330967

# Submission time Handle Problem Language Result Execution time Memory
330967 2020-11-27T02:15:34 Z MetB Shift (POI11_prz) C++14
100 / 100
 350 ms 22264 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

const int N = 2000001;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

struct cyclic_array {
	vector <int> v;
	int shift, n;

	cyclic_array(int n) 
			: v (vector <int> (n)), shift (0), n (n) {}
	void make_b() { 
		shift = shift ? shift - 1 : n - 1;
	}
	void make_inv() { 
		shift = (shift == n - 1) ? 0 : shift + 1;
	}
	void make_a() { 
		int& a = v[shift % n];
		int& b = v[(shift + 1) % n];
		int& c = v[(shift + 2) % n];
		swap(b, c), swap(a, b);
	}

	int& operator[] (int x) {
		return v[(x + shift) % n];
	}
};

vector <pair<int, char>> s;

int n;

void add_a(cyclic_array& v) {
	v.make_a();
	if (!s.empty() && s.back().second == 'b') s.back().first++;
	else s.push_back({1, 'b'});
	if (s.back().first == n) s.pop_back();
}

void add_b(cyclic_array& v) {
	v.make_b();
	if (!s.empty() && s.back().second == 'a') s.back().first++;
	else s.push_back({1, 'a'});
	if (s.back().first == n) s.pop_back();
}

void add_inv(cyclic_array& v) {
	v.make_inv();
	if (!s.empty() && s.back().second == 'a') s.back().first = (s.back().first + n - 1) % n;
	else s.push_back({n - 1, 'a'});
	if (s.back().first == 0) s.pop_back();
}

int main () {
	cin >> n;

	cyclic_array v (n);

	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}

	for (int i = 2; i <= n; i++) {
		while (v[2] != i) add_b(v);

		while (v[0] != i - 1 && v[1] != i - 1) {
			add_a(v), add_b(v), add_b(v);
		}

		if (v[0] == i - 1) {
			if (i >= n - 1) {
				if (n % 2 == 0) {
					while (v[1] != i - 1) {
						add_a(v), add_b(v), add_b(v);
					}
				} else {
					cout << "NIE DA SIE\n";
					return 0;
				}
			} else {
				add_inv(v), add_a(v), add_a(v);	
			}
		}
	}

	while (v[0] != 1) add_b(v);

	cout << s.size () << endl;

	for (auto a : s) {
		cout << a.first << a.second << ' ';
	}

	return 0;

}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
13.0 / 13.0

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

Subtask #6
13.0 / 13.0

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

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 9160 KB Output is correct
2 Correct 153 ms 9288 KB Output is correct
3 Correct 150 ms 9416 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 11336 KB Output is correct
2 Correct 185 ms 11464 KB Output is correct
3 Correct 350 ms 22264 KB Output is correct
4 Correct 12 ms 364 KB Output is correct
5 Correct 51 ms 16852 KB Output is correct