oj.uz

Submission #50918

# Submission time Handle Problem Language Result Execution time Memory
50918 2018-06-14T19:03:40 Z zetapi Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 588 KB 
#include "messy.h"
#include "bits/stdc++.h"
using namespace std;
 
#define pb 	push_back
 
vector<int> res;
 
int N;
 
void build(int low,int high)
{
	if(low==high)
	return ;
	string X="";
	int mid=(low+high)/2;
	for(int A=0;A<N;A++)
	{
		if(A<low or A>high)
			X+="1";
		else 
			X+="0";
	}
	for(int A=low;A<=mid;A++)
	{
		X[A]='1';
		add_element(X);
		X[A]='0';
	}
	build(low,mid);
	build(mid+1,high);
	return ;
}
 
void solve(int low,int high,vector<int> lol)
{
	vector<int> present,absent,now;
	for(int B=0;B<N;B++)
	{
		if(lol[B])
			present.pb(B);
		else
			absent.pb(B);
	}
	if(low==high)
	{
		res[present[0]]=low;
		return ;
	}
	string X="";
	for(int A=0;A<N;A++)
		X+="0";
	for(auto A:absent)
		X[A]='1';
	for(int A=0;A<N;A++)
	{
		if(X[A]=='1')
			continue;
		X[A]='1';
		if(check_element(X))
			now.pb(A);
		X[A]='0';
	}
	int mid=(low+high)/2;
	vector<int> f(N,0),s(N,1);
	for(auto A:now)
		f[A]=1;
	for(auto A:now)
		s[A]=0;
	for(auto A:absent)
		s[A]=0;
	solve(low,mid,f);
	solve(mid+1,high,s);
	return ;
}
 
vector<int> restore_permutation(int n,int w,int r) 
{
    /*add_element("0");
    compile_set();
    check_element("0");*/
    
    vector<int> f(n,1);
    N=n;
    res.resize(n);
	build(0,n-1);
	compile_set();
	solve(0,n-1,f);
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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