oj.uz

Submission #373343

# Submission time Handle Problem Language Result Execution time Memory
373343 2021-03-04T08:01:49 Z flappybird Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 620 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
typedef int ll;

ll N;
ll arr[128];

void add(ll l, ll r) {
    if (l == r) return;
    ll i;
    string s;
    s.resize(N);
    for (i = 0; i < N; i++) s[i] = '0';
    for (i = 0; i < l; i++) s.replace(s.begin() + i, s.begin() + i + 1, "1");
    for (i = r + 1; i < N; i++) s.replace(s.begin() + i, s.begin() + i + 1, "1");
    ll mid = (l + r) >> 1;
    for (i = mid + 1; i <= r; i++) {
        s.replace(s.begin() + i, s.begin() + i + 1, "1");
        add_element(s);
        s.replace(s.begin() + i, s.begin() + i + 1, "0");
    }
    add(l, mid);
    add(mid + 1, r);
}

void check(ll x, ll k) {
    if (!k) return;
    ll i;
    string s;
    s.resize(N);
    for (i = 0; i < N; i++) {
        if (arr[i] == x) s[i] = '0';
        else s[i] = '1';
    }
    for (i = 0; i < N; i++) {
        if (s[i] == '0') {
            s[i] = '1';
            if (check_element(s)) arr[i] += k;
            s[i] = '0';
        }
    }
    check(x, k / 2);
    check(x + k, k / 2);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    add(0, N - 1);
    compile_set();
    check(0, N / 2);
    vector<ll> res;
    ll i;
    res.resize(N);
    for (i = 0; i < N; i++) {
        res[i] = arr[i];
    }
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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