oj.uz

Submission #415492

# Submission time Handle Problem Language Result Execution time Memory
415492 2021-06-01T07:21:03 Z Bill_00 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 2892 KB 
#include <vector>
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int sz;
string s="";
vector<int>v[100000];
void add(int l,int r){
	if(l+1==r) return;
	int m=(l+r)>>1;
	for(int i=m+1;i<=r;i++){
		s[i]='1';
	}
	for(int i=l;i<=((l+m)>>1);i++){
		s[i]='1';
		add_element(s);
		// cout << s << '\n';
		s[i]='0';
	}
	for(int i=m+1;i<=r;i++){
		s[i]='0';
	}
	for(int i=l;i<=m;i++){
		s[i]='1';
	}
	for(int i=m+1;i<=((m+r)>>1);i++){
		s[i]='1';
		add_element(s);
		// cout << s << '\n';
		s[i]='0';
	}
	for(int i=l;i<=m;i++){
		s[i]='0';
	}
	add(l,m);
	add(m+1,r);
}
void solve(int id,int l,int r){
	if(l+1==r) return;
	int m=(l+r)>>1;
	for(int i:v[id*2+1]){
		s[i]='1';
	}
	for(int i:v[id*2]){
		s[i]='1';
		if(check_element(s)){
			v[id*4].push_back(i);
		}
		else v[id*4+1].push_back(i);
		s[i]='0';
	}
	for(int i:v[id*2+1]) s[i]='0';
	for(int i:v[id*2]) s[i]='1';
	for(int i:v[id*2+1]){
		s[i]='1';
		if(check_element(s)){
			v[id*4+2].push_back(i);
		}
		else v[id*4+3].push_back(i);
		s[i]='0';
	}
	for(int i:v[id*2]) s[i]='0';
	solve(id*2,l,m);
	solve(id*2+1,m+1,r);
}
vector<int> restore_permutation(int n, int w, int r){
	sz=n;
	vector<int>ans(n);
	for(int i=0;i<n;i++) s+=('0');
	for(int i=0;i<(n/2);i++){
		s[i]='1';
		add_element(s);
		s[i]='0';
	}
	add(0,sz-1);
	compile_set();
	for(int i=0;i<n;i++){
		s[i]='1';
		if(check_element(s)){
			v[2].push_back(i);
		}
		else v[3].push_back(i);
		s[i]='0';  
	}
	solve(1,0,sz-1);
	for(int i=n;i<2*n;i++){
		ans[v[i][0]]=i-n;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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