oj.uz

답안 #1076134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076134 2024-08-26T11:21:31 Z Abito Simurgh (IOI17_simurgh) C++17
30 / 100
 2892 ms 1712 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
#define ask count_common_roads
using namespace std;
const int N=3e4+5;
int par[N],sz[N];
bool in[N];
int getpar(int x){
	if (x==par[x]) return x;
	return par[x]=getpar(par[x]);
}
bool link(int x,int y){
	x=getpar(x);
	y=getpar(y);
	if (x==y) return 0;
	if (sz[x]>sz[y]) swap(x,y);
	sz[y]+=sz[x];
	par[x]=y;
	return 1;
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	int m=u.size();
	for (int i=0;i<m;i++) u[i]++,v[i]++;
	for (int i=1;i<=n;i++) sz[i]=1,par[i]=i;
	vector<int> r;
	for (int i=0;i<m;i++){
		if (link(u[i],v[i])) r.pb(i),in[i]=1;
	}
	int ans=ask(r);
	while (ans<n-1){
		bool op=0;
		for (int i=0;i<n-1 && !op;i++){
			for (int j=0;j<m && !op;j++){
				if (in[j]) continue;
				vector<int> t;
				for (int k=0;k<n-1;k++){
					if (k==i) continue;
					t.pb(r[k]);
				}
				t.pb(j);
				for (int i=1;i<=n;i++) sz[i]=1,par[i]=i;
				int tree=0;
				for (auto x:t) tree+=link(u[x],v[x]);
				if (tree!=n-1) continue;
				int h=ask(t);
				if (h<=ans) continue;
				ans=h;
				swap(r,t);
				op=1;
				break;
			}
		}
	}
	return r;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 344 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 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 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 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 344 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 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 33 ms 460 KB correct
15 Correct 23 ms 480 KB correct
16 Correct 43 ms 348 KB correct
17 Correct 44 ms 448 KB correct
18 Correct 44 ms 344 KB correct
19 Correct 88 ms 444 KB correct
20 Correct 57 ms 344 KB correct
21 Correct 25 ms 348 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 348 KB correct
27 Correct 0 ms 344 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 1 ms 348 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 344 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 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 33 ms 460 KB correct
15 Correct 23 ms 480 KB correct
16 Correct 43 ms 348 KB correct
17 Correct 44 ms 448 KB correct
18 Correct 44 ms 344 KB correct
19 Correct 88 ms 444 KB correct
20 Correct 57 ms 344 KB correct
21 Correct 25 ms 348 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 348 KB correct
27 Correct 0 ms 344 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Incorrect 2892 ms 884 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Incorrect 1929 ms 1712 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 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 1 ms 344 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 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 33 ms 460 KB correct
15 Correct 23 ms 480 KB correct
16 Correct 43 ms 348 KB correct
17 Correct 44 ms 448 KB correct
18 Correct 44 ms 344 KB correct
19 Correct 88 ms 444 KB correct
20 Correct 57 ms 344 KB correct
21 Correct 25 ms 348 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 1 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 348 KB correct
27 Correct 0 ms 344 KB correct
28 Correct 1 ms 348 KB correct
29 Correct 1 ms 348 KB correct
30 Correct 1 ms 348 KB correct
31 Correct 1 ms 348 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 1 ms 348 KB correct
34 Incorrect 2892 ms 884 KB WA in grader: NO
35 Halted 0 ms 0 KB -