oj.uz

Submission #599155

# Submission time Handle Problem Language Result Execution time Memory
599155 2022-07-19T10:58:34 Z Pyishtell Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 592 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#include "messy.h"

int n;
vector<int> v;

void dfs(vector<int> x, vector<int> y){
    if(x.size()==2){
        bool b = check_element(string(n-1,'1').insert(y[1],"0"));
        if(b) v[x[0]] = y[0], v[x[1]] = y[1];
        else v[x[0]] = y[1], v[x[1]] = y[0];
    }
    else{
        int gap = x.size();
        vector<int> x1, x2, y1, y2;
        for(int i=0; i<gap; i++){
            string s = string(n-gap,'1');
            for(int j=0; j<gap; j++){
                if(j==i) s.insert(y[j],"1");
                else s.insert(y[j],"0");
            }
            bool b = check_element(s);
            if(b) y1.push_back(y[i]);
            else y2.push_back(y[i]);
        }
        for(int i=0; i<gap; i++){
            if(i<gap/2) x1.push_back(x[i]);
            else x2.push_back(x[i]);
        }
        dfs(x1, y1);
        dfs(x2, y2);
    }
    return;
}

std::vector<int> restore_permutation(int nn, int w, int r) {
    
    n = nn;
    v.resize(n);
    for(int i=n; i>1; i/=2){
        for(int j=1; j<=n; j+=i){
            for(int k=0; k<i/2; k++){
                add_element(string(j-1,'1')+string(i-1,'0').insert(k,"1")+string(n-i-j+1,'1'));
            }
        }
    }
    compile_set();
    vector<int> x(n), y(n);
    for(int i=0; i<n; i++) x[i]=i, y[i]=i;
    dfs(x, y);
    vector<int> vv(n);
    for(int i=0; i<n; i++){
        vv[v[i]] = i;
    }
    return vv;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 300 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 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 296 KB n = 8
9 Correct 0 ms 300 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 296 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 296 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 300 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 #3
11.0 / 11.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 212 KB n = 32
6 Correct 1 ms 300 KB n = 32
7 Correct 1 ms 300 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 296 KB n = 32
12 Correct 1 ms 300 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 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 424 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 468 KB n = 128
10 Correct 2 ms 432 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 2 ms 420 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 2 ms 428 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 432 KB n = 128
7 Correct 2 ms 428 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 3 ms 428 KB n = 128
14 Correct 2 ms 592 KB n = 128
15 Correct 2 ms 468 KB n = 128