oj.uz

Submission #320816

# Submission time Handle Problem Language Result Execution time Memory
320816 2020-11-10T03:30:26 Z zaneyu Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 640 KB 
/*input
8 100 100
6 4 7 3 2 1 5 0
*/
#include "messy.h"
#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<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#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()
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
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)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
void add(int n,int l,int r){
    if(l>r) return;
    int mid=(l+r)/2;
    for(int i=l;i<=mid;i++){
        string s;
        s.resize(n);
        REP(j,n){
            if(i==j) s[j]='1';
            else{
                if(j<l or j>r) s[j]='1';
                else s[j]='0';
            }
        }
        add_element(s);
        //cout<<s<<'\n';
    }
    if(l==r) return;
    add(n,l,mid);
    add(n,mid+1,r);
}
void solve(int n,int l,int r,vector<int> &ans,set<int> idx){
    if(l>r) return;
    if(l==r){
        ans[l]=(*idx.begin());
        return;
    }
    int mid=(l+r)/2;
    set<int> ls,rs;
    for(int z:idx){
        string s;
        s.resize(n);
        REP(j,n){
            if(idx.find(j)==idx.end()) s[j]='1';
            else{
                if(j==z) s[j]='1';
                else s[j]='0';
            }
        }
        if(check_element(s)) ls.insert(z);
        else rs.insert(z);
    }
    solve(n,l,mid,ans,ls);
    solve(n,mid+1,r,ans,rs);
}
vector<int> restore_permutation(int n, int w, int r) {
    add(n,0,n-1);
    compile_set();
    vector<int> ans(n);
    set<int> s;
    REP(i,n) s.insert(i);
    solve(n,0,n-1,ans,s);
    vector<int> rans(n);
    REP(i,n) rans[ans[i]]=i;
    return rans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 8
2 Correct 1 ms 364 KB n = 8
3 Correct 1 ms 360 KB n = 8
4 Correct 1 ms 364 KB n = 8
5 Correct 1 ms 364 KB n = 8
6 Correct 1 ms 364 KB n = 8
7 Correct 1 ms 364 KB n = 8
8 Correct 1 ms 364 KB n = 8
9 Correct 1 ms 364 KB n = 8
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 384 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 32
2 Correct 1 ms 364 KB n = 32
3 Correct 1 ms 364 KB n = 32
4 Correct 1 ms 364 KB n = 32
5 Correct 1 ms 492 KB n = 32
6 Correct 1 ms 364 KB n = 32
7 Correct 1 ms 364 KB n = 32
8 Correct 1 ms 384 KB n = 32
9 Correct 1 ms 364 KB n = 32
10 Correct 1 ms 364 KB n = 32
11 Correct 1 ms 364 KB n = 32
12 Correct 1 ms 364 KB n = 32
13 Correct 1 ms 364 KB n = 32
14 Correct 1 ms 364 KB n = 32
15 Correct 1 ms 364 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 32
2 Correct 1 ms 364 KB n = 32
3 Correct 1 ms 364 KB n = 32
4 Correct 1 ms 364 KB n = 32
5 Correct 1 ms 364 KB n = 32
6 Correct 1 ms 364 KB n = 32
7 Correct 1 ms 364 KB n = 32
8 Correct 1 ms 364 KB n = 32
9 Correct 1 ms 364 KB n = 32
10 Correct 1 ms 364 KB n = 32
11 Correct 1 ms 364 KB n = 32
12 Correct 1 ms 364 KB n = 32
13 Correct 1 ms 364 KB n = 32
14 Correct 1 ms 364 KB n = 32
15 Correct 1 ms 364 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 620 KB n = 128
2 Correct 5 ms 492 KB n = 128
3 Correct 5 ms 492 KB n = 128
4 Correct 3 ms 492 KB n = 128
5 Correct 3 ms 492 KB n = 128
6 Correct 4 ms 492 KB n = 128
7 Correct 3 ms 492 KB n = 128
8 Correct 4 ms 492 KB n = 128
9 Correct 3 ms 492 KB n = 128
10 Correct 3 ms 492 KB n = 128
11 Correct 3 ms 492 KB n = 128
12 Correct 3 ms 492 KB n = 128
13 Correct 4 ms 528 KB n = 128
14 Correct 4 ms 632 KB n = 128
15 Correct 4 ms 492 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB n = 128
2 Correct 3 ms 492 KB n = 128
3 Correct 3 ms 492 KB n = 128
4 Correct 4 ms 492 KB n = 128
5 Correct 3 ms 492 KB n = 128
6 Correct 3 ms 492 KB n = 128
7 Correct 3 ms 492 KB n = 128
8 Correct 3 ms 492 KB n = 128
9 Correct 4 ms 640 KB n = 128
10 Correct 4 ms 492 KB n = 128
11 Correct 3 ms 492 KB n = 128
12 Correct 3 ms 492 KB n = 128
13 Correct 4 ms 492 KB n = 128
14 Correct 3 ms 492 KB n = 128
15 Correct 3 ms 492 KB n = 128