Submission #1002796

#TimeUsernameProblemLanguageResultExecution timeMemory
1002796JuanMalnaRISC (COI21_malnarisc)C++17
67.63 / 100
4 ms600 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define pii pair<int,int> void print(int a, int b){ cout << "CMPSWP "; cout << "R" << a << " "; cout << "R" << b << " "; } int main(){ int n; cin >> n; set<pii> pares; for(int d=1; d<=n; d++){ for(int i=1; i+d<=n; i++){ pares.insert({i,i+d}); } } int cnt=0; vector<vector<pii>> arr; while(pares.size()){ vector<bool> mark(n+1); arr.pb({}); for(auto[a,b] : pares){ if(!mark[a] && !mark[b]){ mark[a]=mark[b]=true; arr.back().pb({a,b}); } } for(auto ab : arr.back()) pares.erase(ab); cnt++; } cout << cnt << '\n'; for(auto v : arr){ for(auto[a,b] : v) print(a,b); cout << '\n'; } }
#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...