oj.uz

Submission #108050

# Submission time Handle Problem Language Result Execution time Memory
108050 2019-04-27T03:34:03 Z PeppaPig Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 8 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> ans;

string gen_base(int l, int r, int idx) {
    string s(n, '1');
    for(int i = l; i <= r; i++) s[i] = '0';
    s[idx] = '1';
    return s;
}

string gen_find(vector<int> &v, int idx) {
    string s(n, '1');
    for(int pos : v) s[pos] = '0';
    s[idx] = '1';
    return s;
}

void build(int l = 0, int r = n-1) {
    if(l == r) return;
    int mid = (l + r) >> 1;
    for(int i = l; i <= mid; i++) add_element(gen_base(l, r, i));
    build(l, mid), build(mid+1, r);
}

void restore(vector<int> &v, int l = 0, int r = n-1) {
    if(l == r) return void(ans[v[0]] = l);
    vector<int> L, R;
    for(int pos : v) {
        if(check_element(gen_find(v, pos))) L.emplace_back(pos);
        else R.emplace_back(pos);
    }
    int mid = (l + r) >> 1;
    restore(L, l, mid), restore(R, mid+1, r);
}

vector<int> restore_permutation(int _n, int w, int r) {
    n = _n; 
    build(), compile_set();

    vector<int> v;
    for(int i = 0; i < n; i++) v.emplace_back(i);
    ans = vector<int>(n, 0);
    restore(v);

    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 256 KB n = 8
4 Correct 2 ms 384 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 256 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 384 KB n = 8
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 32
2 Correct 2 ms 384 KB n = 32
3 Correct 2 ms 384 KB n = 32
4 Correct 2 ms 384 KB n = 32
5 Correct 2 ms 384 KB n = 32
6 Correct 2 ms 384 KB n = 32
7 Correct 2 ms 384 KB n = 32
8 Correct 2 ms 384 KB n = 32
9 Correct 2 ms 384 KB n = 32
10 Correct 2 ms 384 KB n = 32
11 Correct 2 ms 384 KB n = 32
12 Correct 2 ms 384 KB n = 32
13 Correct 2 ms 256 KB n = 32
14 Correct 2 ms 256 KB n = 32
15 Correct 3 ms 384 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 32
2 Correct 2 ms 384 KB n = 32
3 Correct 2 ms 384 KB n = 32
4 Correct 3 ms 384 KB n = 32
5 Correct 2 ms 384 KB n = 32
6 Correct 2 ms 384 KB n = 32
7 Correct 2 ms 384 KB n = 32
8 Correct 7 ms 384 KB n = 32
9 Correct 2 ms 384 KB n = 32
10 Correct 2 ms 256 KB n = 32
11 Correct 2 ms 384 KB n = 32
12 Correct 2 ms 384 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 384 KB n = 32
15 Correct 2 ms 384 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB n = 128
2 Correct 3 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 ms 512 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 ms 512 KB n = 128
7 Correct 3 ms 512 KB n = 128
8 Correct 3 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 3 ms 512 KB n = 128
12 Correct 3 ms 512 KB n = 128
13 Correct 3 ms 512 KB n = 128
14 Correct 3 ms 512 KB n = 128
15 Correct 3 ms 512 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 508 KB n = 128
2 Correct 3 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 ms 512 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 ms 512 KB n = 128
7 Correct 3 ms 512 KB n = 128
8 Correct 3 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 3 ms 512 KB n = 128
12 Correct 3 ms 512 KB n = 128
13 Correct 3 ms 512 KB n = 128
14 Correct 8 ms 512 KB n = 128
15 Correct 3 ms 512 KB n = 128