oj.uz

Submission #594967

# Submission time Handle Problem Language Result Execution time Memory
594967 2022-07-13T08:00:51 Z Valaki2 Unscrambling a Messy Bug (IOI16_messy) C++14
49 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

#define n N

#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

int n;
vector<int> p;

void solve() {
    string add(n, '0');
    for(int i = 0; i < n; i++) {
        add[i] = '1';
        add_element(add);
    }
    compile_set();
    string check(n, '0');
    for(int k = 0; k < n; k++) {
        vector<int> ind;
        for(int i = 0; i < n; i++) {
            if(p[i] == -1) {
                ind.pb(i);
            }
        }
        random_shuffle(ind.begin(), ind.end());
        for(int i : ind) {
            check[i] = '1';
            if(i == ind.back() || check_element(check)) {
                p[i] = k;
                break;
            }
            check[i] = '0';
        }
        /*for(int i = 0; i < n; i++) {
            if(p[i] != -1) {
                continue;
            }
            check[i] = '1';
            if(check_element(check)) {
                p[i] = k;
                break;
            }
            check[i] = '0';
        }*/
    }
}

#undef n
vector<int> restore_permutation(int n, int w, int r) {
    srand(1234);
    N = n;
    p.assign(N, -1);
    solve();
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory 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 1 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 1 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

# Verdict Execution time Memory 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 0 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 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 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 232 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 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 0 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 #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -