oj.uz

답안 #742587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742587 2023-05-16T14:26:57 Z RushB 다리 (APIO19_bridges) C++17
100 / 100
 2265 ms 106656 KB 
#include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); i++) 
using namespace std;
const long long INF = 1ll << 60;
const int N = 1e5 + 5;

int dpr[N];
vector<array<int, 3>> undo;
int gpr(int x) { 
	while (dpr[x] >= 0) x = dpr[x];
	return x;
}
bool merge(int u, int v) {
	u = gpr(u), v = gpr(v);
	if (u == v) return false;
	if (dpr[u] < dpr[v]) swap(u, v); //v is bigger now
	undo.push_back({u, v, dpr[u]});
	dpr[v] += dpr[u];
	dpr[u] = v;
	return true;
}
void rollback() {
	const auto &a = undo.back();
	dpr[a[0]] = a[2];
	dpr[a[1]] -= a[2];
	undo.pop_back();
}

const int SQ = 1000;
const int SQ2 = N / SQ + 5;
int a[N], b[N], U[N], W[N], V[N], n, m, q, ans[N];
short t[N];

void solve() {
	//t = 1 CHANGE
	//t = 2 SOAL
	FOR(i, 0, SQ2) {
		int L = i * SQ, R = min(q, (i + 1) * SQ);
		if (L >= q) break;

		memset(dpr, -1, sizeof dpr);

		bitset<N> change = 0, mark = 0;
		vector<int> Q, E, NE;

		FOR(j, L, R) {
			if (t[j] == 1) change[a[j]] = true;
			else Q.push_back(j);
		}
		FOR(j, 0, m) (change[j] ? NE : E).push_back(j);

		sort(E.rbegin(), E.rend(), [&](const int x, const int y) {return W[x] < W[y];});
		sort(Q.begin(), Q.end(), [&](const int x, const int y) {return b[x] < b[y];});

		for (auto qid: Q) {
			while (E.size() && W[E.back()] <= b[qid]) {
				merge(U[E.back()], V[E.back()]);
				E.pop_back();
			}
			int cnt = 0;
			for (int j = qid; j >= L; j--) if (t[j] == 1 && !mark[a[j]]) {
				if (b[j] <= b[qid]) {
					cnt += merge(U[a[j]], V[a[j]]);
					mark[a[j]] = true;
				}
				mark[a[j]] = true;
			}
			for (auto e: NE) if (!mark[e]) {
				mark[e] = true;
				if (W[e] <= b[qid]) {
					cnt += merge(U[e], V[e]);
					mark[e] = true;
				}
			}
			ans[qid] = dpr[gpr(a[qid])];

			while (cnt--) rollback();

			FOR(j, L, qid) mark[a[j]] = false;
			for (auto e: NE) mark[e] = false;
		}
		FOR(j, L, R) if (t[j] == 1) W[a[j]] = b[j];
	}
	FOR(i, 0, q) if (t[i] == 2) cout << -ans[i] << '\n';
}

signed main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	FOR(i, 0, m) {
		cin >> U[i] >> V[i] >> W[i];
		U[i]--, V[i]--;
		W[i] = -W[i];
	}
	cin >> q;
	FOR(i, 0, q) {
		cin >> t[i] >> a[i] >> b[i];
		a[i]--;
		b[i] = -b[i];
	}
	solve();

	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 724 KB Output is correct
