Submission #981525

#	Time	Username	Problem	Language	Result	Execution time	Memory
981525		c2zi6	Game (APIO22_game)	C++17	30 / 100	4014 ms	2808 KiB

game

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "game.h"

int n, k;
VVI gp;
VVI trans;

void init(int N, int K) {n = N, k = K;
	trans = gp = VVI(n);
	replr(i, 0, k-2) {
		gp[i].pb(i+1);
		trans[i+1].pb(i);
	}
}

VI order;
VI vis;
void dfs1(int u) {
	vis[u] = true;
	for (int v : gp[u]) if (!vis[v]) dfs1(v);
	order.pb(u);
}
VI group;
void dfs2(int u, int g) {
	group[u] = g;
	vis[u] = true;
	for (int v : trans[u]) if (!vis[v]) dfs2(v, g);
}

int add_teleporter(int u, int v) {
	if (u == v) {
		if (u < k) return 1;
		return 0;
	}

	gp[u].pb(v);
	trans[v].pb(u);

	order.clear();
	vis = VI(n);
	rep(u, n) if (!vis[u]) dfs1(u);
	reverse(all(order));
	vis = VI(n);
	int g = 0;
	group = VI(n);
	for (int u : order) if (!vis[u]) dfs2(u, g++);
	/* rep(u, n) { */
	/* 	cout << "NODE " << u << " HAS GROUP " << group[u] << endl; */
	/* } */
	/* cout << endl; */

	VI ka(g);
	rep(u, n) ka[group[u]]++;
	rep(u, k) if (ka[group[u]] > 1) return true;
	return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 0 / 30
• Subtask 5: 0 / 40