oj.uz

Submission #1076132

# Submission time Handle Problem Language Result Execution time Memory
1076132 2024-08-26T11:20:20 Z Abito Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 3508 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
#define ask count_common_roads
using namespace std;
const int N=2005;
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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 344 KB correct
13 Correct 0 ms 344 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 344 KB correct
13 Correct 0 ms 344 KB correct
14 Correct 26 ms 344 KB correct
15 Correct 23 ms 348 KB correct
16 Correct 41 ms 348 KB correct
17 Correct 50 ms 348 KB correct
18 Correct 33 ms 348 KB correct
19 Correct 52 ms 348 KB correct
20 Correct 43 ms 344 KB correct
21 Correct 25 ms 468 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 0 ms 344 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 0 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 0 ms 344 KB correct
31 Correct 0 ms 444 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 0 ms 348 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 344 KB correct
13 Correct 0 ms 344 KB correct
14 Correct 26 ms 344 KB correct
15 Correct 23 ms 348 KB correct
16 Correct 41 ms 348 KB correct
17 Correct 50 ms 348 KB correct
18 Correct 33 ms 348 KB correct
19 Correct 52 ms 348 KB correct
20 Correct 43 ms 344 KB correct
21 Correct 25 ms 468 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 0 ms 344 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 0 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 0 ms 344 KB correct
31 Correct 0 ms 444 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 0 ms 348 KB correct
34 Execution timed out 3032 ms 860 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Runtime error 342 ms 3508 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 1 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 344 KB correct
13 Correct 0 ms 344 KB correct
14 Correct 26 ms 344 KB correct
15 Correct 23 ms 348 KB correct
16 Correct 41 ms 348 KB correct
17 Correct 50 ms 348 KB correct
18 Correct 33 ms 348 KB correct
19 Correct 52 ms 348 KB correct
20 Correct 43 ms 344 KB correct
21 Correct 25 ms 468 KB correct
22 Correct 0 ms 348 KB correct
23 Correct 1 ms 348 KB correct
24 Correct 0 ms 344 KB correct
25 Correct 0 ms 348 KB correct
26 Correct 1 ms 348 KB correct
27 Correct 1 ms 348 KB correct
28 Correct 0 ms 348 KB correct
29 Correct 0 ms 348 KB correct
30 Correct 0 ms 344 KB correct
31 Correct 0 ms 444 KB correct
32 Correct 0 ms 348 KB correct
33 Correct 0 ms 348 KB correct
34 Execution timed out 3032 ms 860 KB Time limit exceeded
35 Halted 0 ms 0 KB -