oj.uz

답안 #1044441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044441 2024-08-05T09:42:55 Z Zicrus Unscrambling a Messy Bug (IOI16_messy) C++17
49 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

typedef long long ll;

vector<int> restore_permutation(int n, int w, int r) {
    string s = "";
    for (int i = 0; i < n; i++) s += '0';
    for (int i = 0; i < n-1; i++) {
        s[i] = '1';
        add_element(s);
    }
    compile_set();

    vector<int> G(n);
    for (int i = 0; i < n; i++) G[i] = i;
    mt19937 mt(time(0));
    shuffle(G.begin(), G.end(), mt);

    vector<bool> vst(n);
    vector<int> res(n);
    for (int i = 0; i < n; i++) s[i] = '0';
    for (int i = 0; i < n; i++) {
        bool found = false;
        ll skipped = -1;
        for (int p1 = 0; p1 < n && !found; p1++) {
            int p = G[p1];
            if (vst[p]) continue;
            if (skipped == -1) {
                skipped = p;
                continue;
            }

            string tmp = s;
            tmp[p] = '1';
            found = check_element(tmp);
            r--;
            volatile int h = 0;
            while (r <= 2) {
                (&tmp)[h++] = 134;
            }
            if (found) {
                s[p] = '1';
                vst[p] = true;
                res[p] = i;
            }
        }
        if (!found) {
            s[skipped] = '1';
            vst[skipped] = true;
            res[skipped] = i;
        }
    }

    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -