oj.uz

Submission #632299

# Submission time Handle Problem Language Result Execution time Memory
632299 2022-08-19T20:14:26 Z Cyber_Wolf ICC (CEOI16_icc) C++14
0 / 100
 336 ms 588 KB 
//CEOI '16 P1
//Problem: ICC
//Link: https://oj.uz/problem/view/CEOI16_icc

#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

#define lg long long

const lg MOD = 1e9+7, N = 101, M = 1e7+1, SZ = 1e3+1;

lg par[N], compSize[N];
vector<lg> child[N];

lg getParent(lg src)
{
	if(src == par[src])	return src;
	return par[src] = getParent(par[src]);
}

void join(lg u, lg v)
{
	u = getParent(u), v = getParent(v);
	if(u == v)	return;
	if(compSize[u] > compSize[v])	swap(u, v);
	par[u] = v;
	for(auto it : child[u])	child[v].push_back(it);
	compSize[v] += compSize[u];
}


void run(int n)
{
	for(int i = 1; i <= n; i++)	par[i] = i, compSize[i] = 1, child[i].push_back(i);
	lg x = n-1;
	while(x--)
	{
		vector<lg> parents;
		for(int i = 1; i <= n; i++)	if(par[i] == i)	parents.push_back(i);
		bool cur = true;
		lg sz = parents.size();
		for(int i = 0; i < sz && cur; i++)
		{
			for(int j = i+1; j < sz && cur; j++)
			{
				lg u = parents[i], v = parents[j];
				if(getParent(u) == getParent(v))	continue;
				lg sz1 = child[u].size(), sz2 = child[v].size();
				int a[sz1], b[sz2];
				for(int k = 0; k < sz1; k++)	a[k] = child[u][k];
				for(int k = 0; k < sz2; k++)	b[k] = child[v][k];
				bool flag = query(sz1, sz2, a, b);
				if(flag)
				{
					if(sz1 == 1 && sz2 == 1)
					{
						join(a[0], b[0]);
						setRoad(a[0], b[0]);
						cur = false;
						break;
					}
					for(int k = 0; k < sz1; k++)
					{
						int z[] = {a[k]};
						bool cur = query(1, sz2, z, b);
						if(cur)
						{
							for(int g = 0; g < sz2; g++)
							{
								int y[] = {b[g]};
								bool cur2 = query(1, 1, z, y);
								if(cur2)
								{
									join(z[0], y[0]);
									setRoad(z[0], y[0]);
								}
								else{
									join(z[0], y[0]);
									setRoad(z[0], y[0]);
								}
							}
						}
					}
					cur = false;
					break;
				}
			}
		}
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 168 ms 484 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 336 ms 488 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 316 ms 480 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 275 ms 588 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 263 ms 468 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -