oj.uz

Submission #728889

# Submission time Handle Problem Language Result Execution time Memory
728889 2023-04-23T08:45:05 Z nguyentunglam Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include <vector>
#include<bits/stdc++.h>
using namespace std;

#include "messy.h"

vector<int> p;
int n;

void prepare(int l, int r) {
    if (l == r) return;
    int mid = l + r >> 1;

    string x; for(int i = 0; i < n; i++) x.push_back('1');

    for(int i = l; i <= r; i++) x[i] = '0';
    for(int i = l; i <= mid; i++) {
        x[i] = '1';
        add_element(x);
        x[i] = '0';
    }
    prepare(l, mid); prepare(mid + 1, r);
}

void solve(int l, int r, vector<int> lst) {
    if (l == r) {
        p[lst[0]] = l;
        return;
    }
    int mid = l + r >> 1;
    string x; for(int i = 0; i < n; i++) x.push_back('1');
    for(int &j : lst) x[j] = '0';
    vector<int> Left, Right;
    for(int &j : lst) {
        x[j] = '1';
        if (check_element(x)) Left.push_back(j);
        else Right.push_back(j);
        x[j] = '0';
    }
    solve(l, mid, Left); solve(mid + 1, r, Right);
}

std::vector<int> restore_permutation(int _n, int w, int r) {
    n = _n;
    p.resize(n);
    prepare(0, n - 1);
    compile_set();
    vector<int> init;
    for(int i = 0; i < n; i++) init.push_back(i);
    solve(0, n - 1, init);
    return p;
}

Compilation message

messy.cpp: In function 'void prepare(int, int)':
messy.cpp:12:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |     int mid = l + r >> 1;
      |               ~~^~~
messy.cpp: In function 'void solve(int, int, std::vector<int>)':
messy.cpp:30:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
20.0 / 20.0

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