oj.uz

Submission #696344

# Submission time Handle Problem Language Result Execution time Memory
696344 2023-02-06T09:17:20 Z sharaelong Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 500 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 128;

int n;
int ans[MAX_N];

void solve(int l, int r, vector<int> lcand, vector<int> rcand) {
    if (l+1 == r) {
        ans[l] = lcand[0];
        ans[r] = rcand[0];
        return;
    }
    
    int m = (l+r)/2;
    vector<int> nxt_lcand, nxt_rcand;
    string query;
    for (int i=0; i<n; ++i) query.push_back('0');
    for (int idx: rcand) query[idx] = '1';
    for (int idx: lcand) {
        query[idx] = '1';
        // cout << query << endl;
        bool ret = check_element(query);
        (ret ? nxt_lcand : nxt_rcand).push_back(idx);
        query[idx] = '0';
    }
    solve(l, m, nxt_lcand, nxt_rcand);

    query.clear();
    nxt_lcand.clear();
    nxt_rcand.clear();
    for (int i=0; i<n; ++i) query.push_back('0');
    for (int idx: lcand) query[idx] = '1';
    for (int idx: rcand) {
        query[idx] = '1';
        // cout << query << endl;
        bool ret = check_element(query);
        (ret ? nxt_lcand : nxt_rcand).push_back(idx);
        query[idx] = '0';
    }
    solve(m+1, r, nxt_lcand, nxt_rcand);
}

void compile(int l, int r) {
    if (l+1 == r) return;
    
    int m = (l+r)/2;
    compile(l, m);
    compile(m+1, r);
    
    string query;
    for (int i=0; i<n; ++i) query.push_back('0');
    for (int i=m+1; i<=r; ++i) query[i] = '1';
    for (int i=l; i<=(l+m)/2; ++i) {
        query[i] = '1';
        // cout << query << endl;
        add_element(query);
        query[i] = '0';
    }

    query.clear();
    for (int i=0; i<n; ++i) query.push_back('0');
    for (int i=l; i<=m; ++i) query[i] = '1';
    for (int i=m+1; i<=(m+1+r)/2; ++i) {
        query[i] = '1';
        // cout << query << endl;
        add_element(query);
        query[i] = '0';
    }
}

vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    string query;
    for (int i=0; i<n; ++i) query.push_back('0');
    for (int i=0; i<n/2; ++i) {
        query[i] = '1';
        // cout << query << '\n';
        add_element(query);
        query[i] = '0';
    }
    compile(0, n-1);
    compile_set();

    // cout << "mid" << endl;

    vector<int> lcand, rcand;
    for (int i=0; i<n; ++i) {
        query[i] = '1';
        bool ret = check_element(query);
        (ret ? lcand : rcand).push_back(i);
        query[i] = '0';
    }
    solve(0, n-1, lcand, rcand);
    
    vector<int> ret(n);
    for (int i=0; i<n; ++i) ret[ans[i]] = i;
    return ret;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 296 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 300 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 0 ms 296 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 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 1 ms 300 KB n = 8
15 Correct 1 ms 300 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 296 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 292 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 256 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 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 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 1 ms 468 KB n = 128
2 Correct 1 ms 428 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 424 KB n = 128
5 Correct 2 ms 428 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 432 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 424 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

Subtask #5
30.0 / 30.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 500 KB n = 128
5 Correct 2 ms 428 KB n = 128
6 Correct 2 ms 492 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 2 ms 428 KB n = 128
13 Correct 1 ms 424 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 1 ms 432 KB n = 128