Submission #1075709

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075709		Abito	Simurgh (IOI17_simurgh)	C++17	13 / 100	3067 ms	436 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int par[30],sz[30];
int getpar(int x){
	if (x==par[x]) return x;
	return par[x]=getpar(par[x]);
}
void link(int x,int y){
	x=getpar(x);
	y=getpar(y);
	if (x==y) return;
	if (sz[x]>sz[y]) swap(x,y);
	sz[y]+=sz[x];
	par[x]=y;
	return;
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	int m=u.size();
	for (int mask=0;mask<(1<<m);mask++){
		if (__builtin_popcount(mask)!=n-1) continue;
		for (int i=0;i<n;i++) par[i]=i,sz[i]=1;
		for (int i=0;i<m;i++){
			if (mask&(1<<i)) link(u[i],v[i]);
		}
		if (sz[getpar(0)]!=n) continue;
		vector<int> r;
		for (int i=0;i<m;i++){
			if (mask&(1<<i)) r.pb(i);
		}
		int x=count_common_roads(r);
		if (x==n-1) return r;
	}
}

Compilation message (stderr)

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
   35 | }
      | ^

• Subtask 1: 13 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30