oj.uz

Submission #485247

# Submission time Handle Problem Language Result Execution time Memory
485247 2021-11-06T16:15:51 Z couplefire Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 552 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

vector<int> restore_permutation(int n, int w, int r){
    for(int siz = n; siz>=2; siz>>=1){
        for(int l = 0, r = siz; r<=n; l = r, r += siz){
            string s(n, '1');
            for(int i = l; i<r; ++i)
                s[i] = '0';
            for(int i = l; i<(l+r)>>1; ++i){
                s[i] = '1';
                add_element(s);
                s[i] = '0';
            }
        }
    } compile_set();
    vector<int> p(n), ans(n);
    iota(p.begin(), p.end(), 0);
    for(int siz = n; siz>=2; siz>>=1){
        for(int l = 0, r = siz; r<=n; l = r, r += siz){
            string s(n, '1');
            for(int i = l; i<r; ++i)
                s[p[i]] = '0';
            vector<int> lside, rside;
            for(int i = l; i<r; ++i){
                s[p[i]] = '1';
                if(check_element(s)) lside.push_back(p[i]);
                else rside.push_back(p[i]);
                s[p[i]] = '0';
            }
            vector<int> tmp = lside;
            tmp.insert(tmp.end(), rside.begin(), rside.end());
            for(int i = l; i<r; ++i)
                p[i] = tmp[i-l];
        }
    }
    for(int i = 0; i<n; ++i)
        ans[p[i]] = i;
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 0 ms 204 KB n = 8
3 Correct 1 ms 204 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 0 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 0 ms 204 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 204 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 204 KB n = 32
2 Correct 1 ms 288 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 292 KB n = 32
11 Correct 1 ms 204 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 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 292 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 292 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 288 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 0 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB n = 128
2 Correct 2 ms 420 KB n = 128
3 Correct 3 ms 460 KB n = 128
4 Correct 1 ms 460 KB n = 128
5 Correct 2 ms 420 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 3 ms 460 KB n = 128
8 Correct 1 ms 460 KB n = 128
9 Correct 3 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 1 ms 460 KB n = 128
14 Correct 3 ms 460 KB n = 128
15 Correct 2 ms 552 KB n = 128