oj.uz

Submission #1076189

# Submission time Handle Problem Language Result Execution time Memory
1076189 2024-08-26T11:41:11 Z Abito Simurgh (IOI17_simurgh) C++17
30 / 100
 2047 ms 31932 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
#define ask count_common_roads
using namespace std;
const int N=4e4+5;
int par[N],sz[N];
bool in[N],know[N];
map<vector<int>,int> mp;
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=mp[r]=ask(r),q=1;
	for (int i=0;i<m && ans<n-1;i++){
		if (!in[i] || know[i]) continue;
		int s=i;
		for (int j=0;j<m;j++){
			if (in[j] || know[j]) continue;
			vector<int> t;
			for (auto x:r) if (x!=i) t.pb(x);
			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;
			sort(t.begin(),t.end());
			int h;
			if (mp.find(t)==mp.end()){
				assert(q<30000);
				mp[t]=ask(t);
			}
			h=mp[t];
			if (h<=ans) continue;
			s=j;
			in[s]=1;
			in[i]=0;
			swap(r,t);
			ans=h;
			break;
		}
		know[i]=1;
		know[s]=1;
	}	
	return r;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 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 1 ms 348 KB correct
13 Correct 1 ms 348 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 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 1 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 23 ms 1084 KB correct
15 Correct 15 ms 860 KB correct
16 Correct 20 ms 892 KB correct
17 Correct 20 ms 1628 KB correct
18 Correct 11 ms 860 KB correct
19 Correct 19 ms 1884 KB correct
20 Correct 14 ms 1368 KB correct
21 Correct 14 ms 1108 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 0 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 344 KB correct
27 Correct 0 ms 348 KB correct
28 Correct 0 ms 344 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

# Verdict Execution time Memory 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 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 1 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 23 ms 1084 KB correct
15 Correct 15 ms 860 KB correct
16 Correct 20 ms 892 KB correct
17 Correct 20 ms 1628 KB correct
18 Correct 11 ms 860 KB correct
19 Correct 19 ms 1884 KB correct
20 Correct 14 ms 1368 KB correct
21 Correct 14 ms 1108 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 0 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 344 KB correct
27 Correct 0 ms 348 KB correct
28 Correct 0 ms 344 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 2047 ms 31932 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 348 KB correct
3 Incorrect 1917 ms 21580 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory 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 0 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 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 1 ms 348 KB correct
13 Correct 1 ms 348 KB correct
14 Correct 23 ms 1084 KB correct
15 Correct 15 ms 860 KB correct
16 Correct 20 ms 892 KB correct
17 Correct 20 ms 1628 KB correct
18 Correct 11 ms 860 KB correct
19 Correct 19 ms 1884 KB correct
20 Correct 14 ms 1368 KB correct
21 Correct 14 ms 1108 KB correct
22 Correct 1 ms 348 KB correct
23 Correct 0 ms 348 KB correct
24 Correct 0 ms 348 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 0 ms 344 KB correct
27 Correct 0 ms 348 KB correct
28 Correct 0 ms 344 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 2047 ms 31932 KB WA in grader: NO
35 Halted 0 ms 0 KB -