oj.uz

Submission #428436

# Submission time Handle Problem Language Result Execution time Memory
428436 2021-06-15T11:48:04 Z Mazaalai Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector <int> ans;
string defaultStr;
void add(vector <int> ids) {
    string tmp = defaultStr;
    for (auto a : ids) tmp[a] = '1';
    add_element(tmp);
}
int val;
bool check(vector <int> ids) {
    string tmp = defaultStr;
    for (auto a : ids) tmp[a] = '1';
    val = check_element(tmp);
    // cout << "ask " << tmp << ": " << val << '\n';
    return val;
}
void init(int st, int end, vector<int>&use) {
    if (st == end) return;
    int mid = (st+end)/2;
    for (int i = mid+1; i <= end; i++) {
        vector <int> tmp = use;
        tmp.push_back(i);
        add(tmp);
    }
    //lowHalf
    for (int i = st; i <= mid; i++) {
        use.push_back(i);
    }
    init(mid+1, end, use);
    for (int i = st; i <= mid; i++) {
        use.pop_back();
    }
    //upperHalf
    for (int i = mid+1; i <= end; i++) {
        use.push_back(i);
    }
    init(st, mid, use);
    for (int i = mid+1; i <= end; i++) {
        use.pop_back();
    }
}
void solve(int st, int end, vector <int>&use) {
    // cout << st << ' ' << end << ": ";
    // for (auto el : use) cout << el << ' ';
    // cout << '\n';
    vector <bool> seen(n, 0);
    for (auto el : use) seen[el] = 1;
    if (st == end) {
        val = 0;
        for (int i = 0; i < n; i++) {
            if (!seen[i]) val = i;
        }
        // cout << "ANS: " << val << ": " << st << '\n';
        ans[val] = st;
        return;
    }
    int mid = (st+end)/2;
    vector <int> lower, upper;
    for (int i = 0; i < n; i++) {
        if (seen[i]) continue;
        vector <int> tmp = use;
        tmp.push_back(i);
        bool cur = check(tmp);
        if (cur) upper.push_back(i);
        else lower.push_back(i);
    }
    // cout << "lower: ";
    // for (auto el : lower) cout << el << ' ';
    // cout << '\n';
    // cout << "upper: ";
    // for (auto el : upper) cout << el << ' ';
    // cout << '\n';
    //lowHalf
    for (int i = 0; i < lower.size(); i++) {
        use.push_back(lower[i]);
    }
    solve(mid+1, end, use);
    for (int i = 0; i < lower.size(); i++) {
        use.pop_back();
    }
    //upperHalf
    for (int i = 0; i < upper.size(); i++) {
        use.push_back(upper[i]);
    }
    solve(st, mid, use);
    for (int i = 0; i < upper.size(); i++) {
        use.pop_back();
    }
}
vector<int> restore_permutation(int n1, int w, int r) {
    n = n1;
    for (int i = 0; i < n; i++) ans.push_back(-i);
    for (int i = 0; i < n; i++) defaultStr.push_back('0');
    vector <int> use;
    init(0, n-1, use);
    compile_set();
    // cout << "DONE\n";
    // set <int> posVals;
    // for (int i = 0; i < n; i++) posVals.insert(i);
    solve(0, n-1, use);
    // vector <int> test1 = {2, 1, 3, 0};
    // check_element("0");
    return ans;
}

Compilation message

messy.cpp: In function 'void solve(int, int, std::vector<int>&)':
messy.cpp:78:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i = 0; i < lower.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
messy.cpp:82:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for (int i = 0; i < lower.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
messy.cpp:86:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for (int i = 0; i < upper.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
messy.cpp:90:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int i = 0; i < upper.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

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 292 KB n = 8
4 Correct 1 ms 292 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 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 292 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 296 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 296 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 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 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 240 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 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 #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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