oj.uz

Submission #648490

# Submission time Handle Problem Language Result Execution time Memory
648490 2022-10-06T17:12:09 Z PoonYaPat Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 596 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

int ni,a[130];

void build(int l, int r) {
    if (l==r) return;
    string st,ed;
    for (int i=0; i<l; ++i) st+="1";
    for (int i=r+1; i<ni; ++i) ed+="1";

    int mid=(l+r)/2;
    for (int i=l; i<=mid; ++i) {
        string h;
        for (int j=l; j<=r; ++j) {
            if (j==i) h+="1";
            else h+="0";
        }
        add_element(st+h+ed);
    }
    build(l,mid);
    build(mid+1,r);
}

void check(int l, int r, vector<int> v) { //in range l to r, what can it change to
    if (l==r) {
        a[v[0]]=l;
        return;
    }
    vector<int> left,right;
    string test;
    for (int i=0; i<ni; ++i) test+="1";
    for (auto s : v) test[s]='0';
    for (int i=0; i<ni; ++i) {
        if (test[i]=='0') {
            test[i]='1';
            if (check_element(test)) left.push_back(i);
            else right.push_back(i);
            test[i]='0';
        }
    }
    int mid=(l+r)/2;
    check(l,mid,left);
    check(mid+1,r,right);
}

vector<int> restore_permutation(int N, int w, int r) {
    ni=N;
    build(0,ni-1);
    compile_set();
    vector<int> v;
    for (int i=0; i<ni; ++i) v.push_back(i);
    check(0,ni-1,v);
    vector<int> ans;
    for (int i=0; i<ni; ++i) ans.push_back(a[i]);
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 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 304 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 300 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 300 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 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 340 KB n = 32
3 Correct 1 ms 300 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 304 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 292 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 #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 304 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 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 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 2 ms 432 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 3 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 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 428 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 424 KB n = 128
13 Correct 2 ms 428 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 432 KB n = 128

Subtask #5
30.0 / 30.0

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