oj.uz

Submission #500881

# Submission time Handle Problem Language Result Execution time Memory
500881 2022-01-01T14:35:06 Z aryan12 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 460 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> ans(129);

void Input(int l, int r, int n) {
    if(l == r) {
        return;
    }
    string s = "";
    for(int i = 0; i < n; i++) {
        s += "1";
    }
    for(int i = l; i <= r; i++) {
        s[i] = '0';
    }
    int mid = (l + r) / 2;
    for(int i = l; i <= mid; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    Input(l, mid, n);
    Input(mid + 1, r, n);
}

void Output(int l, int r, int n, vector<int> possible) {
    if(l == r) {
        ans[possible[0]] = l;
        return;
    }
    string s = "";
    for(int i = 0; i < n; i++) {
        s += "1";
    }
    for(int i = 0; i < possible.size(); i++) {
        s[possible[i]] = '0';
    }
    int mid = (l + r) / 2;
    vector<int> left, right;
    for(int i = 0; i < possible.size(); i++) {
        s[possible[i]] = '1';
        if(check_element(s)) {
            left.push_back(possible[i]);
        }
        else {
            right.push_back(possible[i]);
        }
        s[possible[i]] = '0';
    }
    /*cout << "L = " << l << ", R = " << r << "\n";
    cout << "left:\n";
    for(int i = 0; i < left.size(); i++) {
        cout << left[i] << " ";
    }
    cout << "\nright:\n";
    for(int i = 0; i < right.size(); i++) {
        cout << right[i] << " ";
    }
    cout << "\n";*/
    Output(l, mid, n, left);
    Output(mid + 1, r, n, right);
}

vector<int> restore_permutation(int n, int w, int r) {
    Input(0, n - 1, n);
    ans.resize(n);
    compile_set();
    vector<int> possible;
    for(int i = 0; i < n; i++) {
        possible.push_back(i);
    }
    Output(0, n - 1, n, possible);
    return ans;
}

Compilation message

messy.cpp: In function 'void Output(int, int, int, std::vector<int>)':
messy.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 0; i < possible.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~
messy.cpp:42:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i = 0; i < possible.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 0 ms 284 KB n = 8
4 Correct 0 ms 204 KB n = 8
5 Correct 0 ms 204 KB n = 8
6 Correct 0 ms 204 KB n = 8
7 Correct 0 ms 204 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 0 ms 204 KB n = 8
10 Correct 0 ms 204 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 1 ms 292 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 204 KB n = 32
3 Correct 1 ms 292 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 0 ms 204 KB n = 32
6 Correct 0 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 0 ms 204 KB n = 32
9 Correct 1 ms 292 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 0 ms 284 KB n = 32
14 Correct 1 ms 292 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 296 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 0 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 0 ms 204 KB n = 32
9 Correct 1 ms 296 KB n = 32
10 Correct 0 ms 292 KB n = 32
11 Correct 0 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 0 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 0 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 1 ms 460 KB n = 128
3 Correct 2 ms 420 KB n = 128
4 Correct 2 ms 416 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 424 KB n = 128
12 Correct 1 ms 460 KB n = 128
13 Correct 2 ms 420 KB n = 128
14 Correct 1 ms 420 KB n = 128
15 Correct 2 ms 424 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 1 ms 460 KB n = 128
3 Correct 1 ms 460 KB n = 128
4 Correct 2 ms 420 KB n = 128
5 Correct 1 ms 396 KB n = 128
6 Correct 2 ms 420 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 1 ms 420 KB n = 128
14 Correct 2 ms 416 KB n = 128
15 Correct 1 ms 460 KB n = 128