oj.uz

Submission #207281

# Submission time Handle Problem Language Result Execution time Memory
207281 2020-03-07T01:53:09 Z autumn_eel Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 7 ms 508 KB 
#include "messy.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int,int>P;

int N;
void add(int l,int r){
	if(r-l==1)return;
	int md=(l+r)/2;
	string s(N,'0');
	for(int i=l;i<r;i++)s[i]='1';
	for(int i=l;i<md;i++){
		s[i]='0';
		add_element(s);
		s[i]='1';
	}
	add(l,md);
	add(md,r);
}

vector<int>u;

void solve(vector<int>v){
	if(v.size()==1)return;
	string s(N,'0');
	for(int i:v)s[i]='1';
	int add=v.size()/2;
	vector<int>a,b;
	for(int i:v){
		s[i]='0';
		if(check_element(s))a.push_back(i);
		else b.push_back(i),u[i]+=add;
		s[i]='1';
	}
	solve(a);solve(b);
}

vector<int> restore_permutation(int n, int w, int r) {
	N=n;
	add(0,N);
	compile_set();
	vector<int>v(n);
	rep(i,n)v[i]=i;
	u=vector<int>(n);
	solve(v);
	return u;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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