Submission #1028901

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028901		parsadox2	Simurgh (IOI17_simurgh)	C++17	13 / 100	61 ms	4160 KiB

simurgh

#include "simurgh.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 5e2 + 10;

struct EDGE{
	int to , id;
};

int n , m , col[N];
vector <EDGE> adj[N];
vector <int> r;
bool marked[N] , dead[N] , vis[N] , is_cand[N];

int Find_good(int v)
{
	marked[v] = true;
	for(auto u : adj[v])  if(!marked[u.to])
		return Find_good(u.to);
	return v;
}

void Dfs(int v)
{
	marked[v] = true;
	for(auto u : adj[v])  if(!marked[u.to] && !dead[u.to])
	{
		r.push_back(u.id);
		col[u.to] = col[v];
		Dfs(u.to);
	}
}

vector<int> find_roads(int nn, vector<int> u, vector<int> v) {
	n = nn;
	m = u.size();
	for(int i = 0 ; i < m ; i++)
	{
		adj[u[i]].push_back({v[i] , i});
		adj[v[i]].push_back({u[i] , i});
	}
	int star = Find_good(0);
	vector <int> cand;
	dead[star] = true;
	is_cand[star] = true;
	cand.push_back(star);
	vector <int> cor;
	//cout << "STAR " << star << endl;
	while(!cand.empty())
	{
		int mx = 0;
		vector <EDGE> add;
		vector <int> rem;
		r = cor;
		for(int i = 0 ; i < n ; i++)
		{
			marked[i] = false;
			vis[i] = false;
		}
		int coco = 0;
		for(int i = 0 ; i < n ; i++)  if(!dead[i] && !marked[i])
		{
			col[i] = coco;
			Dfs(i);
			coco++;
			////cout << i << endl;
		}
		////cout << "WTF " << endl;
		for(int asd = 0 ; asd < coco ; asd++)
		{
			vector <EDGE> fake;
			for(int i = 0 ; i < coco ; i++)
				vis[i] = false;
			for(auto v : cand)  for(auto u : adj[v])  if(!dead[u.to] && col[u.to] != asd && !vis[col[u.to]])
			{
				r.push_back(u.id);
				vis[col[u.to]] = true;
			}
			for(auto v : cand)  for(auto u : adj[v])  if(!dead[u.to] && col[u.to] == asd)
			{
				r.push_back(u.id);
				//for(auto i : r)
					//cout << i << " ";
				int now = count_common_roads(r);
				//cout << " ? " << endl;
				//cout << now << endl;
				if(now > mx)
				{
					mx = now;
					fake.clear();
				}
				if(now == mx)
					fake.push_back(u);
				r.pop_back();
			}
			for(int i = 0 ; i < coco - 1 ; i++)
				r.pop_back();
			for(auto u : fake)
				add.push_back(u);
		}
		cand.clear();
		for(auto u : add)
		{
			cor.push_back(u.id);
			dead[u.to] = true;
			cand.push_back(u.to);
		}
	}
	return cor;
}

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