oj.uz

Submission #445684

# Submission time Handle Problem Language Result Execution time Memory
445684 2021-07-19T09:07:17 Z grt MalnaRISC (COI21_malnarisc) C++17
100 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

int n;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	int r = 0;
	for(int p = 1; p < n; p *= 2) {
		for(int k = p; k >= 1; k /= 2) {
			r++;
		}
	}
	cout << r << "\n";
	for(int p = 1; p < n; p *= 2) {
		for(int k = p; k >= 1; k /= 2) {
			for(int j = k % p; j <= n - 1 - k; j += 2*k) {
				for(int i = 0; i <= k - 1; i++) {
					if((i+j)/(p*2) == (i+j+k)/(p*2)) {
						if(i + j + k + 1 <= n) {
							cout << "CMPSWP R" << i + j+1 << " R" << i + j + k+1 << " ";
						}
					}
				}
			}
			cout << "\n";
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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