oj.uz

Submission #729994

# Submission time Handle Problem Language Result Execution time Memory
729994 2023-04-25T03:36:39 Z Baytoro Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 516 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "messy.h"
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second

int N,W,R;
vector<int> ans;
void build1(int l, int r){
	if(l==r) return;
	int md=(l+r)/2;
	string s(N,'1');
	for(int i=l;i<=r;i++) s[i]='0';
	for(int i=l;i<=md;i++){
		s[i]='1';
		add_element(s);
		s[i]='0';
	}
	build1(l,md);build1(md+1,r);
}
void get(int l, int r, vector<int> v){
	if(l==r){
		ans[v[0]]=l;return;
	}
	int md=(l+r)/2;
	string s(N,'1');
	for(auto it: v) s[it]='0';
	vector<int> L,R;
	for(auto it: v){
		s[it]='1';
		if(check_element(s)) L.pb(it);
		else R.pb(it);
		s[it]='0';
	}
	get(l,md,L);get(md+1,r,R);
}
vector<int> restore_permutation(int n, int w, int r) {
	N=n,W=w,R=r;
	ans.resize(N);
	build1(0,N-1);
	compile_set();
	vector<int> v;
	for(int i=0;i<n;i++) v.pb(i);
	get(0,N-1,v);
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 300 KB n = 8
4 Correct 1 ms 296 KB n = 8
5 Correct 1 ms 296 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 300 KB n = 8
8 Correct 1 ms 212 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 1 ms 212 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 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 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 300 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 300 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 468 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 456 KB n = 128
8 Correct 2 ms 428 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 1 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 488 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128