3 Correct 46 ms 900 KB Output is correct
4 Correct 21 ms 892 KB Output is correct
5 Correct 28 ms 884 KB Output is correct
6 Correct 26 ms 896 KB Output is correct
7 Correct 30 ms 896 KB Output is correct
8 Correct 30 ms 900 KB Output is correct
9 Correct 28 ms 900 KB Output is correct
10 Correct 30 ms 884 KB Output is correct
11 Correct 29 ms 892 KB Output is correct
12 Correct 29 ms 852 KB Output is correct
13 Correct 36 ms 852 KB Output is correct
14 Correct 35 ms 920 KB Output is correct
15 Correct 30 ms 916 KB Output is correct
16 Correct 28 ms 896 KB Output is correct
17 Correct 28 ms 916 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1388 ms 101672 KB Output is correct
2 Correct 1390 ms 101920 KB Output is correct
3 Correct 1410 ms 101608 KB Output is correct
4 Correct 1420 ms 101592 KB Output is correct
5 Correct 1458 ms 101840 KB Output is correct
6 Correct 2076 ms 101804 KB Output is correct
7 Correct 1970 ms 101744 KB Output is correct
8 Correct 1962 ms 101896 KB Output is correct
9 Correct 210 ms 2264 KB Output is correct
10 Correct 1166 ms 101752 KB Output is correct
11 Correct 1126 ms 101588 KB Output is correct
12 Correct 1322 ms 101488 KB Output is correct
13 Correct 1183 ms 101620 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1170 ms 51952 KB Output is correct
2 Correct 880 ms 14532 KB Output is correct
3 Correct 1254 ms 52196 KB Output is correct
4 Correct 1144 ms 51944 KB Output is correct
5 Correct 207 ms 2272 KB Output is correct
6 Correct 1238 ms 51956 KB Output is correct
7 Correct 1109 ms 52016 KB Output is correct
8 Correct 1008 ms 52000 KB Output is correct
9 Correct 871 ms 52056 KB Output is correct
10 Correct 815 ms 51904 KB Output is correct
11 Correct 736 ms 52036 KB Output is correct
12 Correct 656 ms 51968 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1587 ms 102900 KB Output is correct
2 Correct 206 ms 3568 KB Output is correct
3 Correct 165 ms 4920 KB Output is correct
4 Correct 91 ms 4968 KB Output is correct
5 Correct 921 ms 104928 KB Output is correct
6 Correct 1625 ms 106480 KB Output is correct
7 Correct 916 ms 104900 KB Output is correct
8 Correct 887 ms 104404 KB Output is correct
9 Correct 871 ms 104440 KB Output is correct
10 Correct 877 ms 104124 KB Output is correct
11 Correct 1236 ms 105468 KB Output is correct
12 Correct 1255 ms 105528 KB Output is correct
13 Correct 1272 ms 105320 KB Output is correct
14 Correct 841 ms 105008 KB Output is correct
15 Correct 871 ms 104900 KB Output is correct
16 Correct 1651 ms 106368 KB Output is correct
17 Correct 1655 ms 106620 KB Output is correct
18 Correct 1598 ms 106616 KB Output is correct
19 Correct 1656 ms 106596 KB Output is correct
20 Correct 1407 ms 105588 KB Output is correct
21 Correct 1427 ms 105512 KB Output is correct
22 Correct 1644 ms 106100 KB Output is correct
23 Correct 1000 ms 104572 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1388 ms 101672 KB Output is correct
2 Correct 1390 ms 101920 KB Output is correct
3 Correct 1410 ms 101608 KB Output is correct
4 Correct 1420 ms 101592 KB Output is correct
5 Correct 1458 ms 101840 KB Output is correct
6 Correct 2076 ms 101804 KB Output is correct
7 Correct 1970 ms 101744 KB Output is correct
8 Correct 1962 ms 101896 KB Output is correct
9 Correct 210 ms 2264 KB Output is correct
10 Correct 1166 ms 101752 KB Output is correct
11 Correct 1126 ms 101588 KB Output is correct
12 Correct 1322 ms 101488 KB Output is correct
13 Correct 1183 ms 101620 KB Output is correct
14 Correct 1170 ms 51952 KB Output is correct
15 Correct 880 ms 14532 KB Output is correct
16 Correct 1254 ms 52196 KB Output is correct
17 Correct 1144 ms 51944 KB Output is correct
18 Correct 207 ms 2272 KB Output is correct
19 Correct 1238 ms 51956 KB Output is correct
20 Correct 1109 ms 52016 KB Output is correct
21 Correct 1008 ms 52000 KB Output is correct
22 Correct 871 ms 52056 KB Output is correct
23 Correct 815 ms 51904 KB Output is correct
24 Correct 736 ms 52036 KB Output is correct
25 Correct 656 ms 51968 KB Output is correct
26 Correct 1436 ms 101752 KB Output is correct
27 Correct 1671 ms 101624 KB Output is correct
28 Correct 1477 ms 101676 KB Output is correct
29 Correct 1171 ms 101732 KB Output is correct
30 Correct 1636 ms 101860 KB Output is correct
31 Correct 1658 ms 101636 KB Output is correct
32 Correct 1669 ms 101772 KB Output is correct
33 Correct 1419 ms 101720 KB Output is correct
34 Correct 1457 ms 101624 KB Output is correct
35 Correct 1428 ms 101796 KB Output is correct
36 Correct 1195 ms 101812 KB Output is correct
37 Correct 1190 ms 101656 KB Output is correct
38 Correct 1191 ms 101748 KB Output is correct
39 Correct 1031 ms 101604 KB Output is correct
40 Correct 1022 ms 101700 KB Output is correct
41 Correct 1012 ms 101672 KB Output is correct
42 Correct 876 ms 101764 KB Output is correct
43 Correct 870 ms 101704 KB Output is correct
44 Correct 890 ms 101768 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 724 KB Output is correct
3 Correct 46 ms 900 KB Output is correct
4 Correct 21 ms 892 KB Output is correct
5 Correct 28 ms 884 KB Output is correct
6 Correct 26 ms 896 KB Output is correct
7 Correct 30 ms 896 KB Output is correct
8 Correct 30 ms 900 KB Output is correct
9 Correct 28 ms 900 KB Output is correct
10 Correct 30 ms 884 KB Output is correct
11 Correct 29 ms 892 KB Output is correct
12 Correct 29 ms 852 KB Output is correct
13 Correct 36 ms 852 KB Output is correct
14 Correct 35 ms 920 KB Output is correct
15 Correct 30 ms 916 KB Output is correct
16 Correct 28 ms 896 KB Output is correct
17 Correct 28 ms 916 KB Output is correct
18 Correct 1388 ms 101672 KB Output is correct
19 Correct 1390 ms 101920 KB Output is correct
20 Correct 1410 ms 101608 KB Output is correct
21 Correct 1420 ms 101592 KB Output is correct
22 Correct 1458 ms 101840 KB Output is correct
23 Correct 2076 ms 101804 KB Output is correct
24 Correct 1970 ms 101744 KB Output is correct
25 Correct 1962 ms 101896 KB Output is correct
26 Correct 210 ms 2264 KB Output is correct
27 Correct 1166 ms 101752 KB Output is correct
28 Correct 1126 ms 101588 KB Output is correct
29 Correct 1322 ms 101488 KB Output is correct
30 Correct 1183 ms 101620 KB Output is correct
31 Correct 1170 ms 51952 KB Output is correct
32 Correct 880 ms 14532 KB Output is correct
33 Correct 1254 ms 52196 KB Output is correct
34 Correct 1144 ms 51944 KB Output is correct
35 Correct 207 ms 2272 KB Output is correct
36 Correct 1238 ms 51956 KB Output is correct
37 Correct 1109 ms 52016 KB Output is correct
38 Correct 1008 ms 52000 KB Output is correct
39 Correct 871 ms 52056 KB Output is correct
40 Correct 815 ms 51904 KB Output is correct
41 Correct 736 ms 52036 KB Output is correct
42 Correct 656 ms 51968 KB Output is correct
43 Correct 1587 ms 102900 KB Output is correct
44 Correct 206 ms 3568 KB Output is correct
45 Correct 165 ms 4920 KB Output is correct
46 Correct 91 ms 4968 KB Output is correct
47 Correct 921 ms 104928 KB Output is correct
48 Correct 1625 ms 106480 KB Output is correct
49 Correct 916 ms 104900 KB Output is correct
50 Correct 887 ms 104404 KB Output is correct
51 Correct 871 ms 104440 KB Output is correct
52 Correct 877 ms 104124 KB Output is correct
53 Correct 1236 ms 105468 KB Output is correct
54 Correct 1255 ms 105528 KB Output is correct
55 Correct 1272 ms 105320 KB Output is correct
56 Correct 841 ms 105008 KB Output is correct
57 Correct 871 ms 104900 KB Output is correct
58 Correct 1651 ms 106368 KB Output is correct
59 Correct 1655 ms 106620 KB Output is correct
60 Correct 1598 ms 106616 KB Output is correct
61 Correct 1656 ms 106596 KB Output is correct
62 Correct 1407 ms 105588 KB Output is correct
63 Correct 1427 ms 105512 KB Output is correct
64 Correct 1644 ms 106100 KB Output is correct
65 Correct 1000 ms 104572 KB Output is correct
66 Correct 1436 ms 101752 KB Output is correct
67 Correct 1671 ms 101624 KB Output is correct
68 Correct 1477 ms 101676 KB Output is correct
69 Correct 1171 ms 101732 KB Output is correct
70 Correct 1636 ms 101860 KB Output is correct
71 Correct 1658 ms 101636 KB Output is correct
72 Correct 1669 ms 101772 KB Output is correct
73 Correct 1419 ms 101720 KB Output is correct
74 Correct 1457 ms 101624 KB Output is correct
75 Correct 1428 ms 101796 KB Output is correct
76 Correct 1195 ms 101812 KB Output is correct
77 Correct 1190 ms 101656 KB Output is correct
78 Correct 1191 ms 101748 KB Output is correct
79 Correct 1031 ms 101604 KB Output is correct
80 Correct 1022 ms 101700 KB Output is correct
81 Correct 1012 ms 101672 KB Output is correct
82 Correct 876 ms 101764 KB Output is correct
83 Correct 870 ms 101704 KB Output is correct
84 Correct 890 ms 101768 KB Output is correct
85 Correct 2070 ms 106384 KB Output is correct
86 Correct 199 ms 4888 KB Output is correct
87 Correct 122 ms 4996 KB Output is correct
88 Correct 1336 ms 104912 KB Output is correct
89 Correct 2060 ms 106652 KB Output is correct
90 Correct 1367 ms 104844 KB Output is correct
91 Correct 1509 ms 104332 KB Output is correct
92 Correct 1490 ms 104464 KB Output is correct
93 Correct 2011 ms 104300 KB Output is correct
94 Correct 1848 ms 105520 KB Output is correct
95 Correct 1814 ms 105704 KB Output is correct
96 Correct 2084 ms 105708 KB Output is correct
97 Correct 1163 ms 104988 KB Output is correct
98 Correct 1018 ms 104960 KB Output is correct
99 Correct 2116 ms 106384 KB Output is correct
100 Correct 2177 ms 106460 KB Output is correct
101 Correct 2192 ms 106656 KB Output is correct
102 Correct 2169 ms 106560 KB Output is correct
103 Correct 2265 ms 105588 KB Output is correct
104 Correct 2254 ms 105516 KB Output is correct
105 Correct 1774 ms 105680 KB Output is correct
106 Correct 1402 ms 105484 KB Output is correct
107 Correct 1704 ms 105588 KB Output is correct
108 Correct 2130 ms 106292 KB Output is correct
109 Correct 1571 ms 104584 KB Output is correct