oj.uz

Submission #546027

# Submission time Handle Problem Language Result Execution time Memory
546027 2022-04-06T04:46:50 Z blue ICC (CEOI16_icc) C++17
61 / 100
 288 ms 676 KB 
#include "icc.h"
#include <vector>
#include <algorithm>
#include <queue>
#include <iostream>
#include <random>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())

const int mx = 100;

int getRandom(int a, int b)
{
	return a + (rand() % (b-a+1));
}

int vquery(vi A, vi B)
{
	int a[mx], b[mx];
	for(int ai = 0; ai < sz(A); ai++)
		a[ai] = A[ai];

	for(int bi = 0; bi < sz(B); bi++)
		b[bi] = B[bi];

	if(sz(A) == 0 || sz(B) == 0)
		return 0;

	return query(sz(A), sz(B), a, b);
}

void run(int N)
{
	srand(3);

	vi edge[1+N];

	for(int e = 1; e <= N-1; e++)
	{
		cerr << "\n\n\n\n\n";
		cerr << "e = " << e << '\n';
		vi cc(1+N, -1);
		int ccc = 0;

		for(int i = 1; i <= N; i++)
		{
			if(cc[i] != -1) continue;
			ccc++;

			queue<int> tbv;
			tbv.push(i);

			while(!tbv.empty())
			{
				int u = tbv.front();
				tbv.pop();

				cc[u] = ccc - 1;

				cerr << u << " <> " << ccc << '\n';

				for(int v : edge[u])
				{
					if(cc[v] != -1) continue;
					tbv.push(v);
				}
			}
		}

		for(int i = 1; i <= N; i++) cerr << cc[i] << ' ';
			cerr << '\n';

		int k = 0;
		while((1<<k) < N)
			k++;

		vi bits;
		for(int v = 0; v < k; v++)
			bits.push_back(v);

		for(int t = 0; t < 2'000; t++)
		{
			int p = getRandom(0, k-1);
			int q = getRandom(0, k-1);
			if(getRandom(0, 1))
				swap(bits[p], bits[q]);
		}

		int goodbit;
		vi S[2];

		while(1)
		{
			vi ccs(1+N);
			for(int i = 1; i <= N; i++)
				ccs[i] = getRandom(0, 1);

			vi s[2];
			for(int i = 1; i <= N; i++)
				s[ccs[cc[i]]].push_back(i);

			if(vquery(s[0], s[1]))
			{
				S[0] = s[0];
				S[1] = s[1];
				break;
			}
		}

		while(sz(S[0]) > 1)
		{
			vi SS[2];
			for(int i = 0; i < sz(S[0])/2; i++)
				SS[0].push_back(S[0][i]);
			for(int i = sz(S[0])/2; i < sz(S[0]); i++)
				SS[1].push_back(S[0][i]);

			if(vquery(SS[0], S[1]))
				S[0] = SS[0];
			else
				S[0] = SS[1];
		}

		while(sz(S[1]) > 1)
		{
			vi SS[2];
			for(int i = 0; i < sz(S[1])/2; i++)
				SS[0].push_back(S[1][i]);
			for(int i = sz(S[1])/2; i < sz(S[1]); i++)
				SS[1].push_back(S[1][i]);

			if(vquery(SS[0], S[0]))
				S[1] = SS[0];
			else
				S[1] = SS[1];
		}
		
		int u = S[0][0], v = S[1][0];
		setRoad(u, v);
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:92:7: warning: unused variable 'goodbit' [-Wunused-variable]
   92 |   int goodbit;
      |       ^~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Ok! 110 queries used.
2 Correct 9 ms 468 KB Ok! 102 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 512 KB Ok! 574 queries used.
2 Correct 70 ms 504 KB Ok! 866 queries used.
3 Correct 86 ms 468 KB Ok! 840 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 592 KB Ok! 1549 queries used.
2 Correct 273 ms 564 KB Ok! 2195 queries used.
3 Correct 235 ms 536 KB Ok! 1708 queries used.
4 Correct 245 ms 508 KB Ok! 1757 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 588 KB Ok! 1710 queries used.
2 Correct 288 ms 560 KB Ok! 1751 queries used.
3 Correct 231 ms 588 KB Ok! 1901 queries used.
4 Correct 252 ms 668 KB Ok! 1553 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 231 ms 596 KB Too many queries! 1899 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 230 ms 676 KB Too many queries! 1926 out of 1625
2 Halted 0 ms 0 KB -