oj.uz

Submission #69144

# Submission time Handle Problem Language Result Execution time Memory
69144 2018-08-20T07:28:55 Z mr_banana Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int N;
const int MN=500;
void writ(int l,int r){
    if(r-l<2){
        return;
    }
    string s;
    int mid=(l+r)/2;
    for(int i=0;i<l;i++){
        s+='1';
    }
    for(int i=l;i<r;i++){
        s+='0';
    }
    for(int i=r;i<N;i++){
        s+='1';
    }
    for(int i=l;i<mid;i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    writ(l,mid);
    writ(mid,r);
}
int p[MN];
void restore(int l,int r,set<int> pos){
    string s;
    for(int i=0;i<N;i++){
        if(pos.count(i)==0){
            s+='1';
        }
        else{
            s+='0';
        }
    }
    if(r-l<2){
        p[*pos.begin()]=l;
        return;
    }
    set<int> pos1,pos2;
    for(int i:pos){
        s[i]='1';
        if(check_element(s)){
            pos1.insert(i);
        }
        else{
            pos2.insert(i);
        }
        s[i]='0';
    }
    int mid=(l+r)/2;
    restore(l,mid,pos1);
    restore(mid,r,pos2);
}
vector<int> restore_permutation(int n, int w, int r) {
    N=n;
    writ(0,N);
    compile_set();
    set<int> s;
    for(int i=0;i<N;i++){
        s.insert(i);
    }
    restore(0,N,s);
    vector<int> v;
    for(int i=0;i<n;i++){
        v.push_back(p[i]);
    }
    return v;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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