oj.uz

Submission #568105

# Submission time Handle Problem Language Result Execution time Memory
568105 2022-05-24T16:35:41 Z ngpin04 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 484 KB 
#include "messy.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

#define add add_element
#define done compile_set
#define ask check_element

string s;

int ans[N];
int f[N];
int ____n;

void build(int l, int r) {
    if (l == r)
        return;
    int mid = (l + r) >> 1;
    
    for (int i = l; i <= r; i++)
        s[i] = '0';

    for (int i = l; i <= mid; i++) {
        s[i] = '1';
        add(s);
        // cerr << "add " << s << "\n";
        s[i] = '0';
    }

    for (int i = mid + 1; i <= r; i++)
        s[i] = '1';
    build(l, mid);

    for (int i = l; i <= mid; i++)
        s[i] = '1';
    build(mid + 1, r);
}

void getans(int l, int r) {
    int mid = (l + r) >> 1;

    vector <int> setl, setr;

    for (int i = 0; i < ____n; i++) if (s[i] != '1') {
        s[i] = '1';
        if (ask(s))
            setl.push_back(i);
        else
            setr.push_back(i);
        // cerr << "ask " << i << " " << s << "\n";
        s[i] = '0';
    }

    // for (int x : setl) 
    //     cerr << x << " ";
    // cerr << "\n";

    if (setl.size() == 1 && setr.size() == 1) {
        ans[l] = *setl.begin();
        ans[r] = *setr.begin();
        return;
    }

    for (int i : setr)
        s[i] = '1';
    getans(l, mid);
    for (int i : setr)
        s[i] = '0';
    
    for (int i : setl)
        s[i] = '1';
    getans(mid + 1, r);
    for (int i : setl)
        s[i] = '0';

}

void solve() {
    s.resize(____n);
    build(0, ____n - 1);
    done();
    s.assign(____n, '0');
    getans(0, ____n - 1);
}

vector<int> restore_permutation(int _n, int w, int r) {
    ____n = _n;
    solve();
    vector <int> res;
    for (int i = 0; i < ____n; i++)
        f[ans[i]] = i;

    for (int i = 0; i < ____n; i++)
        res.push_back(f[i]);
    return res;
}

//#include "grader.cpp"

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 312 KB n = 8
3 Correct 0 ms 212 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 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 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 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 340 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 316 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 340 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 308 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 340 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 340 KB n = 32
11 Correct 1 ms 340 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 312 KB n = 32
15 Correct 1 ms 312 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 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 444 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 440 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 436 KB n = 128
13 Correct 2 ms 440 KB n = 128
14 Correct 3 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 2 ms 440 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 436 KB n = 128
6 Correct 3 ms 436 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 2 ms 484 KB n = 128
11 Correct 2 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