oj.uz

Submission #696500

# Submission time Handle Problem Language Result Execution time Memory
696500 2023-02-06T15:48:45 Z whqkrtk04 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const int P = 1000000007;
const ll LLINF = (ll)1e18+1;
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << p.fi << " " << p.se; return os; }
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { for(auto i : v) os << i << " "; os << "\n"; return os; }


string b2s(vector<bool> &A) {
    string s;
    for(auto i : A) s += (i ? '1' : '0');
    return s;
}

void add(int n, int s, int e) {
    if(s+1 == e) return;
    vector<bool> A(n);
    for(int i = 0; i < n; i++) {
        if(i >= s && i < e) A[i] = false;
        else A[i] = true;
    }
    int mi = s+e>>1;
    for(int i = s; i < mi; i++) {
        A[i] = true;
        add_element(b2s(A));
        A[i] = false;
    }
    add(n, s, mi);
    add(n, mi, e);
}

vector<int> solve(int n, int s, int e, vector<bool> A) {
    if(s+1 == e) {
        vector<int> ret(n, -1);
        for(int i = 0; i < n; i++) if(!A[i]) ret[i] = s;
        return ret;
    }
    vector<bool> B(A), C(A);
    for(int i = 0; i < n; i++) {
        if(A[i]) continue;
        A[i] = true;
        bool x = check_element(b2s(A));
        A[i] = false;
        B[i] = x, C[i] = !x;
    }
    int mi = s+e>>1;
    vector<int> L = solve(n, s, mi, C);
    vector<int> R = solve(n, mi, e, B);
    vector<int> ret(n, -1);
    for(int i = 0; i < n; i++) {
        if(L[i] != -1) ret[i] = L[i];
        if(R[i] != -1) ret[i] = R[i];
    }
    return ret;
}

vector<int> restore_permutation(int n, int w, int r) {
    add(n, 0, n);
    compile_set();
    return solve(n, 0, n, vector<bool>(n, false));
}

Compilation message

messy.cpp: In function 'void add(int, int, int)':
messy.cpp:33:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     int mi = s+e>>1;
      |              ~^~
messy.cpp: In function 'std::vector<int> solve(int, int, int, std::vector<bool>)':
messy.cpp:57:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |     int mi = s+e>>1;
      |              ~^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 300 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 1 ms 296 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 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 296 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 304 KB n = 32
9 Correct 1 ms 300 KB n = 32
10 Correct 1 ms 300 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 300 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 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 300 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 300 KB n = 32
9 Correct 1 ms 296 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 300 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 2 ms 432 KB n = 128
3 Correct 3 ms 428 KB n = 128
4 Correct 3 ms 468 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 3 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 3 ms 468 KB n = 128
10 Correct 3 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 432 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 3 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 3 ms 468 KB n = 128
4 Correct 3 ms 468 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 3 ms 424 KB n = 128
8 Correct 3 ms 420 KB n = 128
9 Correct 3 ms 432 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 3 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128