oj.uz

Submission #62081

# Submission time Handle Problem Language Result Execution time Memory
62081 2018-07-27T12:16:42 Z bazsi700 ICC (CEOI16_icc) C++14
7 / 100
 493 ms 852 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;

#define MOD 1000000007
#define ll long long int
#define vi vector<int>
#define vii vector< vector<int> >
#define PI 3.1415926535897932384626433832795
#define INF 9223372036854775807LL

//13:22

int root[105];

int findroot(int x) {
	if(root[x] != x) {
		root[x] = findroot(root[x]);
	}
	return root[x];
}

void join(int a, int b) {
	if(rand()%2) {
		root[findroot(a)] = findroot(b);
	} else {
		root[findroot(b)] = findroot(a);
	}
}

void run(int n) {
	srand(42);
	for(int i = 1; i <= n; i++) {
		root[i] = i;
	}
	for(int i = 1; i < n; i++) {
		set<int> roots;
		vii inroot(n+1,vi());
		set<int> gr;
		for(int i = 1; i <= n; i++) {
			roots.insert(findroot(i));
			inroot[root[i]].push_back(i);
			gr.insert(i);
		}
		int xgr,ygr,x,y;
		x = -1;
		y = -1;
		xgr = -1;
		for(int curr : roots) {
			int a[inroot[curr].size()];
			int ind = 0;
			for(int el : inroot[curr]) {
				gr.erase(el);
				a[ind++] = el;
			}
			ind = 0;
			int b[n-inroot[curr].size()];
			for(int el : gr) {
				b[ind++] = el;
			}
			int an = query(inroot[curr].size(),n-inroot[curr].size(),a,b);
			if(an == 1) {
				xgr = curr;
				break;
			}
			for(int el : inroot[curr]) {
				gr.insert(el);
			}
		}
		int ind = 0;
		int b[n-inroot[xgr].size()];
		for(int el : gr) {
			b[ind++] = el;
		}
		for(auto posx : inroot[xgr]) {
			int a[1];
			a[0] = posx;
			int an = query(1,n-inroot[xgr].size(),a,b);
			if(an) {
				x = posx;
				break;
			}
		}
		for(auto posy : gr) {
			int bb[1];
			int a[1];
			a[0] = x;
			bb[0] = posy;
			int an = query(1,1,a,bb);
			if(an) {
				y = posy;
				break;
			}
		}
		join(x,y);
		setRoad(x,y);
	}
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:45:11: warning: unused variable 'ygr' [-Wunused-variable]
   int xgr,ygr,x,y;
           ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 588 KB Ok! 302 queries used.
2 Correct 22 ms 588 KB Ok! 289 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 278 ms 688 KB Too many queries! 3537 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 493 ms 756 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 376 ms 756 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 385 ms 792 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 286 ms 852 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -