oj.uz

답안 #960966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960966 2024-04-11T10:05:46 Z Trisanu_Das Simurgh (IOI17_simurgh) C++17
51 / 100
 87 ms 3796 KB 
#include "simurgh.h"
#include<bits/stdc++.h>
#define pb emplace_back
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
#define all(n) (n).begin(),(n).end()
using namespace std;
 
vi ans, pos, pos2, U, V;
 
int pa[505], N, M;
void init(){
	for(int i=0;i<N;i++) pa[i] = i;
}
int fp(int x){
	if(pa[x] == x) return x;
	return pa[x] = fp(pa[x]);
}
void uni(int x,int y){
	x = fp(x), y = fp(y);
	assert(x != y);
	pa[x] = y;
}
 
void search_next(){
	init();
	int cnt = N;
	vi cur;
	for(auto &i:ans){
		uni(U[i], V[i]);
		cur.pb(i);
		cnt--;
	}
	vector<pii> tried;
	for(auto &i:pos){
		if(cnt == 2){
			if(fp(U[i]) != fp(V[i])){
				cur.pb(i);
				assert(cur.size() == N-1);
				int common = count_common_roads(cur); 
				tried.pb(common,i);
				cur.pop_back();
			}
			else pos2.pb(i);
		}
		else{
			if(fp(U[i]) != fp(V[i])){
				cur.pb(i);
				uni(U[i], V[i]);
				cnt--;
			}
			pos2.pb(i);
		}
	}
	pair<int,int> mx = *max_element(all(tried));
	for(auto &x : tried) if(x.fi == mx.fi) ans.pb(x.se);
	swap(pos, pos2);
	pos2.clear();
}
 
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	M = u.size(), N = n;
	U = u, V = v;
	for(int i=0;i<M;i++) pos.pb(i);
	while(ans.size() < N - 1) search_next();
	return ans;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:2:
simurgh.cpp: In function 'void search_next()':
simurgh.cpp:41:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |     assert(cur.size() == N-1);
      |            ~~~~~~~~~~~^~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:67:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 |  while(ans.size() < N - 1) search_next();
      |        ~~~~~~~~~~~^~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 436 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 600 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 1 ms 348 KB correct
15 Correct 1 ms 348 KB correct
16 Correct 1 ms 348 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 1 ms 344 KB correct
20 Correct 1 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 504 KB correct
23 Correct 1 ms 440 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 344 KB correct
28 Correct 1 ms 344 KB correct
29 Correct 1 ms 344 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 600 KB correct
33 Correct 1 ms 444 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 436 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 600 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 1 ms 348 KB correct
15 Correct 1 ms 348 KB correct
16 Correct 1 ms 348 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 1 ms 344 KB correct
20 Correct 1 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 504 KB correct
23 Correct 1 ms 440 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 344 KB correct
28 Correct 1 ms 344 KB correct
29 Correct 1 ms 344 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 600 KB correct
33 Correct 1 ms 444 KB correct
34 Correct 74 ms 1624 KB correct
35 Correct 72 ms 1628 KB correct
36 Correct 62 ms 1212 KB correct
37 Correct 4 ms 456 KB correct
38 Correct 87 ms 1652 KB correct
39 Correct 62 ms 1368 KB correct
40 Correct 71 ms 1292 KB correct
41 Correct 39 ms 1628 KB correct
42 Correct 64 ms 1656 KB correct
43 Correct 36 ms 1096 KB correct
44 Correct 30 ms 1012 KB correct
45 Correct 36 ms 860 KB correct
46 Correct 33 ms 860 KB correct
47 Correct 13 ms 600 KB correct
48 Correct 2 ms 348 KB correct
49 Correct 4 ms 348 KB correct
50 Correct 12 ms 676 KB correct
51 Correct 34 ms 1064 KB correct
52 Correct 31 ms 860 KB correct
53 Correct 31 ms 860 KB correct
54 Correct 46 ms 1112 KB correct
55 Correct 32 ms 856 KB correct
56 Correct 33 ms 860 KB correct
57 Correct 34 ms 1076 KB correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 1 ms 344 KB correct
3 Incorrect 67 ms 3796 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 436 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 600 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 1 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 1 ms 348 KB correct
15 Correct 1 ms 348 KB correct
16 Correct 1 ms 348 KB correct
17 Correct 2 ms 344 KB correct
18 Correct 1 ms 348 KB correct
19 Correct 1 ms 344 KB correct
20 Correct 1 ms 348 KB correct
21 Correct 1 ms 348 KB correct
22 Correct 1 ms 504 KB correct
23 Correct 1 ms 440 KB correct
24 Correct 1 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 344 KB correct
28 Correct 1 ms 344 KB correct
29 Correct 1 ms 344 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 1 ms 600 KB correct
33 Correct 1 ms 444 KB correct
34 Correct 74 ms 1624 KB correct
35 Correct 72 ms 1628 KB correct
36 Correct 62 ms 1212 KB correct
37 Correct 4 ms 456 KB correct
38 Correct 87 ms 1652 KB correct
39 Correct 62 ms 1368 KB correct
40 Correct 71 ms 1292 KB correct
41 Correct 39 ms 1628 KB correct
42 Correct 64 ms 1656 KB correct
43 Correct 36 ms 1096 KB correct
44 Correct 30 ms 1012 KB correct
45 Correct 36 ms 860 KB correct
46 Correct 33 ms 860 KB correct
47 Correct 13 ms 600 KB correct
48 Correct 2 ms 348 KB correct
49 Correct 4 ms 348 KB correct
50 Correct 12 ms 676 KB correct
51 Correct 34 ms 1064 KB correct
52 Correct 31 ms 860 KB correct
53 Correct 31 ms 860 KB correct
54 Correct 46 ms 1112 KB correct
55 Correct 32 ms 856 KB correct
56 Correct 33 ms 860 KB correct
57 Correct 34 ms 1076 KB correct
58 Correct 1 ms 344 KB correct
59 Correct 1 ms 344 KB correct
60 Incorrect 67 ms 3796 KB WA in grader: NO
61 Halted 0 ms 0 KB -