oj.uz

Submission #760764

# Submission time Handle Problem Language Result Execution time Memory
760764 2023-06-18T11:08:44 Z Dakto Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 480 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

int n;

std::vector<int> res;

void gen_rec(int l, int r){
    if(l+1==r) return;
    string s(n,'0');
    for(int i=l; i<r; i++) s[i]='1';
    int mid=(l+r)/2;
    for(int i=l; i<mid; i++){
        s[i]='0';
        add_element(s);
        s[i]='1';
    }
    gen_rec(l,mid);
    gen_rec(mid,r);
}

void gen_res(int l, int r, set<int> st){
    if(l+1==r){
        res[*begin(st)]=l;
        return;
    }
    string s(n, '0');
    for(auto i:st) s[i]='1';
    set<int> s1,s2;
    for(auto i:st) {
        s[i]='0';
        bool t=check_element(s);
        s[i]='1';
        if(t) s1.insert(i);
        else s2.insert(i);
    }
    int mid=(l+r)/2;
    gen_res(l,mid,s1);
    gen_res(mid,r,s2);
}

std::vector<int> restore_permutation(int N, int w, int r) {
    n=N;
    res.resize(n);
    gen_rec(0,n);
    compile_set();
    set<int> st;
    for(int i=0; i<n; i++) st.insert(i);
    gen_res(0,n,st);
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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