oj.uz

Submission #709533

# Submission time Handle Problem Language Result Execution time Memory
709533 2023-03-13T21:34:27 Z ssense Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 480 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>

int ng, wg, rg;
vector<int> anss;

void get_range(int l, int r)
{
    if(l == r){
        return;
    }
    vector<string> ans;
    string now;
    for(int i = 0; i < ng; i++)
    {
        now.push_back('0');
    }
    for(int i = 0; i < ng; i++)
    {
        if(i < l || i > r)
        {
            now[i] = '1';
        }
    }
    for(int i = l; i <= (l+r)/2; i++)
    {
        now[i] = '1';
        add_element(now);
        now[i] = '0';
    }
    get_range(l, (l+r)/2);
    get_range((l+r)/2+1, r);
}

void get_ans(int l, int r, vector<int> idx)
{
    if(l == r)
    {
        anss[idx[0]] = l;
        return;
    }
    string now;
    for(int i = 0; i < ng; i++)
    {
        now.push_back('1');
    }
    for(auto x : idx)
    {
        now[x] = '0';
    }
    vector<int> left, right;
    for(auto x : idx)
    {
        now[x] = '1';
        if(check_element(now))
        {
            left.push_back(x);
        }
        else
        {
            right.push_back(x);
        }
        now[x] = '0';
    }
    get_ans(l, (l+r)/2, left);
    get_ans((l+r)/2+1, r, right);
}

vector<int> restore_permutation(int n, int w, int r)
{
    ng = n;
    wg = w;
    rg = r;
    get_range(0, n-1);
    anss.resize(n);
    compile_set();
    vector <int> idx;
    for (int i = 0; i < n; i++) {
        idx.push_back(i);
    }
    get_ans(0, n - 1,idx);
    return anss;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 1 ms 300 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 300 KB n = 8
10 Correct 1 ms 300 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 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 300 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 296 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 300 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 300 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 216 KB n = 32
2 Correct 1 ms 216 KB n = 32
3 Correct 1 ms 216 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 300 KB n = 32
6 Correct 1 ms 280 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 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 212 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 300 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 1 ms 436 KB n = 128
3 Correct 1 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 468 KB n = 128
7 Correct 2 ms 480 KB n = 128
8 Correct 2 ms 480 KB n = 128
9 Correct 2 ms 480 KB n = 128
10 Correct 2 ms 440 KB n = 128
11 Correct 2 ms 436 KB n = 128
12 Correct 1 ms 480 KB n = 128
13 Correct 2 ms 440 KB n = 128
14 Correct 2 ms 480 KB n = 128
15 Correct 2 ms 476 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 476 KB n = 128
2 Correct 2 ms 480 KB n = 128
3 Correct 2 ms 480 KB n = 128
4 Correct 2 ms 480 KB n = 128
5 Correct 2 ms 476 KB n = 128
6 Correct 2 ms 476 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 468 KB n = 128
11 Correct 2 ms 476 KB n = 128
12 Correct 2 ms 476 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128