oj.uz

Submission #960808

# Submission time Handle Problem Language Result Execution time Memory
960808 2024-04-11T04:39:28 Z ono_de206 MalnaRISC (COI21_malnarisc) C++14
40 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181;// D = 1523, N = 2500;
const long long inf = 2e18 + 10;

void go() {
	int n;
	cin >> n;
	// int N = 1;
	// while(N < n) N <<= 1;
	vector<vector<pair<int, int>>> ans;

	auto max2 = [&](int N) -> int {
		int ret = 1;
		while(ret * 2 < N) ret *= 2;
		return ret;
	};

	auto merge = [&](auto &self, int l, int r, int dir, int id) -> int {
		if(l == r) return id;
		while(ans.size() <= id) ans.pb(vector<pair<int, int>>());
		auto &ops = ans[id];

		int N = (r - l + 1);
		int m = max2(N);
		// cout << l << ' ' << r << ' ' << N << ' ' << m << endl;

		for(int i = l; i < l + N - m; i++) {
			if(dir) ops.eb(i, i + m);
			else ops.eb(i + m, i);
		}
		return max(self(self, l, l + m - 1, dir, id + 1), self(self, l + m, r, dir, id + 1));
	};

	auto solve = [&](auto &self, int l, int r, int dir) -> int {
		if(l == r) return 0;
		int m = (l + r) / 2;
		int id = max(self(self, l, m, 1), self(self, m + 1, r, 0));

		return merge(merge, l, r, dir, id);
	};
	solve(solve, 1, n, 1);
	cout << ans.size() << endl;
	for(auto ops : ans) {
		for(auto it : ops) {
			// if(it.ff > n || it.ss > n) continue;
			cout << "CMPSWP R" << it.ff << " R" << it.ss << ' ';
		}
		cout << endl;
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Compilation message

malnarisc.cpp: In instantiation of 'go()::<lambda(auto:1&, long long int, long long int, long long int, long long int)> [with auto:1 = go()::<lambda(auto:1&, long long int, long long int, long long int, long long int)>]':
malnarisc.cpp:93:15:   required from 'go()::<lambda(auto:2&, long long int, long long int, long long int)> [with auto:2 = go()::<lambda(auto:2&, long long int, long long int, long long int)>]'
malnarisc.cpp:95:22:   required from here
malnarisc.cpp:74:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   74 |   while(ans.size() <= id) ans.pb(vector<pair<int, int>>());
      |         ~~~~~~~~~~~^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 504 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -