oj.uz

Submission #586715

# Submission time Handle Problem Language Result Execution time Memory
586715 2022-06-30T14:50:39 Z georgievskiy Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

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

vector<int> ans;

void solve(int n, int l, int r, vector<int> t) {
    if (l + 1 == r) {
        ans[t[0]] = l;
        return;
    }
    int m = (r + l) / 2;
    string s(n, '1');
    for (int x : t)
        s[x] = '0';
    vector<int> lh, rh;
    for (int x : t) {
        s[x] = '1';
        if (check_element(s)) {
            lh.push_back(x);
        } else {
            rh.push_back(x);
        }
        s[x] = '0';
    }
    assert(lh.size() == rh.size());
    solve(n, l, m, lh);
    solve(n, m, r, rh);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    add_seg(n, 0, n);
    compile_set();
    ans.resize(n);
    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    solve(n, 0, n, v);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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