oj.uz

Submission #419891

# Submission time Handle Problem Language Result Execution time Memory
419891 2021-06-07T15:56:45 Z Peti Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 464 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

void add(vector<int> v, string s, int y, int n){
    if((1<<y) >= n) return;
    vector<int> v1, v2;
    for(int x : v){
        if(x&(1<<y)){
            s[x] = '1';
            add_element(s);
            s[x] = '0';
            v2.push_back(x);
        } else
            v1.push_back(x);
    }
    string s2 = s;
    for(int x : v2)
        s2[x] = '1';
    add(v1, s2, y+1, n);
    s2 = s;
    for(int x : v1)
        s2[x] = '1';
    add(v2, s2, y+1, n);
}

vector<int> ret;
void megold(vector<int> v, string s, int y, int n){
    if((1<<y) >= n) return;
    vector<int> v1, v2;
    for(int x : v){
        s[x] = '1';
        if(check_element(s)){
            v2.push_back(x);
            ret[x] += (1<<y);
        } else
            v1.push_back(x);
        s[x] = '0';
    }
    string s2 = s;
    for(int x : v2)
        s2[x] = '1';
    megold(v1, s2, y+1, n);
    s2 = s;
    for(int x : v1)
        s2[x] = '1';
    megold(v2, s2, y+1, n);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    ret.resize(n, 0);
    string s;
    s.assign(n, '0');
    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    add(v, s, 0, n);
    compile_set();
    megold(v, s, 0, n);

    return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

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