제출 #1079047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079047		Gray	Simurgh (IOI17_simurgh)	C++17	13 / 100	15 ms	440 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define ff first
#define ss second
#define ln "\n"
#define ld long double

vector<pair<ll, ll>> e;
vector<vector<ll>> A;
vector<ll> checka;
void dfs(ll u, vector<bool> &vis, ll mask){
	vis[u]=1;
	for (auto i:A[u]){
		if (mask&(1<<i)){
			ll v = e[i].ff^e[i].ss^u;
			if (vis[v]) continue;
			dfs(v, vis, mask);
		}
	}
}
bool check(ll mask, ll n, ll m){
	checka.clear();
	vector<bool> vis(n);
	dfs(0, vis, mask);
	for (ll i=0; i<n; i++) if (!vis[i]) return 0;
	for (ll i=0; i<m; i++){
		if (mask&(1<<i)) checka.push_back(i);
	}
	return 1;
}

// Slow version
vector<int> find_roads(int _n, vector<int> u, vector<int> v) {
	int n=_n, m=u.size();
	e.resize(m); A.clear(); A.resize(n);
	for (ll i=0; i<m; i++){
		e[i]={u[i], v[i]};
		A[u[i]].push_back(i); A[v[i]].push_back(i);
	}
	vector<ll> ans;
	// cout << (1ll<<21) << ln;
	for (ll i=0; i<(1ll<<m); i++){
		// cout << i << "-";
		// cout << i << "-" << (1ll<<m) << ln;
		if (__builtin_popcount(i)==n-1){
			// cout << i << ": ";
			if (check(i, n, m)) {
				// cout << "Check: ";
				// for (auto ch:checka) cout << ch << " ";
				// cout << ln;
				ll ret = count_common_roads(checka);
				// cout << "FOUND: " << ": ";
				if (ret==n-1){
					ans=checka; break;
				}
			}
			// cout << ln;
		}
	}
	// assert(ans.size());
	return ans;
}

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