oj.uz

Submission #477231

# Submission time Handle Problem Language Result Execution time Memory
477231 2021-10-01T09:27:54 Z ponytail Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 596 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

int fastlog(int n) {
    return 32 - __builtin_clz(n) - 1;
}
std::vector<int> restore_permutation(int n, int w, int r) {
    vector<int> p(n);
    string empty;
    for(int i=0; i<n; i++) empty += '0';
    for(int i=1; i<n; i+=2) {
        empty[i] = '1';
        add_element(empty);
        empty[i] = '0';
    }
    for(int i=1; i<fastlog(n); i++) {
        for(int j=0; j<n; j++) {
            if((j&(1<<i)) != 0) {
                int v = j % (1<<i);
                v = (1<<i) - 1 - v;
                for(int k=0; k<n; k++) {
                    if(k % (1<<i) == v % (1<<i)) {
                        empty[k] = '1';
                    }
                }
                empty[j] = '1';
                add_element(empty);
                for(int k=0; k<n; k++) {
                    empty[k] = '0';
                }
            }
        }
    }
    compile_set();
    for(int i=0; i<n; i++) {
        empty[i] = '1';
        if(check_element(empty)) {
            p[i]++;
        }
        empty[i] = '0';
    }
    for(int i=1; i<fastlog(n); i++) {
        for(int j=0; j<n; j++) {
            int v = (1<<i) - 1 - p[j];
            for(int k=0; k<n; k++) {
                if(p[k] % (1<<i) == v % (1<<i)) {
                    empty[k] = '1';
                }
            }
            empty[j] = '1';
            if(check_element(empty)) {
                p[j] += (1<<i);
            }
            for(int k=0; k<n; k++) {
                empty[k] = '0';
            }
        }
    }
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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