oj.uz

Submission #405371

# Submission time Handle Problem Language Result Execution time Memory
405371 2021-05-16T10:11:43 Z rocks03 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 556 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void add_element(string x);
void compile_set();
bool check_element(string x);

vector<string> elementi;
void prepara(int l, int r, string& s){
    if(l == r) return;
    int m = (l + r) / 2;
    rep(i, l, m){
        s[i] = '1'; elementi.pb(s); s[i] = '0';
    }
    rep(i, m + 1, r) s[i] = '1';
    prepara(l, m, s);
    rep(i, m + 1, r) s[i] = '0';
    rep(i, l, m) s[i] = '1';
    prepara(m + 1, r, s);
    rep(i, l, m) s[i] = '0';
}

vector<int> ans;
void solve(int l, int r, vector<int>& q, string& s){
    if(l == r){
        assert(SZ(q) == 1); ans[q[0]] = l; return;
    }
    int m = (l + r) / 2;
    vector<int> ql, qr;
    string sl = s, sr = s;
    for(int i : q){
        s[i] = '1';
        if(check_element(s)){
            ql.pb(i); sr[i] = '1';
        } else{
            qr.pb(i); sl[i] = '1';
        }
        s[i] = '0';
    }
    solve(l, m, ql, sl);
    solve(m + 1, r, qr, sr);
}

vector<int> restore_permutation(int N, int W, int R){
    string s(N, '0');
    prepara(0, N - 1, s);
    for(string x : elementi) add_element(x);
    compile_set();
    ans = vector<int>(N);
    vector<int> q(N); iota(all(q), 0);
    solve(0, N - 1, q, s);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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