oj.uz

Submission #587201

# Submission time Handle Problem Language Result Execution time Memory
587201 2022-07-01T13:28:41 Z stevancv Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 488 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
string s;
void Add(int l, int r) {
    if (l == r) return;
    int mid = l + r >> 1;
    for (int i = l; i <= r; i++) s[i] = '1';
    for (int i = l; i <= mid; i++) {
        s[i] = '0';
        add_element(s);
        s[i] = '1';
    }
    for (int i = l; i <= r; i++) s[i] = '0';
    Add(l, mid);
    Add(mid + 1, r);
}
vector<int> ans;
void Solve(int l, int r, vector<int> v) {
    if (l == r) {ans[v[0]] = l; return;}
    vector<int> x, y;
    int mid = l + r >> 1;
    for (int i : v) s[i] = '1';
    for (int i : v) {
        s[i] = '0';
        if (check_element(s)) x.push_back(i);
        else y.push_back(i);
        s[i] = '1';
    }
    for (int i : v) s[i] = '0';
    Solve(l, mid, x);
    Solve(mid + 1, r, y);
}
vector<int> restore_permutation(int n, int w, int r) {
    for (int i = 0; i < n; i++) s += "0";
    Add(0, n - 1);
    compile_set();
    vector<int> v(n);
    iota(v.begin(), v.end(), 0);
    ans.resize(n);
    Solve(0, n - 1, v);
    return ans;
}

Compilation message

messy.cpp: In function 'void Add(int, int)':
messy.cpp:13:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |     int mid = l + r >> 1;
      |               ~~^~~
messy.cpp: In function 'void Solve(int, int, std::vector<int>)':
messy.cpp:28:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |     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 212 KB n = 8
7 Correct 1 ms 300 KB n = 8
8 Correct 1 ms 296 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 296 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 296 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 300 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 296 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 296 KB n = 32
12 Correct 1 ms 212 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 300 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 304 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 212 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 424 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 432 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 2 ms 428 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 3 ms 472 KB n = 128
12 Correct 2 ms 428 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 472 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 424 KB n = 128
2 Correct 1 ms 472 KB n = 128
3 Correct 1 ms 480 KB n = 128
4 Correct 1 ms 480 KB n = 128
5 Correct 2 ms 444 KB n = 128
6 Correct 1 ms 480 KB n = 128
7 Correct 1 ms 472 KB n = 128
8 Correct 2 ms 480 KB n = 128
9 Correct 2 ms 472 KB n = 128
10 Correct 2 ms 476 KB n = 128
11 Correct 1 ms 436 KB n = 128
12 Correct 1 ms 488 KB n = 128
13 Correct 1 ms 428 KB n = 128
14 Correct 2 ms 436 KB n = 128
15 Correct 1 ms 476 KB n = 128