oj.uz

Submission #720314

# Submission time Handle Problem Language Result Execution time Memory
720314 2023-04-08T01:55:53 Z hoainiem Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>

#include "messy.h"
using namespace std;
string zer;
vector<int>ds, ans;
int N;
void dq(int l, int r, string cur){
    if (l == r)
        return;
    int mid = (l + r) >> 1;
    for (int i = l; i <= mid; i++){
        cur[i] = '1';
        add_element(cur);
        cur[i] = '0';
    }
    for (int i = l; i <= mid; i++)
        cur[i] = '1';
    dq(mid + 1, r, cur);
    for (int i = 0; i < N; i++)
        cur[i] = '0' + '1' - cur[i];
    dq(l, mid, cur);
}
void calc(int l, int r, vector<int> vt, string cur){
    if (l == r){
        ans[*vt.begin()] = l;
        return;
    }
    int mid = (l + r) >> 1;
    vector<int>lc, rc;
    random_shuffle(vt.begin(), vt.end());
    for (int tmp : vt){
        cur[tmp] = '1';
        if ((int)lc.size() != mid - l + 1 && check_element(cur))
            lc.push_back(tmp);
        else
            rc.push_back(tmp);
        cur[tmp] = '0';
    }
    for (int tmp : lc)
        cur[tmp] = '1';
    calc(mid + 1, r, rc, cur);
    for (int i = 0; i < N; i++)
        cur[i] = '0' + '1' - cur[i];
    calc(l, mid, lc, cur);
}
std::vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    ans.resize(n);
    zer.resize(n, '0');
    dq(0, n - 1, zer);
    compile_set();
    for (int i = 0; i < n; i++)
        ds.push_back(i);
    calc(0, n - 1, ds, zer);
    return ans;
}

Subtask #1
20.0 / 20.0

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