oj.uz

Submission #278860

# Submission time Handle Problem Language Result Execution time Memory
278860 2020-08-22T01:41:32 Z tinjyu Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 640 KB 
#include <vector>

#include "messy.h"
#include <iostream>
using namespace std;
int ans[100005],tag[100005],N;
void add(int s,int e)
{
	if(s==e)return ;
	int mid=(s+e)/2;
	
	string str="";
	for(int i=0;i<N;i++)str+='0';
	for(int i=0;i<s;i++)str[i]='1';
	for(int i=e+1;i<N;i++)str[i]='1';
	for(int i=s;i<=mid;i++)
	{
		str[i]='1';
		add_element(str);
		str[i]='0';
	}
	add(s,mid);
	add(mid+1,e);
	return ;
}
int find(int s,int e)
{
	//cout<<s<<" "<<e<<endl;
	if(s==e)
	{
		for(int i=0;i<N;i++)
		{
			if(tag[i]==0)ans[i]=s;
		}
		return 0;
	}
	string str="";
	for(int i=0;i<N;i++)str+='0';
	for(int i=0;i<N;i++)if(tag[i]==1)str[i]='1';
	int tmp[1005];
	for(int i=0;i<N;i++)tmp[i]=0;
	for(int i=0;i<N;i++)
	{
		if(tag[i]==0)
		{
			str[i]='1';
			//cout<<str<<" ";
			bool c=check_element(str);
			//cout<<c<<endl;
			if(c==1)tmp[i]=1;
			else tmp[i]=2;
			str[i]='0';
		}
	}
	for(int i=0;i<N;i++)
	{
		if(tmp[i]==0 || tmp[i]==2)tag[i]=1;
		else tag[i]=0;
	}
	find(s,(s+e)/2);
	for(int i=0;i<N;i++)
	{
		if(tmp[i]==0 || tmp[i]==1)tag[i]=1;
		else tag[i]=0;
	}
	find((s+e)/2+1,e);
	return 0;
}
std::vector<int> restore_permutation(int n, int w, int r) {
    N=n;
	add(0,n-1);
    compile_set();
    find(0,n-1);
    vector<int>a(n);
    for(int i=0;i<n;i++)
	{
		a[i]=ans[i];
	}
	return a;
}

Subtask #1
20.0 / 20.0

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