oj.uz

답안 #861668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861668 2023-10-16T16:02:28 Z TahirAliyev Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 604 KB 
#include <vector>
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

const int MAX = 130;

void write(int l, int r, int n){
    if(l == r) return;
    string s = "";
    for(int i = 0; i < n; i++){
        if(l <= i && i <= r){
            s += '0';
        }
        else{
            s += '1';
        }
    }
    int mid = (l + r) / 2;
    for(int i = l; i <= mid; i++){
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    write(l, mid, n);
    write(mid + 1, r, n);
}

int p[MAX];

void read(int l, int r, vector<int> inc, int n){
    if(l == r){
        p[inc[0]] = l;
        return;
    }
    string s = "";
    for(int i = 0; i < n; i++){
        s += '1';
    }
    for(int a : inc){
        s[a] = '0';
    }
    int mid = (l + r) / 2;
    vector<int> lv, rv;
    for(int i : inc){
        s[i] = '1';
        if(check_element(s)){
            lv.push_back(i);
        }
        else{
            rv.push_back(i);
        }
        s[i] = '0';
    }
    read(l, mid, lv, n);
    read(mid + 1, r, rv, n);
}

vector<int> restore_permutation(int n, int w, int r) {
    write(0, n - 1, n);
    compile_set();
    vector<int> tmp;
    for(int i = 0; i < n; i++) tmp.push_back(i);
    read(0, n - 1, tmp, n);
    vector<int> res;
    for(int i = 0; i < n; i++){
        res.push_back(p[i]);
    } 
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 1 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 1 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 1 ms 600 KB n = 32
11 Correct 1 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 #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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