이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// Author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
int n;
vector < pair < int , int > > ans[20];
void f(int ind , int l , int r){
if(l == r)return;
int mid = (l + r) / 2;
f(ind+1 , l , mid);
f(ind+1 , mid+1 , r);
for(int i = l;i<r;i++){
for(int j = i+1;j<=r;j++){
ans[ind].push_back({i , j});
}
}
}
void solve(){
cin >> n;
f(0,1,n);
int cevap = 0;
for(int i = 0;i<20;i++)if(sz(ans[i]))cevap++;
cout << cevap << endl;
for(int i = 19;i>=0;i--){
if(sz(ans[i]) == 0)continue;
for(auto itr : ans[i]){
cout << "CMPSWP R" << itr.first << " R" << itr.second << " ";
}
cout << endl;
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int testcase = 1;//cin >> testcase;
while(testcase--)solve();
cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |