oj.uz

Submission #622451

# Submission time Handle Problem Language Result Execution time Memory
622451 2022-08-04T09:45:20 Z Lucpp Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 476 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

void do_add(string s, int l, int r){
    if(l == r) return;
    int m = (l+r)/2;
    for(int i = l; i <= r; i++) s[i] = '0';
    for(int i = l; i <= m; i++){
        s[i] = '1';
        // cerr << s << "\n";
        add_element(s);
        s[i] = '0';
    }
    for(int i = l; i <= m; i++) s[i] = '1';
    do_add(s, m+1, r);
    for(int i = l; i <= m; i++) s[i] = '0';
    for(int i = m+1; i <= r; i++) s[i] = '1';
    do_add(s, l, m);
}

vector<int> p;

void solve(string s, vector<int> v, int res, int val){
    if(val == 0){
        p[v[0]] = res;
        return;
    }
    for(int i : v) s[i] = '0';
    vector<int> a, b;
    for(int i : v){
        s[i] = '1';
        if(check_element(s)) a.push_back(i);
        else b.push_back(i);
        s[i] = '0';
    }
    for(int i : a) s[i] = '1';
    solve(s, b, res+val, val/2);
    for(int i : a) s[i] = '0';
    for(int i : b) s[i] = '1';
    solve(s, a, res, val/2);
}

vector<int> restore_permutation(int n, int w, int r){
    w--, r--; // suppress warning
    string s(n, '0');
    do_add(s, 0, n-1);
    compile_set();
    vector<int> v(n);
    for(int i = 0; i < n; i++) v[i] = i;
    p.resize(n);
    solve(s, v, 0, n/2);
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

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