oj.uz

답안 #961900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961900 2024-04-12T17:31:59 Z ThegeekKnight16 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 612 KB 
#include <bits/stdc++.h>
#include <vector>
#include "messy.h"
using namespace std;
// add_element("0");
// compile_set();
// check_element("0");

void dcBuild(int ini, int fim, int N)
{
    if (ini == fim) return;
    string resp(N, '0');
    for (int i = 0; i < N; i++) if (i < ini || i > fim) resp[i] = '1';
    int m = (ini + fim)>>1;
    for (int j = m+1; j <= fim; j++)
    {
        resp[j] = '1';
        add_element(resp);
        resp[j] = '0';
    }

    dcBuild(ini, m, N);
    dcBuild(m+1, fim, N);
}

void dcResp(int path, vector<int> &p, const vector<int> &sameBit, const vector<int> &otherBit, int N)
{
    if (sameBit.size() == 1) {p[sameBit.back()] = path; return;}
    string resp(N, '0');
    for (auto x : otherBit) resp[x] = '1';
    vector<int> lSame, lOther = otherBit, rSame, rOther = otherBit;
    for (auto x : sameBit)
    {
        resp[x] = '1';
        if (check_element(resp)) lOther.push_back(x), rSame.push_back(x);
        else lSame.push_back(x), rOther.push_back(x);
        resp[x] = '0';
    }

    dcResp((path<<1)+0, p, lSame, lOther, N);
    dcResp((path<<1)+1, p, rSame, rOther, N);
}

vector<int> restore_permutation(int N, int W, int R)
{
    dcBuild(0, N-1, N);
    compile_set();
    vector<int> p(N), sameBit(N), otherBit;
    iota(sameBit.begin(), sameBit.end(), 0);
    dcResp(0, p, sameBit, otherBit, N);
    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 1 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 348 KB n = 8
8 Correct 0 ms 348 KB n = 8
9 Correct 1 ms 348 KB n = 8
10 Correct 1 ms 344 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 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 348 KB n = 32
2 Correct 1 ms 348 KB n = 32
3 Correct 1 ms 344 KB n = 32
4 Correct 1 ms 344 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 1 ms 348 KB n = 32
7 Correct 1 ms 348 KB n = 32
8 Correct 1 ms 344 KB n = 32
9 Correct 1 ms 604 KB n = 32
10 Correct 1 ms 348 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 1 ms 348 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #5
30.0 / 30.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 600 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 600 KB n = 128
10 Correct 1 ms 600 KB n = 128
11 Correct 2 ms 612 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 2 ms 604 KB n = 128
14 Correct 1 ms 600 KB n = 128
15 Correct 1 ms 604 KB n = 128