oj.uz

Submission #421130

# Submission time Handle Problem Language Result Execution time Memory
421130 2021-06-08T18:36:46 Z Sundavar Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 464 KB 
#include <bits/stdc++.h>

using namespace std;
void add_element(string s);
bool check_element(string s);
void compile_set();

int N;
void insert(int l, int r){
    string s(N, '1');
    for(int i = l; i < r; i++) s[i] = '0';
    int m = (l+r)/2;
    for(int i = l; i < m; i++) s[i] = '1', add_element(s), s[i] = '0';
    if(l != r-1)
        insert(l, m), insert(m, r);
}
vector<int> ans;
void revert(int l, int r, vector<int>& poss){
    if(l == r-1){
        ans[poss[0]] = l;
        return;
    }
    string s(N, '1');
    for(int& a : poss) s[a] = '0';
    vector<int> lef, rig;
    for(int& a : poss){
        s[a] = '1';
        if(check_element(s)) lef.push_back(a);
        else rig.push_back(a);
        s[a] = '0';
    }
    revert(l, (l+r)/2, lef), revert((l+r)/2, r, rig);
    
}
vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    insert(0,n);
    compile_set();
    ans.resize(n);
    vector<int> poss(n);
    for(int i = 0; i < n; i++) poss[i] = i;
    revert(0, n, poss);
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 332 KB n = 8
6 Correct 1 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 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 1 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 0 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 #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB n = 128
2 Correct 1 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 1 ms 460 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 1 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 1 ms 460 KB n = 128
14 Correct 1 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 460 KB n = 128
3 Correct 1 ms 460 KB n = 128
4 Correct 2 ms 460 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 1 ms 460 KB n = 128
7 Correct 2 ms 460 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 3 ms 460 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 1 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 1 ms 464 KB n = 128