oj.uz

Submission #935151

# Submission time Handle Problem Language Result Execution time Memory
935151 2024-02-28T18:00:22 Z Macker Unscrambling a Messy Bug (IOI16_messy) C++17
70 / 100
 1 ms 856 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)

std::vector<int> restore_permutation(int n, int w, int r) {
    int log = (int)(log2(n) + 0.5);
    FOR(l, log){
        string s(n, '0');
        FOR(j, l) s[j] = '1';
        FOR(i, n){
            if(i & (1 << l)){
                string t = s;
                t[i] = '1';
                add_element(t);
            }
        }
        string t(n, '0');
        FOR(j, n) if(s[j] == '0') t[j] = '1';
        add_element(t);
    }
    compile_set();
    vector<int> ids;
    vector<int> p(n, 0);
    FOR(l, log){
        string s(n, '0');
        for (int j : ids) s[j] = '1';
        FOR(i, n){
            if(s[i] == '1') continue;
            string t = s;
            t[i] = '1';
            if(check_element(t)){
                p[i] |= (1 << l);
            }
        }
        s = string(n, '1');
        for (int j : ids) s[j] = '0';
        FOR(i, n){
            if(s[i] == '0') continue;
            string t = s;
            t[i] = '0';
            if(check_element(t)){
                ids.push_back(i);
                break;
            }
        }
    }
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB grader returned WA
2 Halted 0 ms 0 KB -