oj.uz

Submission #409124

# Submission time Handle Problem Language Result Execution time Memory
409124 2021-05-20T08:42:25 Z zaneyu MalnaRISC (COI21_malnarisc) C++14
10.326 / 100
 11 ms 12236 KB 
/*input
8
*/
 
 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC optimize("O2","unroll-loops","no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x)(int)x.size()
#define SORT_UNIQUE(c)(sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=INF64; 
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    if(b<0) b+=MOD;
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return(a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=5e5+5;
vector<pii> v[maxn];
int n;
void srt(int l,int r,int d){
    if(l==r) return;
    int mid=(l+r)/2;
    srt(l,mid,d-n*n);
    srt(mid+1,r,d-n*n);
    int cnt=0;
    for(int i=l;i<=mid;i++){
        for(int j=r;j>=mid+1;j--){
            v[d+cnt].pb({i,j});
            ++cnt;
        }
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n;
    srt(1,n,n*n*20);
    int cnt=0;
    REP(i,maxn){
        if(!sz(v[i])) continue;
        ++cnt;
    }
    cout<<cnt<<'\n';
    REP(i,maxn){
        if(!sz(v[i])) continue;
        for(auto x:v[i]) cout<<"CMPSWP "<<"R"<<x.f<<" R"<<x.s<<' ';
        cout<<'\n';
    }
}

Subtask #1
1.2222222222 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 11980 KB Partially correct

Subtask #2
1.0540540541 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 12052 KB Partially correct

Subtask #3
1.0350877193 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 12052 KB Partially correct

Subtask #4
1.0071174377 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 11980 KB Partially correct

Subtask #5
1.0023584906 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 12108 KB Partially correct

Subtask #6
1.0016116035 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 12108 KB Partially correct

Subtask #7
1.0012077295 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 12108 KB Partially correct

Subtask #8
1.0009555662 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 12236 KB Partially correct

Subtask #9
1.000768935 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 12108 KB Partially correct

Subtask #10
1.0006361323 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 12204 KB Partially correct