Submission #774571

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
774571	2023-07-05T20:06:34 Z	NK_	Traffic (CEOI11_tra)	C++17	100 / 100	457 ms	65968 KB

// 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, INF), disc(N, 0), 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);



	V<V<int>> C(N); 
	for(int i = 0; i < N; i++) {
		C[comp[i]].pb(i);
	}

	V<int> found(N);
	function<void(int)> see = [&](int u) {
		found[u] = 1;
		for(auto v : adj[u]) if (!found[v]) see(v);
	};
	


	V<int> W;
	for(int i = 0; i < N; i++) {
		if (P[i].f == 0) {
			W.pb(i); see(i);
		}
	}

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



	V<int> E;
	for(int i = 0; i < N; i++) if (found[i]) {
		if (P[i].f == A) E.pb(i);
	}

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



	V<int> L(N, INF), R(N, -INF);
	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
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	340 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct

Subtask #4
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	724 KB	Output is correct
2	Correct	3 ms	1108 KB	Output is correct
3	Correct	4 ms	852 KB	Output is correct

Subtask #5
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	5116 KB	Output is correct
2	Correct	31 ms	9276 KB	Output is correct
3	Correct	17 ms	4468 KB	Output is correct

Subtask #6
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	6380 KB	Output is correct
2	Correct	49 ms	11288 KB	Output is correct
3	Correct	25 ms	8496 KB	Output is correct

Subtask #7
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	12972 KB	Output is correct
2	Correct	76 ms	19776 KB	Output is correct
3	Correct	92 ms	16788 KB	Output is correct

Subtask #8
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	12656 KB	Output is correct
2	Correct	69 ms	18244 KB	Output is correct
3	Correct	88 ms	17484 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	132 ms	22832 KB	Output is correct
2	Correct	189 ms	36924 KB	Output is correct
3	Correct	204 ms	32688 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	225 ms	38112 KB	Output is correct
2	Correct	279 ms	54168 KB	Output is correct
3	Correct	258 ms	37212 KB	Output is correct

Subtask #11
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	414 ms	37364 KB	Output is correct
2	Correct	300 ms	55120 KB	Output is correct
3	Correct	444 ms	53180 KB	Output is correct

Subtask #12
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	155 ms	37096 KB	Output is correct
2	Correct	347 ms	59868 KB	Output is correct
3	Correct	367 ms	50940 KB	Output is correct
4	Correct	457 ms	65968 KB	Output is correct

Submission #774571

Compilation message