Submission #274706

#	Time	Username	Problem	Language	Result	Execution time	Memory
274706		junseo	Simurgh (IOI17_simurgh)	C++17	70 / 100	419 ms	9608 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x);
#define rmax(r, x) r = max(r, x);
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int maxn = 505;
const int maxm = maxn * maxn;

int n, m, K, Q;
pii pa[maxn];
bool visited[maxn], used[maxm];
int gold[maxm], k[maxm], h[maxn];
vector<pii> edge, adj[maxn], ch[maxn], bk[maxn], rbk[maxn];
vector<int> dfs_tree;

int count_common_roads(const vector<int>& r);

int count_k(vector<int> v, vector<pii> rep) {
	++Q;
	// if(Q > 8000)	while(true);
	vector<int> q;
	for(auto [add, sub] : rep)	q.eb(add);
	int i = 0, j = 0;
	while(i < v.size()) {
		if(j < rep.size() && v[i] == rep[j].se) {
			++i;
			++j;
			continue;
		}
		q.eb(v[i++]);
	}
	return count_common_roads(q);
}

void dfs(int u, int p) {
	visited[u] = true;
	for(auto [v, i] : adj[u]) if(v != p && !used[i]) {
		used[i] = true;
		if(visited[v]) {
			bk[u].eb(i, ch[v].back().se);
			rbk[v].eb(u, i);
			continue;
		}
		dfs_tree.eb(i);
		ch[u].eb(v, i);
		pa[v] = {u, i};
		h[v] = h[u] + 1;
		dfs(v, u);
	}
}

void solve_tree(int u) {
	sort(all(rbk[u]), [&](pii a, pii b) { return h[a.fi] > h[b.fi]; });
	for(auto [v, i] : rbk[u]) {
		vector<int> tedge;
		bool all = true, no = true;
		while(v != u) {
			tedge.eb(pa[v].se);
			if(gold[tedge.back()] != -1)	all = false;
			else							no = false;
			v = pa[v].fi;
		}
		if(no)	continue;

		if(all) {
			int nk = n, xk = 0;
			for(auto j : tedge) {
				vector<pii> dum;	dum.eb(i, j);
				k[j] = count_k(dfs_tree, dum);
				rmin(nk, k[j]);
				rmax(xk, k[j]);
			}
			if(nk != xk) {
				gold[i] = nk - (K - 1);
				for(auto j : tedge)		gold[j] = (nk == k[j]);
			}
			else {
				if(nk == K - 1)	{
					for(auto j : tedge)	gold[j] = true;
					gold[i] = false;
				}
				else	for(auto j : tedge)	gold[j] = false;
			}
		}
		else {
			for(auto j : tedge) if(gold[j] != -1) {
				vector<pii> dum;	dum.eb(i, j);
				gold[i] = count_k(dfs_tree, dum) - K + gold[j];
				break;
			}
			for(auto j : tedge) if(gold[j] == -1) {
				vector<pii> dum;	dum.eb(i, j);
				gold[j] = K + gold[i] - count_k(dfs_tree, dum);
			}
		}
		
	}
	for(auto [v, i] : ch[u])	solve_tree(v);
}

void solve_back(vector<pii> e, int l, int r) {
	// count_k = K - S(gold[sub]) + S(gold[add])
	// S(gold[add]) = count_k - K + S(gold[sub])
	if(l > r)	return;
	// cout << l << ends << r << ends;
	int ret = count_k(dfs_tree, e) - K;
	for(auto [add, sub] : e)	ret += gold[sub];
	// cout << ret << endl;	

	if(ret == 0) {
		for(auto [add, sub] : e)	gold[add] = false;
		return;
	}
	if(ret == r - l + 1) {
		for(auto [add, sub] : e)	gold[add] = true;
		return;
	}
	int mid = l + r >> 1;
	vector<pii> t;
	for(int i = mid + 1; i <= r; ++i) {
		t.eb(e.back());
		e.pop_back();
	}
	reverse(all(t));
	solve_back(e, l, mid);
	solve_back(t, mid + 1, r);
}

std::vector<int> find_roads(int _n, std::vector<int> u, std::vector<int> v) {
	n = _n, m = u.size();
	for(int i = 0; i < m; ++i) {
		edge.eb(u[i], v[i]);
		adj[u[i]].eb(v[i], i);
		adj[v[i]].eb(u[i], i);
	}
	dfs(0, -1);
	sort(all(dfs_tree));
	// for(auto x : dfs_tree)	cout << x << ends;
	// cout << endl << endl;

	// for(int i = 0; i < n; ++i) {
	// 	// child
	// 	cout << i << endl;
	// 	cout << "ad: ";
	// 	for(auto [x, j] : adj[i])	cout << x << ends;
	// 	cout << endl << "ch: ";
	// 	for(auto [x, j] : ch[i])	cout << x << ends;
	// 	cout << endl << "bk: ";
	// 	for(auto [a, b] : bk[i])	cout << (edge[a].fi ^ edge[a].se ^ i) << ends;
	// 	cout << endl << "rb: ";
	// 	for(auto [x, j] : rbk[i])	cout << x << ends;
	// 	cout << endl << endl;
	// }

	K = count_k(dfs_tree, vector<pii>());
	// cout << "K: " << K << endl;

	memset(gold, -1, sizeof(gold));
	solve_tree(0);

	// for(int i = 0; i < m; ++i)	cout << (int)gold[i] << ends;
	// cout << endl;
	
	for(int i = 0; i < n; ++i) if(!bk[i].empty()) {
		// cout << "vertex: " << ends << i << endl;
		sort(all(bk[i]), [](pii a, pii b) { return a.se < b.se; });
		vector<pii> v;
		for(auto t : bk[i]) if(gold[t.fi] == -1) v.eb(t);
		if(!v.empty())	solve_back(v, 0, v.size() - 1);
		// cout << endl << endl;
	}

	vector<int> ans;
	for(int i = 0; i < m; ++i)	if(gold[i])	ans.eb(i);

	// for(int i = 0; i < m; ++i)	cout << gold[i] << ends;
	// cout << endl;
	return ans;
}

Compilation message (stderr)

simurgh.cpp: In function 'int count_k(std::vector<int>, std::vector<std::pair<int, int> >)':
simurgh.cpp:35:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  while(i < v.size()) {
      |        ~~^~~~~~~~~~
simurgh.cpp:36:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   if(j < rep.size() && v[i] == rep[j].se) {
      |      ~~^~~~~~~~~~~~
simurgh.cpp: In function 'void solve_back(std::vector<std::pair<int, int> >, int, int)':
simurgh.cpp:129:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  129 |  int mid = l + r >> 1;
      |            ~~^~~

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