Submission #420838

#TimeUsernameProblemLanguageResultExecution timeMemory
420838Drew_MalnaRISC (COI21_malnarisc)C++17
67.63 / 100
5 ms460 KiB
#include <iostream> #include <vector> #include <bitset> using namespace std; #define pb push_back #define ii pair<int, int> #define f1 first #define s2 second bitset<169> used; 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()) { 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...