oj.uz

답안 #632316

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632316 2022-08-19T20:35:00 Z Cyber_Wolf CEOI16_icc (CEOI16_icc) C++14
7 / 100
 353 ms 500 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];

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;
	compSize[v] += compSize[u];
}


void run(int n)
{
	for(int i = 1; i <= n; i++)	par[i] = i, compSize[i] = 1;
	lg x = n-1;
	while(x--)
	{
		map<lg, lg> mp;
		for(int i = 1; i <= n; i++)
		{
			vector<lg> v;
			for(int j = 1; j <= n; j++)	if(getParent(i) != getParent(j) && !mp.count(j))	v.push_back(j);
			int arr[v.size()];
			for(int j = 0; j < v.size(); j++)	arr[j] = v[j];
			int h[1] = {i};
			bool flag = query(1, v.size(), h, arr);
			mp[i]++;
			if(!flag)	continue;
			for(auto it : v)
			{
				int g[] = {it};
				bool cur = query(1, 1, h, g);
				if(cur)
				{
					join(h[0], g[0]);
					setRoad(h[0], g[0]);
					break;
				}
			}
		}
	}
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for(int j = 0; j < v.size(); j++) arr[j] = v[j];
      |                   ~~^~~~~~~~~~
icc.cpp:51:16: warning: narrowing conversion of 'it' from 'long long int' to 'int' [-Wnarrowing]
   51 |     int g[] = {it};
      |                ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 432 KB Ok! 301 queries used.
2 Correct 11 ms 500 KB Ok! 283 queries used.

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 165 ms 480 KB Too many queries! 3525 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 353 ms 496 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 288 ms 484 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 263 ms 492 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 277 ms 484 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -