Submission #705155

#	Time	Username	Problem	Language	Result	Execution time	Memory
705155		Abrar_Al_Samit	Simurgh (IOI17_simurgh)	C++17	30 / 100	123 ms	4020 KiB

simurgh

#include<bits/stdc++.h>
#include "simurgh.h"

using namespace std;

const int nax = 500;
vector<pair<int,int>>g[nax];
int m;
vector<int>stk;
bool vis[nax];
int sz[nax], par[nax];
vector<int>grp[nax];
int where[nax*nax];

int find(int v) {
	return par[v] = (v==par[v]) ? v : find(par[v]);
}
void unite(int u, int v) {
	u = find(u), v = find(v);
	if(sz[u]<sz[v]) swap(u, v);
	sz[u] += sz[v];
	par[v] = u;
}
void dfs(int v, int ban) {
	vis[v] = 1;
	for(auto &[c, e] : g[v]) if(c!=ban && !vis[c]) {
		stk.push_back(e);
		unite(v, c);
		dfs(c, ban);
	}
}
vector<int>find_roads(int n, vector<int>u, vector<int>v) {
	m = u.size();

	for(int i=0; i<m; ++i) {
		g[u[i]].emplace_back(v[i], i);
		g[v[i]].emplace_back(u[i], i);
	}

	vector<int>royal;
	for(int ban=0; ban<n; ++ban) {
		stk.clear();
		for(int i=0; i<n; ++i) {
			vis[i] = 0;
			sz[i] = 1, par[i] = i;
			grp[i].clear();
		}
		for(int i=0; i<n; ++i) {
			if(i!=ban && !vis[i]) {
				dfs(i, ban);
			}
		}


		for(auto &[c, e] : g[ban]) {
			grp[find(c)].push_back(e);
		}

		for(int i=0; i<n; ++i) if(!grp[i].empty()) {
			where[grp[i][0]] = stk.size();
			stk.push_back(grp[i][0]);
		}
		for(int i=0; i<n; ++i) if(!grp[i].empty()) {
			vector<int>res;
			int pos = where[grp[i][0]];
			for(int x : grp[i]) {
				stk[pos] = x;

				res.push_back(count_common_roads(stk));
			}
			int mx = *max_element(res.begin(), res.end());
			for(int j=0; j<grp[i].size(); ++j) {
				if(res[j]==mx) {
					royal.push_back(grp[i][j]);
				}
			}			
		}
	}
	sort(royal.begin(), royal.end());
	royal.resize(unique(royal.begin(), royal.end())-royal.begin());

	// for(int x : royal) cerr<<x<<' ';
	// 	cerr<<'\n';
	return royal;
}

Compilation message (stderr)

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:72:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    for(int j=0; j<grp[i].size(); ++j) {
      |                 ~^~~~~~~~~~~~~~

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