Submission #420855

# Submission time Handle Problem Language Result Execution time Memory
420855 2021-06-08T14:24:39 Z Drew_ MalnaRISC (COI21_malnarisc) C++17
0 / 100
10 ms 500 KB
#include <iostream>
#include <vector>
#include <bitset>
#include <random>
#include <algorithm>
using namespace std;
 
#define pb push_back
#define ii pair<int, int>
#define f1 first
#define s2 second
 
bitset<169> used;
mt19937 RNG(69);
int main()
{
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	int n;
	cin >> n;
 
	vector<ii> rem;
	for (int i = 1; i <= n; ++i)
		for (int j = i+1; j <= n; ++j)
			rem.pb({i, j});
 
	vector<vector<ii>> res;
	while (!rem.empty())
	{
		shuffle(rem.begin(), rem.end(), RNG);

		used.reset();
		vector<ii> out, nxt;
		for (auto [a, b] : rem)
		{
			if (!used[a] && !used[b])
				out.pb({a, b}), used[a] = used[b] = true;
			else nxt.pb({a, b});
		}
 
		res.pb(out);
		rem = nxt;
	}
	
	cout << res.size() << '\n';
	for (auto &out : res)
	{
		for (int i = 0; i < (int)out.size(); ++i)
			cout << "CMPSWP R" << out[i].f1 << " R" << out[i].s2 << " \n"[i+1 == (int)out.size()];
	}
 
	return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 332 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 332 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 332 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 460 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 460 KB not sorted
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 500 KB not sorted