oj.uz

답안 #945064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945064 2024-03-13T11:12:25 Z pcc Meetings (JOI19_meetings) C++17
100 / 100
 1408 ms 1556 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

/*
  int x = Query(0, 1, 2);
    Bridge(u, u + 1);
*/

const int mxn = 2020;
set<int> tree[mxn];
int sz[mxn];
vector<int> perm;
bitset<mxn> done;
bitset<mxn> del;
int N;

int ask(int a,int b,int c){
	//assert(a != b&&b!=c&&c != a);
	return Query(a,b,c);
}
void add_edge(int a,int b){
	//assert(a != b);
	tree[a].insert(b);
	tree[b].insert(a);
	cerr<<"ADD:"<<a<<' '<<b<<endl;
}

void del_edge(int a,int b){
	cerr<<"DEL:"<<a<<' '<<b<<endl;
	//assert(tree[a].find(b) != tree[a].end());
	tree[a].erase(b);
	tree[b].erase(a);
}

void szdfs(int now,int par){
	sz[now] = 1;
	for(auto nx:tree[now]){
		if(del[nx]||nx==par)continue;
		szdfs(nx,now);
		sz[now] += sz[nx];
	}
	return;
}

int get_centroid(int now,int par,int tar){
	for(auto nxt:tree[now]){
		if(nxt == par||del[nxt])continue;
		if(sz[nxt]>tar)return get_centroid(nxt,now,tar);
	}
	return now;
}

void calc(int now,int tar){
	szdfs(now,now);
	cerr<<"CALC:"<<now<<' '<<tar<<' '<<sz[now]<<endl;
	if(sz[now] == 1){
		add_edge(now,tar);
		return;
	}
	else if(sz[now] == 2){
		int nx;
		for(auto &i:tree[now])if(!del[i])nx = i;
		int r = ask(now,nx,tar);
		if(r == tar){
			del_edge(now,nx);
			add_edge(tar,now);
			add_edge(tar,nx);
		}
		else if(r == nx||r == now){
			add_edge(r,tar);
		}
		else{
			done[r] = true;
			del_edge(now,nx);
			add_edge(now,r);
			add_edge(r,nx);
			add_edge(r,tar);
		}
		return;
	}
	now = get_centroid(now,now,(sz[now]-1)/2);
	vector<int> ch;
	for(auto nxt:tree[now]){
		if(del[nxt])continue;
		ch.push_back(nxt);
	}
	del[now] = true;
	for(int i = 1;i<ch.size();i+=2){
		int a = ch[i-1],b = ch[i];
		int r = ask(a,b,tar);
		if(r == now)continue;
		else if(r == a)calc(a,tar);
		else if(r == b)calc(b,tar);
		else if(r == tar){
			int tmp = ask(now,a,tar);
			if(tmp == now){
				del_edge(now,b);
				add_edge(now,tar);
				if(now == tar)cout<<"ERROR"<<endl;
				add_edge(tar,b);
				if(tar == b)cout<<"ERROR"<<endl;
			}
			else{
				del_edge(now,a);
				add_edge(now,tar);
				if(now == tar)cout<<"ERROR"<<endl;
				add_edge(tar,a);
				if(tar == a)cout<<"ERROR"<<endl;
			}
		}
		else{
			int tmp = ask(now,r,a);
			if(tmp == now){
				done[r] = true;
				del_edge(now,b);
				add_edge(now,r);
				if(now == r)cout<<"ER"<<endl;
				add_edge(r,b);
				if(r == b)cout<<"R"<<endl;
				add_edge(r,tar);
				if(r == tar)cout<<"R"<<endl;
			}
			else{
				done[r] = true;
				del_edge(now,a);
				add_edge(now,r);
				if(now == r)cout<<"ER"<<endl;
				add_edge(r,a);
				if(r == b)cout<<"R"<<endl;
				add_edge(r,tar);
				if(r == tar)cout<<"R"<<endl;
			}
		}
		return;
	}
	if(ch.size()&1){
		auto a = ch.back();
		int r = ask(now,a,tar);
		if(r == now){
			add_edge(now,tar);
		}
		else if(r == tar){
			del_edge(now,a);
			add_edge(now,tar);
			add_edge(tar,a);
		}
		else if(r == a)calc(a,tar);
		else{
			done[r] = true;
			del_edge(now,a);
			add_edge(now,r);
			assert(now != r);
			add_edge(r,a);
			assert(r != a);
			add_edge(r,tar);
			assert(r != tar);
		}
		return;
	}
	add_edge(now,tar);
	assert(now != tar);
	return;
}

