Submission #774560

#	Time	Username	Problem	Language	Result	Execution time	Memory
774560		NK_	Traffic (CEOI11_tra)	C++17	0 / 100	449 ms	50980 KiB

tra

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define sz(x) int(x.size())

#define pb push_back

using pi = pair<int, int>;
template<class T> using V = vector<T>;

const int INF = 1e9 + 10;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M, A, B; cin >> N >> M >> A >> B;

	V<pi> P(N); for(auto& x : P) cin >> x.f >> x.s;

	V<V<int>> adj(N);

	for(int i = 0; i < M; i++) {
		int u, v, d; cin >> u >> v >> d; --u, --v, --d;

		adj[u].pb(v);
		if (d) adj[v].pb(u);
	}

	V<int> low(N), disc(N), comp(N, -1), st, comps;

	int t = 0;
	function<int(int)> dfs = [&](int u) {
		st.pb(u);
		low[u] = disc[u] = ++t;

		for(auto& v : adj[u]) {
			if (comp[v] == -1) low[u] = min(low[u], disc[v] ?: dfs(v));
		}

		if (low[u] == disc[u]) {
			comps.pb(u);
			for(int v = -1; v != u; ) comp[v = st.back()] = u, st.pop_back();
		}	

		return low[u];
	};

	for(int i = 0; i < N; i++) if (!disc[i]) dfs(i);
	// for(int i = 0; i < N; i++) {
		// cout << i << " " << comp[i] << endl;
	// }
	// for(auto x : comps) cout << x << " ";
	// cout << endl;
	// reverse(begin(comps), end(comps));


	V<V<int>> C(N); V<int> L(N, INF), R(N, -INF), E, W; 
	for(int i = 0; i < N; i++) {
		C[comp[i]].pb(i);
		if (P[i].f == 0) W.pb(i);
		if (P[i].f == A) E.pb(i);
	}

	sort(begin(W), end(W), [&](int x, int y) {
		return P[x].s > P[y].s;
	});

	sort(begin(E), end(E), [&](int x, int y) {
		return P[x].s > P[y].s;
	});

	for(int i = 0; i < sz(E); i++) {
		int e = E[i];
		L[comp[e]] = min(L[comp[e]], i);
		R[comp[e]] = max(R[comp[e]], i);
	}

	for(auto c : comps) {
		for(auto u : C[c]) for(auto v : adj[u]) {
			int cv = comp[v];
			L[c] = min(L[c], L[cv]);
			R[c] = max(R[c], R[cv]);
		}
		// cout << "C: " << c << " " << L[c] << " " << R[c] << endl;
	}
	
	for(auto u : W) cout << max(0, R[comp[u]] - L[comp[u]] + 1) << nl;

    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9