oj.uz

답안 #632325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632325 2022-08-19T20:47:41 Z Cyber_Wolf CEOI16_icc (CEOI16_icc) C++14
0 / 100
 17 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;
			lg sz = v.size();
			while(true)
			{
				if(sz == 1)
				{
					join(h[0], v[0]);
					setRoad(h[0], v[0]);
					break;
				}
				lg mid = sz/2;
				int a[mid+1];
				for(int i = 0; i < mid; i++)
				{
					a[i] = v[i];
				}
				bool flag = query(1, mid+1, h, a);
				if(flag)
				{
					v.resize(mid+1);
					for(int i = 0; i < mid+1; i++)	v[i] = a[i];
				}
				else{
					vector<lg> bef = v;
					v.resize(v.size()-mid-1);
					for(int i = mid+1; i < v.size(); i++)	v[i-mid-1] = bef[i];
				}
			}
		}
	}
}

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:73:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |      for(int i = mid+1; i < v.size(); i++) v[i-mid-1] = bef[i];
      |                         ~~^~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 500 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 500 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 500 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 500 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 468 KB Query cities not in range [1, n]
2 Halted 0 ms 0 KB -