oj.uz

Submission #641978

# Submission time Handle Problem Language Result Execution time Memory
641978 2022-09-18T06:01:55 Z QwertyPi Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <vector>

#include "messy.h"

#include <bits/stdc++.h>

using namespace std;

int n;
string s;
int p[128];

vector<int> a[128], a_sw[128];
std::vector<int> restore_permutation(int n, int w, int r) {
    ::n = n;
    s.resize(n);
    for(int sz = n / 2; sz; sz /= 2){
        for(int i = 0; i < n; i += sz * 2){
            int l = i + sz, r = i + sz * 2;
            for(int j = l; j < r; j++){
                fill(begin(s), begin(s) + n, '0');
                fill(begin(s) + i, begin(s) + i + sz * 2, '1');
                s[j] = '0';
                add_element(s);
            }
        }
    }
    
    compile_set();
    
    for(int i = 0; i < n; i++) a[0].push_back(i);
    for(int sz = n / 2; sz; sz /= 2){
        for(int i = 0; i < n / sz / 2; i++){
            for(auto j : a[i]){
                fill(begin(s), begin(s) + n, '0');
                for(auto k : a[i]){
                    s[k] = '1';
                }
                s[j] = '0';
                bool c = check_element(s);
                if(c) a_sw[i * 2 + 1].push_back(j);
                else  a_sw[i * 2 + 0].push_back(j);
            }
        }
        for(int i = 0; i < n; i++){
            swap(a[i], a_sw[i]);
        }
        for(int i = 0; i < n; i++){
        	a_sw[i].clear();
		}
    }
    
    vector<int> result(n);
    for(int i = 0; i < n; i++) result[a[i][0]] = i;
	return result;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 1 ms 308 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 312 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 312 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 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 308 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 308 KB n = 32
6 Correct 1 ms 304 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 308 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 1 ms 308 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 308 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 0 ms 212 KB n = 32
4 Correct 1 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 304 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 304 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 304 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 1 ms 432 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 1 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 1 ms 436 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 2 ms 452 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 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 436 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 1 ms 468 KB n = 128
9 Correct 2 ms 436 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 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128