oj.uz

Submission #623463

# Submission time Handle Problem Language Result Execution time Memory
623463 2022-08-05T16:06:49 Z M_W Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
bool pos[128][128]; // original ==> permuted
int N;

void process(string ask, int l, int r){
    if(l == r) return;

    int mid = (l + r) >> 1;
    for(int i = l; i <= mid; i++){
        ask[i] = '1';
        add_element(ask);
        ask[i] = '0';
    }
    for(int i = l; i <= mid; i++) ask[i] = '1';
    process(ask, mid + 1, r);
    for(int i = l; i <= mid; i++) ask[i] = '0';
    for(int i = mid + 1; i <= r; i++) ask[i] = '1';
    process(ask, l, mid);
}

void solve(string ask, int l, int r, vector<int> v){
    if(l == r) return;
    
    vector<int> ll, rr;
    int mid = (l + r) >> 1;
    for(auto x : v){
        ask[x] = '1';
        bool res = check_element(ask);
        ask[x] = '0';

        for(int i = l; i <= mid; i++) pos[i][x] = res;
        for(int i = mid + 1; i <= r; i++) pos[i][x] = !res;

        if(res) ll.push_back(x);
        else rr.push_back(x);
    }

    for(auto x : ll) ask[x] = '1';
    solve(ask, mid + 1, r, rr);

    for(auto x : ll) ask[x] = '0';
    for(auto x : rr) ask[x] = '1';
    solve(ask, l, mid, ll);
}

vector<int> restore_permutation(int _N, int W, int R){
    N = _N; string ask;
    for(int i = 0; i < N; i++) ask += "0";
    process(ask, 0, N - 1);
    compile_set();

    vector<int> v;
    for(int i = 0; i < N; i++) v.push_back(i);
    solve(ask, 0, N - 1, v);

    vector<int> res(N);
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(pos[j][i]) res[i] = j;
        }
    }
    return res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 ms 300 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 0 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 212 KB n = 8
14 Correct 1 ms 212 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 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 304 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 308 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 #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB n = 32
2 Correct 1 ms 340 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 300 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 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 2 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 2 ms 432 KB n = 128
7 Correct 2 ms 432 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 424 KB n = 128
14 Correct 1 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 436 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 428 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 436 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 432 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 436 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