oj.uz

Submission #722613

# Submission time Handle Problem Language Result Execution time Memory
722613 2023-04-12T12:41:19 Z baojiaopisu Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 508 KB 
#include "messy.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y> 
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

vector<int> restore_permutation(int n, int w, int r) {
    int LOG = 0, t = n;
    while(t > 1) {
        t /= 2;
        LOG++;
    }
    for(int j = 0; j < LOG; j++) {
        for(int i = 0; i < n; i++) {
            if(i >> j & 1) {
                string ans = "";
                for(int i = 0; i < n; i++) ans += '0';
                ans[i] = '1';
                for(int k = 0; k < j; k++) {
                    for(int x = 0; x < n; x++) if((x >> k & 1) != (i >> k & 1)) ans[x] = '1';
                }
                add_element(ans);
            }
        }
    }   

    vector<int> res(n, 0);
    compile_set();
    for(int j = 0; j < LOG; j++) {
        for(int i = 0; i < n; i++) {
            string ans = "";
            for(int i = 0; i < n; i++) ans += '0';
            ans[i] = '1';
            for(int k = 0; k < j; k++) {
                for(int x = 0; x < n; x++) if((res[x] >> k & 1) != (res[i] >> k & 1)) ans[x] = '1';
            }
            if(check_element(ans)) res[i] ^= (1 << j);
        }
    }

    return res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 304 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 308 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 0 ms 308 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 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 304 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 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
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 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 300 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 300 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 304 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 3 ms 432 KB n = 128
2 Correct 3 ms 468 KB n = 128
3 Correct 4 ms 468 KB n = 128
4 Correct 4 ms 468 KB n = 128
5 Correct 4 ms 436 KB n = 128
6 Correct 4 ms 468 KB n = 128
7 Correct 3 ms 468 KB n = 128
8 Correct 3 ms 468 KB n = 128
9 Correct 4 ms 428 KB n = 128
10 Correct 4 ms 432 KB n = 128
11 Correct 4 ms 432 KB n = 128
12 Correct 4 ms 468 KB n = 128
13 Correct 4 ms 468 KB n = 128
14 Correct 4 ms 508 KB n = 128
15 Correct 4 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 4 ms 468 KB n = 128
3 Correct 3 ms 468 KB n = 128
4 Correct 4 ms 432 KB n = 128
5 Correct 4 ms 428 KB n = 128
6 Correct 4 ms 468 KB n = 128
7 Correct 3 ms 468 KB n = 128
8 Correct 4 ms 428 KB n = 128
9 Correct 4 ms 468 KB n = 128
10 Correct 5 ms 472 KB n = 128
11 Correct 3 ms 468 KB n = 128
12 Correct 3 ms 468 KB n = 128
13 Correct 4 ms 468 KB n = 128
14 Correct 4 ms 468 KB n = 128
15 Correct 3 ms 468 KB n = 128