oj.uz

답안 #563456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563456 2022-05-17T08:38:19 Z elazarkoren Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 496 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 150;

int n;

void Create(int l, int r) {
    if (l + 1 == r) return;
    string s(n, '1');
    fill(s.begin() + l, s.begin() + r, '0');
    for (int i = l; i < (l + r) >> 1; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    Create(l, (l + r) >> 1), Create((l + r) >> 1, r);
}

vi ans;

void Solve(int l, int r, vi &image) {
    if (l + 1 == r) {
        ans[image[0]] = l;
        return;
    }
    string s(n, '1');
    for (int i : image) s[i] = '0';
    vi left, right;
    for (int i = 0; i < n; i++) {
        if (s[i] == '0') {
            s[i] = '1';
            if  (check_element(s)) left.push_back(i);
            else right.push_back(i);
            s[i] = '0';
        }
    }
    Solve(l, (l + r) >> 1, left), Solve((l + r) >> 1, r, right);
}

vi restore_permutation(int N, int w, int r) {
    n = N;
    Create(0, n);
    compile_set();
    ans.resize(n);
    vi image(n);
    iota(all(image), 0);
    Solve(0, n, image);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 296 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 304 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 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 1 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 432 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 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 2 ms 432 KB n = 128
11 Correct 2 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 496 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 2 ms 424 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 428 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 432 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 1 ms 428 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 1 ms 428 KB n = 128
12 Correct 2 ms 428 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128