oj.uz

Submission #308998

# Submission time Handle Problem Language Result Execution time Memory
308998 2020-10-02T14:39:04 Z tengiz05 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 544 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
int ng;
void build(int l, int r){
	if(l == r)return;
	string s(ng, '1');
	for(int i=l;i<=r;i++){
		s[i] = '0';
	}int mid = (l+r)>>1;
	for(int i=l;i<=mid;i++){
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	build(l, mid);
	build(mid+1, r);
}
void find_ans(int l, int r, vector<int> v, vector<int> &ans){
	if(l == r){
		ans[v[0]] = l;
		return;
	}string s(ng, '1');
	for(auto x : v)s[x] = '0';
	vector<int> L, R;
	for(int i=l;i<=r;i++){
		s[v[i-l]] = '1';
		if(check_element(s)){
			L.push_back(v[i-l]);
		}else {
			R.push_back(v[i-l]);
		}s[v[i-l]] = '0';
	}
	int mid = (l+r)>>1;
	find_ans(l, mid, L, ans);
	find_ans(mid+1, r,R,ans);
}
vector<int> restore_permutation(int N, int w, int r) {
	ng = N;
	build(0, ng-1);
	compile_set();
	vector<int> ans(ng);
	vector<int> v;
	for(int i=0;i<ng;i++)v.push_back(i);
	find_ans(0, ng-1, v, ans);
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 8
2 Correct 0 ms 256 KB n = 8
3 Correct 1 ms 256 KB n = 8
4 Correct 0 ms 256 KB n = 8
5 Correct 1 ms 256 KB n = 8
6 Correct 1 ms 384 KB n = 8
7 Correct 1 ms 256 KB n = 8
8 Correct 0 ms 256 KB n = 8
9 Correct 0 ms 256 KB n = 8
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 256 KB n = 8
12 Correct 0 ms 256 KB n = 8
13 Correct 0 ms 256 KB n = 8
14 Correct 0 ms 256 KB n = 8
15 Correct 1 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 512 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 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

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 544 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