oj.uz

Submission #231777

# Submission time Handle Problem Language Result Execution time Memory
231777 2020-05-14T17:51:12 Z MarWarPL Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 6 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define FOR(i,x,y) for(int i=(int)(x);i<(int)(y);++i)
#define FORE(i,x,y) for(int i=(int)(x);i<=(int)(y);++i)
#define FORD(i,x,y) for(int i=(int)(x);i>=(int)(y);++i)
#define PB push_back
#define ST first
#define ND second
typedef long long ll;
typedef pair<int,int> pii;
const int INF=2e9;

int n;
vector<int> ans;
void madd(string s,int x){
    FOR(i,0,n){
        if(i&(1<<x)&&s[i]=='0'){
            s[i]='1';
            add_element(s);
            s[i]='0';
        }
    }
    if(x<=0)return;
    string s2=s;
    FOR(i,0,n){
        if(i&(1<<x)){
            s2[i]='1';
        }else{
            s[i]='1';
        }
    }
    madd(s,x-1);
    madd(s2,x-1);
}

void chk(string s,int x){
    bool je[128];
    FOR(i,0,n){
        if(s[i]=='0'){
            s[i]='1';
            je[i]=check_element(s);
            s[i]='0';
        }else{
            je[i]=false;
        }
    }
    string s2=s;
    FOR(i,0,n){
        if(je[i]){
            s2[i]='1';
            ans[i]+=(1<<x);
        }else{
            s[i]='1';
        }
    }
    if(x>0){
        chk(s,x-1);
        chk(s2,x-1);
    }
}
vector<int> restore_permutation(int _n, int w, int r) {
    n=_n;
    ans.resize(n);
    int b=1;
    while(n!=(1<<b))++b;
    madd(string(n,'0'),b-1);
    compile_set();
    chk(string(n,'0'),b-1);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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