void addpt(int tar){
	del.reset();
	calc(0,tar);
	done[tar] = true;
}
void answer(){
	for(int i = 0;i<N;i++){
		for(auto nx:tree[i]){
			if(nx>i)Bridge(i,nx);
		}
	}
	return;
}
void print(){
	for(int i = 0;i<N;i++){
		for(auto nx:tree[i]){
			if(nx>i)cout<<i<<":"<<nx<<endl;
		}
	}
	return;
}

void Solve(int NN) {
	N = NN;
	srand(time(NULL));
	for(int i = 0;i<N;i++)perm.push_back(i);
	//random_shuffle(perm.begin(),perm.end());
	done[0] = true;
	for(auto &i:perm)if(!done[i])addpt(i);
	//print();
	answer();
	cerr<<"HI"<<endl;
	return;
}

Compilation message

meetings.cpp: In function 'void calc(int, int)':
meetings.cpp:89:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for(int i = 1;i<ch.size();i+=2){
      |                ~^~~~~~~~~~
meetings.cpp:70:13: warning: 'nx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   70 |   else if(r == nx||r == now){
      |           ~~^~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 15 ms 656 KB Output is correct
28 Correct 15 ms 600 KB Output is correct
29 Correct 15 ms 600 KB Output is correct
30 Correct 21 ms 600 KB Output is correct
31 Correct 14 ms 600 KB Output is correct
32 Correct 11 ms 624 KB Output is correct
33 Correct 11 ms 600 KB Output is correct
34 Correct 12 ms 600 KB Output is correct
35 Correct 11 ms 652 KB Output is correct
36 Correct 16 ms 600 KB Output is correct
37 Correct 23 ms 664 KB Output is correct
38 Correct 24 ms 600 KB Output is correct
39 Correct 22 ms 600 KB Output is correct

Subtask #4
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 458 ms 1040 KB Output is correct
2 Correct 470 ms 1212 KB Output is correct
3 Correct 436 ms 980 KB Output is correct
4 Correct 447 ms 1144 KB Output is correct
5 Correct 346 ms 1108 KB Output is correct
6 Correct 301 ms 1036 KB Output is correct
7 Correct 351 ms 1108 KB Output is correct
8 Correct 395 ms 996 KB Output is correct
9 Correct 414 ms 1104 KB Output is correct
10 Correct 366 ms 1092 KB Output is correct
11 Correct 419 ms 1072 KB Output is correct
12 Correct 505 ms 1104 KB Output is correct
13 Correct 481 ms 1328 KB Output is correct
14 Correct 762 ms 1556 KB Output is correct
15 Correct 736 ms 1556 KB Output is correct
16 Correct 807 ms 1536 KB Output is correct
17 Correct 339 ms 1044 KB Output is correct
18 Correct 1334 ms 1444 KB Output is correct
19 Correct 1408 ms 1276 KB Output is correct
20 Correct 818 ms 1360 KB Output is correct
21 Correct 818 ms 1508 KB Output is correct
22 Correct 764 ms 1112 KB Output is correct
23 Correct 716 ms 1360 KB Output is correct
24 Correct 769 ms 1336 KB Output is correct
25 Correct 1312 ms 1548 KB Output is correct
26 Correct 1349 ms 1388 KB Output is correct
27 Correct 1331 ms 1388 KB Output is correct
28 Correct 470 ms 1144 KB Output is correct
29 Correct 362 ms 1128 KB Output is correct
30 Correct 415 ms 1308 KB Output is correct
31 Correct 415 ms 1028 KB Output is correct
32 Correct 698 ms 1316 KB Output is correct
33 Correct 565 ms 1404 KB Output is correct
34 Correct 15 ms 628 KB Output is correct
35 Correct 15 ms 600 KB Output is correct
36 Correct 15 ms 600 KB Output is correct
37 Correct 14 ms 600 KB Output is correct
38 Correct 14 ms 600 KB Output is correct
39 Correct 11 ms 600 KB Output is correct
40 Correct 12 ms 600 KB Output is correct
41 Correct 13 ms 856 KB Output is correct
42 Correct 12 ms 600 KB Output is correct
43 Correct 16 ms 600 KB Output is correct
44 Correct 23 ms 664 KB Output is correct
45 Correct 24 ms 672 KB Output is correct
46 Correct 25 ms 600 KB Output is correct
47 Correct 2 ms 600 KB Output is correct
48 Correct 2 ms 600 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 2 ms 600 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 600 KB Output is correct
56 Correct 2 ms 600 KB Output is correct
57 Correct 2 ms 592 KB Output is correct
58 Correct 2 ms 600 KB Output is correct
59 Correct 2 ms 588 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct