oj.uz

Submission #390284

# Submission time Handle Problem Language Result Execution time Memory
390284 2021-04-15T18:51:54 Z faresbasbs Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 464 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int n,freq[128];
vector<int> v;

void hs(int l , int r){
    if(l == r){
        return ;
    }
    string s(n,'0');
    for(int i = l ; i <= r ; i += 1){
        s[i] = '1';
    }
    int mid = (l+r)/2;
    for(int i = mid+1 ; i <= r ; i += 1){
        s[i] = '0';
        add_element(s);
        s[i] = '1';
    }
    hs(l,mid),hs(mid+1,r);
}

void hs2(int l , int r){
    if(l == r){
        freq[v[0]] = l;
        return ;
    }
    string s(n,'0');
    for(int i : v){
        s[i] = '1';
    }
    int mid = (l+r)/2;
    vector<int> ll , rr;
    for(int i : v){
        s[i] = '0';
        if(check_element(s)){
            rr.push_back(i);
        }else{
            ll.push_back(i);
        }
        s[i] = '1';
    }
    v = ll , hs2(l,mid) , v = rr , hs2(mid+1,r);
}

vector<int> restore_permutation(int N , int w , int r){
    n = N;
    hs(0,n-1);
    compile_set();
    for(int i = 0 ; i < n ; i += 1){
        v.push_back(i);
    }
    hs2(0,n-1);
    vector<int> ret;
    for(int i = 0 ; i < n ; i += 1){
        ret.push_back(freq[i]);
    }
    return ret;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 332 KB n = 8
3 Correct 1 ms 204 KB n = 8
4 Correct 1 ms 292 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 1 ms 296 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 296 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB n = 32
2 Correct 1 ms 208 KB n = 32
3 Correct 1 ms 284 KB n = 32
4 Correct 1 ms 276 KB n = 32
5 Correct 1 ms 284 KB n = 32
6 Correct 1 ms 292 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 208 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 296 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 296 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 292 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 2 ms 408 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 2 ms 460 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 2 ms 464 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 2 ms 460 KB n = 128
13 Correct 2 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 2 ms 420 KB n = 128
4 Correct 2 ms 460 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 2 ms 460 KB n = 128
8 Correct 2 ms 428 KB n = 128
9 Correct 2 ms 460 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 2 ms 460 KB n = 128
13 Correct 3 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128