oj.uz

Submission #601072

# Submission time Handle Problem Language Result Execution time Memory
601072 2022-07-21T10:54:15 Z MohamedFaresNebili Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 10 ms 352 KB 
#include <bits/stdc++.h>
#include "messy.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
            using namespace std;
 
            using ll = long long;
            using ii = pair<ll, ll>;
            using vi = vector<int>;
 
            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
 
            const int oo = 1000 * 1000 * 1000 + 7;
 
            vector<int> restore_permutation(int N, int W, int R) {
                string S(N, '0');
                for(int l = 0; l < N; l++) {
                    S[l] = '1';
                    add_element(S);
                }
                compile_set(); S = string(N, '0');
                vector<int> res(N, -1);
                for(int l = 0; l < N; l++) {
                    vector<int> P;
                    for(int i = 0; i < N; i++) {
                        if(res[i] != -1) continue;
                        P.push_back(i);
                    }
                    for(int i = 0; i < N; i++)
                      random_shuffle(P.begin(), P.end());
                    for(auto u : P) {
                        S[u] = '1';
                        if(u == P.back() || check_element(S) == 1) {
                            res[u] = l; break;
                        }
                        S[u] = '0';
                    }
                }
                return res;
            }

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 0 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 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 1 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 212 KB n = 32
7 Correct 1 ms 308 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 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 #3
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 212 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 Incorrect 1 ms 212 KB grader returned WA
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 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 5 ms 352 KB grader returned WA
2 Halted 0 ms 0 KB -