oj.uz

답안 #922006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922006 2024-02-04T16:48:20 Z Pannda Unscrambling a Messy Bug (IOI16_messy) C++17
70 / 100
 2 ms 760 KB 
#include "messy.h"
using namespace std;

vector<int> restore_permutation(int n, int w, int r) {
    int k = 32 - __builtin_clz(n);
    vector<int> p(n, 0);

    auto addSubset = [&](vector<int> subset) {
        string s(n, '0');
        for (int i : subset) {
            s[i] = '1';
        }
        add_element(s);
    };
    for (int b = 0; b < k; b++) {
        int mask = (1 << b) - 1;
        for (int base = 0; base < n; base++) {
            if (base >> b & 1) {
                vector<int> subset = { base };
                for (int aug = 0; aug < n; aug++) {
                    if ((aug & mask) != (base & mask)) {
                        subset.push_back(aug);
                    }
                }
                addSubset(subset);
            }
        }
    }

    compile_set();

    auto checkSubset = [&](vector<int> subset) {
        string s(n, '0');
        for (int i : subset) {
            s[i] = '1';
        }
        return check_element(s);
    };
    for (int b = 0; b < k; b++) {
        int mask = (1 << b) - 1;
        for (int i = 0; i < n; i++) { // here tries to infer the 2^b bit of p[i]
            vector<int> subset = { i };
            for (int j = 0; j < n; j++) {
                if ((p[j] & mask) != (p[i] & mask)) {
                    subset.push_back(j);
                }
            }
            p[i] |= checkSubset(subset) << b;
        }
    }

    return p;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 1 ms 348 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 1 ms 348 KB n = 8
8 Correct 0 ms 348 KB n = 8
9 Correct 0 ms 348 KB n = 8
10 Correct 1 ms 348 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 1 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n = 32
2 Correct 1 ms 344 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 1 ms 344 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 1 ms 344 KB n = 32
8 Correct 1 ms 344 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 1 ms 436 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 1 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 32
2 Correct 1 ms 348 KB n = 32
3 Correct 0 ms 348 KB n = 32
4 Correct 1 ms 348 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 1 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 1 ms 344 KB n = 32
11 Correct 1 ms 344 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 1 ms 760 KB n = 32
15 Correct 1 ms 548 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB n = 128
2 Correct 2 ms 600 KB n = 128
3 Correct 2 ms 604 KB n = 128
4 Correct 2 ms 636 KB n = 128
5 Correct 2 ms 604 KB n = 128
6 Correct 2 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 2 ms 600 KB n = 128
9 Correct 2 ms 604 KB n = 128
10 Correct 2 ms 600 KB n = 128
11 Correct 2 ms 604 KB n = 128
12 Correct 2 ms 604 KB n = 128
13 Correct 2 ms 604 KB n = 128
14 Correct 2 ms 604 KB n = 128
15 Correct 2 ms 600 KB n = 128

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 600 KB grader returned WA
2 Halted 0 ms 0 KB -