제출 #814840

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
814840		Dan4Life	Simurgh (IOI17_simurgh)	C++17	0 / 100	1 ms	368 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)5e2+10;
int m, p[mxN], sz[mxN];
bool vis[100000];
void init(int n){ for(int i = 0; i <= n; i++) p[i]=i,sz[i]=1;}
int findSet(int i){return i==p[i]?i:p[i]=findSet(p[i]);}
bool isSameSet(int i, int j){return findSet(i)==findSet(j);}
void unionSet(int i, int j){
	int x = findSet(i), y = findSet(j);
	if(x==y) return;
	if(sz[x]<sz[y]) swap(x,y);
	p[y] = x; sz[x]+=sz[y];
}

vi find_roads(int n, vi u, vi v) {
	vi ans; m = sz(u); init(n);
	for(int i = 0; i < m; i++){
		if(vis[i]==1) continue;
		vector<int> v, w; v.clear(); w.clear();
		for(int j = 0; j < m; j++){
			if(isSameSet(u[j],v[j])) continue;
			int x = findSet(u[i]), y = findSet(v[i]);
			if(x>y) swap(x,y);
			int x2 = findSet(u[j]), y2 = findSet(v[j]);
			if(x2>y2) swap(x2,y2);
			if(x==x2 and y==y2) v.pb(j);
			else unionSet(u[j],v[j]), w.pb(j);
		}
		for(auto u : v) vis[u]=1;
		pair<int,int> mx = {0,0};
		for(int i = 0; i < sz(v); i++){
			w.pb(v[i]); mx = max(mx, {count_common_roads(w),i}); w.pop_back();
		}
		ans.pb(mx.second);
	}
	return ans;
}

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