oj.uz

Submission #957021

# Submission time Handle Problem Language Result Execution time Memory
957021 2024-04-02T19:54:12 Z mariaclara Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 852 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

typedef long long ll;
typedef tuple<int,int,int> trio;
typedef pair<ll,int> pii;
const int MAXN = 3e5+5;
const int MOD = 1e9+7;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define f first
#define s second

int N, ans[200];

void restore(int l, int r, vector<int> range) {
    if(l == r) {
        ans[l] = range[0];
        return;
    }

    string a;
    vector<bool> in_range(N+1);

    for(int i : range) in_range[i] = 1;

    for(int i = 1; i <= N; i++) a += (char)('0' + !in_range[i]);

    vector<int> range_l, range_r;
    for(int i : range) {
        a[i-1] = '1';
        if(check_element(a)) range_l.pb(i);
        else range_r.pb(i);
        a[i-1] = '0';
    }

    int mid = (l+r)/2;
    restore(l, mid, range_l);
    restore(mid+1, r, range_r);
}

vector<int> restore_permutation(int n, int w, int r) {
    int add = 0;

    for(int S = n; S >= 2; S/=2) {
        for(int i = 1; i <= n; i += S) {
            // range (i, i+S-1)
            string a;

            for(int j = 1; j < i; j++) a += '1';
            for(int j = i; j < i+S; j++) a += '0';
            for(int j = i+S; j <= n; j++) a += '1';

            for(int j = i; j < i + S/2; j++) {
                a[j-1] = '1';
                add_element(a);
                add++;
                a[j-1] = '0';
            }
        }
    }

    compile_set();

    N = n;
    vector<int> aux;
    for(int i = 1; i <= n; i++) aux.pb(i);

    restore(1, n, aux);

    vector<int> answer(n);
    for(int i = 1; i <= n; i++)
        answer[ans[i]-1] = i-1;

    return answer;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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