제출 #1083306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083306		Math4Life2020	Simurgh (IOI17_simurgh)	C++17	13 / 100	1577 ms	1048576 KiB

simurgh

#include <bits/stdc++.h>
#include <cstdio>
using namespace std;

#include "simurgh.h"

using ll = long long; using pii = pair<ll,ll>;

vector<int> find_roads(int N, vector<int> u, vector<int> v) {
	ll M = u.size();
	vector<vector<int>> combs = {{-1}};
	for (ll i=0;i<(N-1);i++) {
		vector<vector<int>> combs2;
		for (vector<int> v1: combs) {
			for (ll e=(v1[v1.size()-1]+1);e<M;e++) {
				vector<int> v2 = v1; v2.push_back(e);
				combs2.push_back(v2);
			}
		}
		combs = combs2;
	}
	for (vector<int> v1: combs) {
		vector<int> v0;
		for (ll i=1;i<N;i++) {
			v0.push_back(v1[i]);
		}
		ll f[N];
		for (ll i=0;i<N;i++) {
			f[i]=i;
		}
		bool valid = 1;
		for (ll x: v0) {
			ll a = u[x]; ll b=v[x];
			while (a != f[a]) {
				a=f[a];
			}
			while (b != f[b]) {
				b=f[b];
			}
			if (a==b) {
				valid = 0; break;
			} else {
				f[a]=b;
			}
		}
		if (valid) {
			ll a0 = count_common_roads(v0);
			if (a0 == (N-1)) {
				return v0;
			}
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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

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