oj.uz

Submission #421084

# Submission time Handle Problem Language Result Execution time Memory
421084 2021-06-08T17:25:20 Z temurbek_khujaev Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 492 KB 
#include <random>
#include <vector>

#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

int n;

string get_string(int ones = 0) {
    return string(ones, '1') + string(n - ones, '0');
}

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

    for (int i = l; i <= (l + r) / 2; i++) {
        s[i] = '1';
        add_element(s);
//        cerr << s << endl;
        s[i] = '0';
    }
    build(l, (l + r) / 2);
    build((l + r) / 2 + 1, r);
}

vector<int> get(int l, int r, vector<int> p) {
    if (l == r) return p;
    string s(n, '1');
    for (int i:p) s[i] = '0';
    vector<int> left;
    vector<int> right;
    for (int i:p) {
        s[i] = '1';
//        cerr << "\t" << s << ' ';
        if (check_element(s)) {
//            cerr << "true" << endl;
            left.push_back(i);
        } else {
//            cerr << "false" << endl;
            right.push_back(i);
        }
        s[i] = '0';
    }
//    for (auto x: left) cout << x << ' ';
//    cout << "  ";
//    for (auto y:right) cout << y << ' ';
//    cout << endl;
    vector<int> res, tmp;
    res = get(l, (l + r) / 2, left);
    tmp = get((l + r) / 2 + 1, r, right);
    for (auto x:tmp) res.push_back(x); // birlashtirish
    return res;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    ::n = n;
    vector<int> p(n, -1);
    for (int i = 0; i < n; i++) p[i] = i;
    build(0, n - 1);
    compile_set();

    p = get(0, n - 1, p);
    vector<int> ans = p;
    for (int i = 0; i < n; i++) ans[p[i]] = i;
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 1 ms 288 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 288 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 288 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 292 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 296 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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