oj.uz

Submission #425248

# Submission time Handle Problem Language Result Execution time Memory
425248 2021-06-12T17:27:34 Z pliam Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 460 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXLOGN 7
#define MAXN 128
typedef vector<int> vi;

int N;
int p[MAXN];

void fill_w(int l,int r,vi known){//[l,r] not in known
    string s;
    for(int i=0;i<N;i++){
        s += known[i]?'1':'0';
    }
    for(int i=l;i<=r;i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
}

void solve_w(int start=0,int end=N-1){
    if(start==end) return;
    vi known(N);
    for(int i=0;i<N;i++){
        if(start<=i&&i<=end) known[i]=0;
        else known[i]=1;
    }
    int mid=(start+end)/2;
    fill_w(start,mid,known);
    solve_w(start,mid);
    solve_w(mid+1,end);
}

vi fill_r(vi known){
    string s;
    vi ret=known;
    for(int i=0;i<N;i++){
        s += known[i]?'1':'0';
    }
    for(int i=0;i<N;i++){
        if(known[i]) continue;
        s[i]='1';
        if(check_element(s)) ret[i]=1;
        s[i]='0';
    }
    return ret;
}

void solve_r(int start,int end,vi known){
    if(start==end){
        for(int i=0;i<N;i++){
            if(!known[i]){
                p[i]=start;
                return;
            }
        }
    }
    int mid=(start+end)/2;
    vi ans=fill_r(known);
    solve_r(mid+1,end,ans);
    for(int i=0;i<N;i++){
        if(known[i]==ans[i]) ans[i]=1;
        else ans[i]=0;
    }
    solve_r(start,mid,ans);
}

vi restore_permutation(int n, int w, int r) {
    N=n;
    solve_w();
    compile_set();
    vi empty(N,0);
    solve_r(0,N-1,empty);
    return vi(p,p+N);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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