제출 #69887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69887		top34051	Simurgh (IOI17_simurgh)	C++17	30 / 100	174 ms	2892 KiB

simurgh

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

#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 500 + 5;
const int maxm = 250000 + 5;

int n,m;

pii e[maxm];
int head[maxn];
int act[maxm], pos[maxm];
vector<int> tree;

vector<pii> way[maxn];
int par[maxn], come[maxn];

vector<int> path;
int rec[maxm];

int res[maxm];

int ask() {
    return count_common_roads(tree);
}

int findhead(int x) {
	if(x==head[x]) return x;
	return head[x] = findhead(head[x]);
}

void dfs(int u, int last, int id) {
	par[u] = last; come[u] = id;
	for(auto t : way[u]) {
		int v = t.X, tid = t.Y;
		if(v==last) continue;
		dfs(v,u,tid);
	}
}

void prep(int x, int y) {
	dfs(x,-1,0);
	path.clear();
	for(int i=y;i!=x;i=par[i]) {
//		printf("%d %d : %d\n",par[i],i,come[i]);
		path.push_back(come[i]);
	}
}

vector<int> find_roads(int N, vector<int> U, vector<int> V) {
	n = N; m = U.size();
	for(int i=0;i<n;i++) head[i] = i;
	for(int i=0;i<m;i++) {
		int u = U[i], v = V[i];
		e[i] = {u,v};
		pos[i] = -1;
		if(findhead(u)!=findhead(v)) {
			head[findhead(u)] = findhead(v);
			pos[i] = tree.size();
			tree.push_back(i);
			res[i] = 1;
			way[u].push_back({v,i});
			way[v].push_back({u,i});
		}
	}

	int ori = ask();

//	printf("ori = %d\n",ori);

	for(int i=0;i<m;i++) {
//        printf("i = %d (%d)\n",i,pos[i]);
		if(pos[i]!=-1) continue;
//		printf("edge %d : \n",i);
		int u = e[i].X, v = e[i].Y;
		prep(u,v);
		for(auto id : path) {
			tree[pos[id]] = i;
			rec[id] = ask();
			tree[pos[id]] = id;
//			printf("\tcut %d = %d\n",id,rec[id]);
		}

		res[i] = 0;
		for(auto id : path) {
			if(rec[id]-ori == 1) res[i] = 1;
		}
//		printf("res %d = %d\n",i,res[i]);

		for(auto id : path) res[id] = ori + res[i] - rec[id];
	}

	vector<int> vec;
	for(int i=0;i<m;i++) if(res[i]) vec.push_back(i);
//	for(auto t : vec) printf("%d ",t);
	return vec;
}

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