oj.uz

답안 #113759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113759 2019-05-28T07:27:06 Z Mahdi_Jfri CEOI16_icc (CEOI16_icc) C++14
0 / 100
 167 ms 708 KB 
#include<bits/stdc++.h>
#include "icc.h"
using namespace std;

#define ll long long
#define pb push_back

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 rnd(seed);

const int maxn = 1e2 + 20;

vector<int> cmp[maxn];

int a[maxn] , b[maxn] , where[maxn] , x , y;

/*int query(int sz1 , int sz2 , int* a , int* b)
{
	cout << "START" << endl;
	cout << sz1 << " " << sz2 << endl;
	for(int i = 0; i < sz1; i++)
		cout << a[i] << " ";
	cout << endl;

	for(int i = 0; i < sz2; i++)
		cout << b[i] << " ";
	cout << endl;
	int t = 0;
	for(int i = 0; i < sz1; i++)
		t += (a[i] == x || a[i] == y);

	if(t != 1)
		return 0;

	t = 0;
	for(int i = 0; i < sz2; i++)
		t += (b[i] == x || b[i] == y);

	if(t != 1)
		return 0;

	return 1;
}

void setRoad(int a , int b)
{
	cout << a << " " << b << " HOORAY" << endl;
	exit(0);
}*/

pair<int , int> fn(int n)
{
	int pt1 = 0 , pt2 = 0;
	while(1)
	{
		pt1 = 0 , pt2 = 0;
		for(int i = 1; i <= n; i++)
		{
			if(rnd() % 2)
			{
				for(auto x : cmp[i])
					a[pt1++] = x;
			}
			else
			{
				for(auto x : cmp[i])
					b[pt2++] = x;
			}
		}

		if(query(pt1 , pt2 , a , b))
			break;
	}

	vector<int> x , y;
	for(int i = 0; i < pt1; i++)
		x.pb(a[i]);
	for(int i = 0; i < pt2; i++)
		y.pb(b[i]);

	while((int)y.size() > 1)
	{
		for(int i = 0; i < (int)y.size() / 2; i++)
			b[i] = y[i];
		pt2 = y.size() / 2;

		if(query(pt1 , pt2 , a , b))
		{
			y.clear();
			for(int i = 0; i < pt2; i++)
				y.pb(b[i]);
		}
		else
		{
			vector<int> tmp;
			for(int i = pt2; i < (int)y.size(); i++)
				tmp.pb(y[i]);
			y = tmp;
		}
	}

	swap(x , y);
	pt1 = x.size();
	for(int i = 0; i < pt1; i++)
		a[i] = x[i];

	while((int)y.size() > 1)
	{
		for(int i = 0; i < (int)y.size() / 2; i++)
			b[i] = y[i];
		pt2 = y.size() / 2;

		if(query(pt1 , pt2 , a , b))
		{
			y.clear();
			for(int i = 0; i < pt2; i++)
				y.pb(b[i]);
		}
		else
		{
			vector<int> tmp;
			for(int i = pt2; i < (int)y.size(); i++)
				tmp.pb(y[i]);
			y = tmp;
		}
	}

	setRoad(x[0] , y[0]);
	return make_pair(x[0] , y[0]);
}

void run(int n)
{
	for(int i = 1; i <= n; i++)
		cmp[i].pb(i) , where[i] = i;

	for(int i = 0; i < n - 1; i++)
	{
		auto tmp = fn(n - i);
		int v = tmp.first , u = tmp.second;

		for(auto x : cmp[where[u]])
			where[x] = where[v] , cmp[where[v]].pb(x);

		for(int j = where[u] + 1; j < n - i; j++)
		{
			for(auto x : cmp[j])
				where[x] = j - 1;
			cmp[j].swap(cmp[j - 1]);
		}
	}
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 708 KB Number of queries more than 3000 out of 1500
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 512 KB The query sets must be disjoint
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 512 KB The query sets must be disjoint
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 512 KB The query sets must be disjoint
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 512 KB The query sets must be disjoint
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 512 KB The query sets must be disjoint
2 Halted 0 ms 0 KB -