oj.uz

Submission #293284

# Submission time Handle Problem Language Result Execution time Memory
293284 2020-09-07T20:24:20 Z MoNsTeR_CuBe Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 512 KB 
#include <vector>
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

vector< int > ans;

int n;

void build(int left, int right){
	if(left == right) return;
	int mid = (left+right)/2;
	
	string v(n,'1');
	for(int i = left; i <= right; i++){
		v[i] = '0';
	}
	for(int i = left; i <= mid; i++){
		v[i] = '1';
		add_element(v);
		v[i] = '0';
	}
	build(left, mid);
	build(mid+1, right);
}

void answer(int left, int right, vector< int > available){
	if(left == right){
		if(available.size() != 0) ans[available[0]] = left;
		return;
	}
	string v(n,'1');
	int mid = (left+right)/2;
	for(int a : available) v[a] = '0';
	vector< int > L;
	vector< int > R;
	for(int a : available){
		v[a] = '1';
		if(check_element(v)){
			L.push_back(a);
		}else{
			R.push_back(a);
		}
		v[a] = '0';
	}
	answer(left, mid, L);
	answer(mid+1, right, R);
}

std::vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    build(0,n-1);
    compile_set();
    ans.resize(n);
    vector< int > v(n);
    for(int i = 0; i < n; i++){
		v[i]=i;
	}
    answer(0,n-1,v);
    //for(int a : ans) cout << a << ' ';
    //cout << endl;
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 8
2 Correct 1 ms 256 KB n = 8
3 Correct 0 ms 256 KB n = 8
4 Correct 1 ms 256 KB n = 8
5 Correct 0 ms 256 KB n = 8
6 Correct 1 ms 256 KB n = 8
7 Correct 0 ms 256 KB n = 8
8 Correct 0 ms 256 KB n = 8
9 Correct 1 ms 256 KB n = 8
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 256 KB n = 8
12 Correct 1 ms 256 KB n = 8
13 Correct 0 ms 256 KB n = 8
14 Correct 1 ms 384 KB n = 8
15 Correct 0 ms 256 KB n = 8

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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