oj.uz

답안 #784073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784073 2023-07-15T15:46:36 Z zsombor Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 512 KB 
#include <iostream>
#include <vector>
#include "messy.h"
using namespace std;

string s = "";

char opp(int i) {
    return (s[i] == '0' ? '1' : '0');
}

vector <int> restore_permutation(int n, int w, int r) {
    int l = 0; while ((n & (1 << l)) == 0) l++;
    for (int i = 0; i < n; i++) s.push_back('0');
    for (int i = 1; i < n; i += 2) { s[i] = '1'; add_element(s); s[i] = '0'; }
    for (int j = 1; j < l; j++) {
        for (int i = 0; i < n; i++) s[i] = (i & (1 << (j - 1))) ? '1' : '0';
        for (int i = 0; i < n; i++) {
            if ((i & (1 << j)) == 0) continue;
            s[i] = opp(i);
            add_element(s);
            s[i] = opp(i);
        }
    }
    compile_set();
    fill(s.begin(), s.end(), '0');
    vector <vector <bool>> b(n, vector <bool>(l, false));
    for (int i = 0; i < n; i++) { s[i] = '1'; b[i][0] = check_element(s); s[i] = '0'; }
    for (int j = 1; j < l; j++) {
        for (int i = 0; i < n; i++) s[i] = b[i][j - 1] ? '1' : '0';
        for (int i = 0; i < n; i++) {
            s[i] = opp(i);
            b[i][j] = check_element(s);
            s[i] = opp(i);
        }
    }
    vector <int> ans(n, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < l; j++) {
            if (b[i][j]) ans[i] += (1 << j);
        }
    }
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 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 1 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 1 ms 468 KB n = 128
14 Correct 1 ms 512 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 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 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128