oj.uz

Submission #586199

# Submission time Handle Problem Language Result Execution time Memory
586199 2022-06-30T04:32:54 Z messiuuuuu Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 7 ms 9896 KB 
#include<bits/stdc++.h>
#include <messy.h>
#define task "A"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e5 + 5;
const ll INF = 1e18 + 5;

int a[MAXN];
int n;

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

vector<int> phan[4 * MAXN], res;

void DNCAns(int id, int l, int r)
{
    if (l == r)
    {
        res[phan[id].back()] = l;
        return;
    }
    string s(n, '1');
    for (int i : phan[id])
    {
        s[i] = '0';
    }
    for (int i : phan[id])
    {
        s[i] = '1';
        if (check_element(s))
        {
            phan[2 * id].pb(i);
        } else
        {
            phan[2 * id + 1].pb(i);
        }
        s[i] = '0';
    }
    int mid = (l + r) / 2;
    DNCAns(2 * id, l, mid);
    DNCAns(2 * id + 1, mid + 1, r);
}

vector<int> restore_permutation(int N, int w, int r)
{
    res.resize(N);
    n = N;
    DNC(0, n - 1);
    compile_set();
    for (int i = 0; i < n; i++)
        phan[1].pb(i);
    DNCAns(1, 0, n - 1);
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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