oj.uz

Submission #591956

# Submission time Handle Problem Language Result Execution time Memory
591956 2022-07-08T09:29:34 Z wdjpng Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 596 KB 
#include <bits/stdc++.h>

#define int long long
#define rep(i,n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()

#include "messy.h"

using namespace std;
vector<signed>p;
int n;
vector<string>added;
void adds(int l, int r)
{
    if(l+1==r) return;
    int m = (l+r)/2;
    string s(n,'0');
    rep(i,n) if(i<l||i>=r) s[i]='1';
    for(int i = l; i < m; i++) 
    {
        s[i]='1';
        add_element(s);
        added.push_back(s);
        s[i]='0';
    }
    adds(l,m);
    adds(m,r);
}

void queries(int l, int r, vector<int>ing)
{
    if(l+1==r) {p[ing[0]]=l; return;}
    vector<bool>innew(n,false);
    string s(n,'0');
    rep(i,n) if(find(all(ing), i)==ing.end()) s[i]='1';
    vector<vector<int>>ning(2);
    for(int x : ing)
    {
        s[x]='1';
        ning[!check_element(s)].push_back(x);
        s[x]='0';
    }
    queries(l,(l+r)/2,ning[0]);
    queries((l+r)/2,r,ning[1]);
}
vector<signed> restore_permutation(signed N, signed w, signed r) {
    n=N;
    p.assign(n,-1);
    adds(0,n);
    compile_set();

    vector<int>ing(n);
    rep(i,n) ing[i]=i;
   
    queries(0,n,ing);
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 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 0 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 1 ms 340 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 0 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 284 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 0 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 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 0 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 340 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 296 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 1 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 560 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 3 ms 556 KB n = 128
6 Correct 2 ms 552 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 556 KB n = 128
11 Correct 2 ms 556 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 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 1 ms 556 KB n = 128
3 Correct 2 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 556 KB n = 128
9 Correct 2 ms 596 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 556 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128