oj.uz

Submission #792855

# Submission time Handle Problem Language Result Execution time Memory
792855 2023-07-25T09:57:38 Z alvingogo Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 480 KB 
#include "messy.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

vector<int> ans;
void encode(int l,int r,string g){
    if(l==r){
        return;
    }
    int m=(l+r)/2;
    for(int i=l;i<=m;i++){
        auto s=g;
        s[i]='1';
        add_element(s);
    }
    string a=g,b=g;
    for(int i=m+1;i<=r;i++){
        a[i]='1';
    }
    for(int i=l;i<=m;i++){
        b[i]='1';
    }
    encode(l,m,a);
    encode(m+1,r,b);
}
void decode(int l,int r,string g,vector<int> v){
    if(l==r){
        ans[v[0]]=l;
        return;
    }
    int m=(l+r)/2;
    vector<int> c,d;
    string a=g,b=g;
    for(auto h:v){
        auto s=g;
        s[h]='1';
        if(check_element(s)){
            c.push_back(h);
            b[h]='1';
        }
        else{
            d.push_back(h);
            a[h]='1';
        }
    }
    decode(l,m,a,c);
    decode(m+1,r,b,d);
}
vector<int> restore_permutation(int n, int w, int r) {
    encode(0,n-1,string(n,'0'));
    compile_set();
    ans.resize(n);
    vector<int> v(n);
    iota(v.begin(),v.end(),0);
    decode(0,n-1,string(n,'0'),v);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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

Subtask #5
30.0 / 30.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 1 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 432 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 428 KB n = 128
8 Correct 1 ms 472 KB n = 128
9 Correct 1 ms 480 KB n = 128
10 Correct 1 ms 424 KB n = 128
11 Correct 1 ms 476 KB n = 128
12 Correct 1 ms 436 KB n = 128
13 Correct 1 ms 480 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128