oj.uz

Submission #667151

# Submission time Handle Problem Language Result Execution time Memory
667151 2022-11-30T13:13:16 Z Lobo Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 504 KB 
#include<bits/stdc++.h>
#include "messy.h"
using namespace std;

int n;
vector<int> p;
void add(int l, int r) {
    if(l == r) {
        return;
    }
    int mid = (l+r)>>1;
    string s;
    for(int i = 0; i < n; i++) {
        if(l <= i && i <= r) s+= '0';
        else s+= '1';
    }
    for(int i = l; i <= mid; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    add(l,mid);
    add(mid+1,r);
}

void check(int l, int r, set<int> st) {
    if(l == r) {
        p[*st.begin()] = l;
        return;
    }
    int mid = (l+r)>>1;

    string s;
    for(int i = 0; i < n; i++) {
        if(st.count(i)) s+= '0';
        else s+= '1';
    }
    set<int> stl,str;
    for(auto x : st) {
        s[x] = '1';
        if(check_element(s)) stl.insert(x);
        else str.insert(x);
        s[x] = '0';
    }

    check(l,mid,stl);
    check(mid+1,r,str);
}

vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    add(0,n-1);
    compile_set();
    p.resize(n);
    set<int> st;
    for(int i = 0; i < n; i++) st.insert(i);
    check(0,n-1,st);
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 296 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 300 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 300 KB n = 8
15 Correct 0 ms 212 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 220 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 304 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 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 224 KB n = 32
15 Correct 1 ms 312 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB n = 32
2 Correct 1 ms 316 KB n = 32
3 Correct 1 ms 224 KB n = 32
4 Correct 1 ms 224 KB n = 32
5 Correct 1 ms 304 KB n = 32
6 Correct 1 ms 220 KB n = 32
7 Correct 1 ms 216 KB n = 32
8 Correct 1 ms 224 KB n = 32
9 Correct 1 ms 308 KB n = 32
10 Correct 1 ms 224 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 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 #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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