oj.uz

답안 #707116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707116 2023-03-08T13:22:24 Z minhcool CEOI16_icc (CEOI16_icc) C++17
61 / 100
 183 ms 596 KB 
#include<bits/stdc++.h>
#include "icc.h"
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n, rt[N], sz[N];
 
int root(int x){
	return (x == rt[x] ? x : rt[x] = root(rt[x]));
}
 
int arr1[N], arr2[N];
 
bool queryy(vector<int> a, vector<int> b){
	for(int i = 0; i < a.size(); i++) arr1[i] = a[i];
	for(int i = 0; i < b.size(); i++) arr2[i] = b[i];
	return query(a.size(), b.size(), arr1, arr2);
}
 
void merge(int x, int y){
	x = root(x), y = root(y);
	assert(x != y);
	if(sz[x] < sz[y]) swap(x, y);
	sz[x] += sz[y];
	rt[y] = x;
}
 
int ind[N];
 
void run(int N){
	n = N;
	for(int i = 1; i <= n; i++){
		rt[i] = i;
		sz[i] = 1;
	}
	int temp = n - 1;
	while(temp--){
		vector<int> v;
		for(int i = 1; i <= n; i++) if(root(i) == i) v.pb(i);
		vector<int> a, b;
		while(1){
			a.clear(), b.clear();
			random_shuffle(v.begin(), v.end());
			for(int i = 0; i < v.size(); i++) ind[v[i]] = i;
			for(int i = 1; i <= n; i++){
				if(ind[root(i)] < (v.size() / 2)) a.pb(i);
				else b.pb(i);
			}
			bool ck = queryy(a, b);
			if(ck) break;
		}
		int le = 0, ri = a.size() - 1;// first position to be correct
		while(le < ri){
			int mid = (le + ri) >> 1;
			vector<int> temp;
			for(int i = 0; i <= mid; i++) temp.pb(a[i]);
			if(!queryy(temp, b)) le = mid + 1;
			else ri = mid;
		}
		int val1 = a[le];
		le = 0, ri = b.size() - 1;
		while(le < ri){
			int mid = (le + ri) >> 1;
			vector<int> temp;
			for(int i = 0; i <= mid; i++) temp.pb(b[i]);
			if(!queryy(a, temp)) le = mid + 1;
			else ri = mid;
		}
		int val2 = b[le];
		merge(val1, val2);
		setRoad(val1, val2);
	}
}
 
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
*/

Compilation message

icc.cpp:17:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   17 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
icc.cpp: In function 'bool queryy(std::vector<int>, std::vector<int>)':
icc.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i = 0; i < a.size(); i++) arr1[i] = a[i];
      |                 ~~^~~~~~~~~~
icc.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(int i = 0; i < b.size(); i++) arr2[i] = b[i];
      |                 ~~^~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:57:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    for(int i = 0; i < v.size(); i++) ind[v[i]] = i;
      |                   ~~^~~~~~~~~~
icc.cpp:59:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     if(ind[root(i)] < (v.size() / 2)) a.pb(i);
      |        ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Ok! 103 queries used.
2 Correct 5 ms 468 KB Ok! 103 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 468 KB Ok! 541 queries used.
2 Correct 54 ms 512 KB Ok! 862 queries used.
3 Correct 44 ms 468 KB Ok! 779 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 520 KB Ok! 1515 queries used.
2 Correct 183 ms 516 KB Ok! 2100 queries used.
3 Correct 130 ms 596 KB Ok! 1649 queries used.
4 Correct 131 ms 508 KB Ok! 1671 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 468 KB Ok! 1670 queries used.
2 Correct 146 ms 520 KB Ok! 1686 queries used.
3 Correct 149 ms 512 KB Ok! 1865 queries used.
4 Correct 148 ms 532 KB Ok! 1546 queries used.

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 145 ms 508 KB Too many queries! 1833 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 520 KB Too many queries! 1899 out of 1625
2 Halted 0 ms 0 KB -