oj.uz

Submission #69195

# Submission time Handle Problem Language Result Execution time Memory
69195 2018-08-20T08:58:53 Z Sa1378 Unscrambling a Messy Bug (IOI16_messy) C++17
70 / 100
 3 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define N ((int)201)

int n,ans[N];
string now;

string ok(int p)
{
	string s=now;
	if(p)for(int i=0;i<n;i++)s[i]=((s[i]=='0')?'1':'0');
	return s;
}

void ask(int l,int r)
{
	if(l>=r-1)return ;
	if(l==r-2)
	{
		now[l]='1';add_element(ok(0));now[l]='0';
		return ;
	}
	int mid=(l+r+1)/2;
	now[l]='1';add_element(ok(0));now[l]='0';
	for(int i=l+1;i<mid;i++)now[i]='1',add_element(ok(1)),now[i]='0';
	now[l]='1';
	ask(l+1,mid);ask(mid,r);
	now[l]='0';
	return ;
}

void solve(int l,int r,vector <int> valid)
{
//	cout<<l<<" "<<r<<"||| \n";
//	for(auto u:valid)cout<<u<<" ";cout<<"\n";
	if(l>=r)return ;
	if(l==r-1){ans[l]=valid[0];return ;}
	int id=-1;
	for(auto i:valid)
	{
		if(now[i]=='1')continue;
		now[i]='1';
//		cout<<ok(0)<<"\n";
		if(check_element(ok(0)))
		{
			id=i;ans[l]=id;
			now[i]='0';// now[id] is 1
			//cout<<id<<"..\n";
			break;
		}
		now[i]='0';
	}
	if(l==r-2)
	{
		for(auto i:valid)
			if(i!=ans[l])
				ans[r-1]=i;
		return ;
	}
//	cout<<id<<"..\n";
	int mid=(l+r+1)/2;
	vector <int> valid_lft,valid_rght;
	for(auto i:valid)
		if(now[i]=='0')
		{
			now[i]='1';
		//	cout<<ok(1)<<"\n";
			if(check_element(ok(1)))
				valid_lft.push_back(i);//cout<<i<<"\n";
			else if(i!=id)valid_rght.push_back(i);
			now[i]='0';
		}
	now[id]='1';
	solve(l+1,mid,valid_lft);
	solve(mid,r,valid_rght);
	now[id]='0';
}

vector<int> restore_permutation(int m, int w, int r)
{
	n=m;
	for(int i=0;i<n;i++)now+='0';
	ask(0,n);
	compile_set();
	vector <int> res;
	for(int i=0;i<n;i++)res.push_back(i);
	solve(0,n,res);
	for(int i=0;i<n;i++)res[ans[i]]=i;//,cout<<i<<" "<<ans[i]<<"\n";;
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 512 KB grader returned WA
2 Halted 0 ms 0 KB -