oj.uz

Submission #597530

# Submission time Handle Problem Language Result Execution time Memory
597530 2022-07-16T08:56:25 Z Valaki2 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

#define n N

#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

int n;
vector<int> p;

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

void check_range(int l, int r, string s) {
    if(l == r) {
        int idx = -1;
        for(int i = 0; i < n; i++) {
            if(s[i] == '0') {
                idx = i;
            }
        }
        p[idx] = l - 1;
        return;
    }
    int mid = (l + r) / 2;
    vector<int> left_part;
    vector<int> right_part;
    for(int i = 0; i < n; i++) {
        if(s[i] == '0') {
            s[i] = '1';
            if(check_element(s)) {
                left_part.pb(i);
            } else {
                right_part.pb(i);
            }
            s[i] = '0';
        }
    }
    for(int x : right_part) {
        s[x] = '1';
    }
    check_range(l, mid, s);
    for(int x : right_part) {
        s[x] = '0';
    }
    for(int x : left_part) {
        s[x] = '1';
    }
    check_range(mid + 1, r, s);
    for(int x : left_part) {
        s[x] = '0';
    }
}

void solve() {
    add_range(1, n);
    compile_set();
    check_range(1, n, string(n, '0'));
}

#undef n
vector<int> restore_permutation(int n, int w, int r) {
    srand(4242);
    N = n;
    p.assign(N, -1);
    solve();
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.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 296 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 320 KB n = 32
10 Correct 1 ms 296 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 300 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 432 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 2 ms 428 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 428 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 428 KB n = 128
4 Correct 2 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 428 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 408 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 424 KB n = 128
15 Correct 1 ms 468 KB n = 128