Submission #1157341

#TimeUsernameProblemLanguageResultExecution timeMemory
1157341raczekMalnaRISC (COI21_malnarisc)C++20
100 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #ifdef DEBUG auto&operator <<(auto& o, pair<auto, auto> p) {return o<<"{"<<p.first<<", "<<p.second<<"}";} auto operator <<(auto& o, auto x)->decltype(x.end(), o) {o<<"{"; for(auto v : x) o<<v<<", "; return o<<"}";} #define debug(X...) cerr<<"["#X"]: ", [](auto...$) {((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif #define int long long const int INF = 1e18+7; #define mp(x, y) make_pair(x, y) #define fi first #define se second #define eb emplace_back int32_t main() { cin.tie(0)->sync_with_stdio(0); int n; cin>>n; int org = n; while(__builtin_popcount(n) != 1) n++; cout<<(log2(n)*(log2(n)+1))/2<<endl; for(int k=1;k<=n;k*=2) { for(int d=k;d > 1;d/=2) { vector<int> vis(n); for(int i=0;i<org;i++) { int x = (i/d+1)*d - (i%d+1); if(d != k) x = i + d/2; if(x+1 <= org && vis[i] == 0) { // cout<<i+1<<" "<<x+1<<" "; cout<<"CMPSWP R"<<i+1<<" R"<<x+1<<" "; vis[x] = true; } } cout<<endl; } } }
#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...