oj.uz

답안 #722484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722484 2023-04-12T06:30:48 Z LittleCube 다리 (APIO19_bridges) C++17
100 / 100
 1881 ms 5048 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{

	const int B = 1200;
	int N, M, Q, u[100005], v[100005], d[100005], nd[100005], ans[100005], dsu[50005], rk[50005], vis[100005];
	vector<pii> ops;

	int find(int k)
	{
		return k == dsu[k] ? k : find(dsu[k]);
	}

	void merge(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y)
			return;
		if (rk[x] < rk[y])
			merge(y, x);
		else
		{
			dsu[y] = x;
			rk[x] += rk[y];
			ops.emplace_back(pii(x, y));
		}
	}

	void undo(int t)
	{
		while ((int)ops.size() > t)
		{
			auto [x, y] = ops.back();
			ops.pop_back();
			dsu[y] = y, rk[x] -= rk[y];
		}
	}

	void init()
	{
		ops.clear();
		ops.reserve(6 * M);
		for (int i = 1; i <= N; i++)
			dsu[i] = i, rk[i] = 1;
	}

	void mangorz()
	{
		ios::sync_with_stdio(0);
		cin.tie(0), cout.tie(0);
		cin >> N >> M;
		for (int i = 1; i <= M; i++)
			cin >> u[i] >> v[i] >> d[i];
		cin >> Q;
		for (int i = 1; i <= Q; i += B)
		{

			init();
			for (int j = 1; j <= M; j++)
				vis[j] = 0;
			// solve Q = [i, i + B - 1]
			vector<tuple<int, int, int>> change;
			vector<int> out;
			// d, i, 0: addedge
			// d, i, q: query i (ans[q])
			vector<tuple<int, int, int>> event;
			event.reserve(M + B);
			for (int j = i; j <= min(Q, i + B - 1); j++)
			{
				int t, a, b;
				cin >> t >> a >> b;
				if (t == 1)
				{
					change.emplace_back(make_tuple(j, a, b));
					vis[a] = 1;
				}
				else
					event.emplace_back(make_tuple(-b, j, a));
			}
			for (int j = 1; j <= M; j++)
				if (!vis[j])
					event.emplace_back(make_tuple(-d[j], 0, j));
				else
				{
					change.emplace_back(make_tuple(i - 1, j, d[j]));
					out.emplace_back(j);
				}
			sort(event.begin(), event.end());
			sort(change.begin(), change.end());
			for (auto [d, q, j] : event)
			{
				// cerr << "event " << d << ' ' << t << ' ' << j << ' ' << q << '\n';

				if (q == 0)
				{
					// cerr << "include " << j << '\n';
					merge(u[j], v[j]);
				}
				else
				{
					int T = ops.size();
					for (auto [tt, k, dd] : change)
						if (tt <= q)
							nd[k] = dd;
						else
							break;
					for (auto k : out)
						if (nd[k] >= -d)
						{
							// cerr << "tmp include " << k << '\n';
							merge(u[k], v[k]);
						}
					ans[q] = rk[find(j)];
					undo(T);
				}
			}
			for (auto [t, j, dd] : change)
				d[j] = dd;
		}
		for (int i = 1; i <= Q; i++)
		{
			if (ans[i] > 0)
				cout << ans[i] << '\n';
		}
	}
}

signed main()
{
	mangorz();
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 476 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 14 ms 340 KB Output is correct
6 Correct 12 ms 432 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 14 ms 340 KB Output is correct
9 Correct 16 ms 424 KB Output is correct
10 Correct 14 ms 340 KB Output is correct
11 Correct 14 ms 440 KB Output is correct
12 Correct 18 ms 440 KB Output is correct
13 Correct 18 ms 340 KB Output is correct
14 Correct 19 ms 416 KB Output is correct
15 Correct 17 ms 340 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 15 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1182 ms 3232 KB Output is correct
2 Correct 1192 ms 3256 KB Output is correct
3 Correct 1171 ms 3356 KB Output is correct
4 Correct 1139 ms 3140 KB Output is correct
5 Correct 1160 ms 3220 KB Output is correct
6 Correct 1589 ms 3520 KB Output is correct
7 Correct 1600 ms 3380 KB Output is correct
8 Correct 1568 ms 3272 KB Output is correct
9 Correct 31 ms 900 KB Output is correct
10 Correct 1135 ms 3256 KB Output is correct
11 Correct 1124 ms 3388 KB Output is correct
12 Correct 927 ms 3572 KB Output is correct
13 Correct 847 ms 3104 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 988 ms 2516 KB Output is correct
2 Correct 653 ms 1384 KB Output is correct
3 Correct 1088 ms 2552 KB Output is correct
4 Correct 949 ms 2452 KB Output is correct
5 Correct 30 ms 856 KB Output is correct
6 Correct 1028 ms 2504 KB Output is correct
7 Correct 845 ms 2492 KB Output is correct
8 Correct 821 ms 2340 KB Output is correct
9 Correct 603 ms 2520 KB Output is correct
10 Correct 504 ms 2652 KB Output is correct
11 Correct 578 ms 2348 KB Output is correct
12 Correct 527 ms 2344 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1090 ms 4708 KB Output is correct
2 Correct 31 ms 844 KB Output is correct
3 Correct 125 ms 3112 KB Output is correct
4 Correct 137 ms 3120 KB Output is correct
5 Correct 1161 ms 4796 KB Output is correct
6 Correct 1045 ms 4632 KB Output is correct
7 Correct 1110 ms 4784 KB Output is correct
8 Correct 554 ms 3032 KB Output is correct
9 Correct 528 ms 3092 KB Output is correct
10 Correct 537 ms 3232 KB Output is correct
11 Correct 812 ms 3952 KB Output is correct
12 Correct 800 ms 3844 KB Output is correct
13 Correct 800 ms 4108 KB Output is correct
14 Correct 984 ms 4956 KB Output is correct
15 Correct 1048 ms 4632 KB Output is correct
16 Correct 1099 ms 4768 KB Output is correct
17 Correct 1024 ms 4748 KB Output is correct
18 Correct 1064 ms 4664 KB Output is correct
19 Correct 1048 ms 4684 KB Output is correct
20 Correct 889 ms 4360 KB Output is correct
21 Correct 894 ms 4392 KB Output is correct
22 Correct 1028 ms 4780 KB Output is correct
23 Correct 977 ms 4324 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1182 ms 3232 KB Output is correct
2 Correct 1192 ms 3256 KB Output is correct
3 Correct 1171 ms 3356 KB Output is correct
4 Correct 1139 ms 3140 KB Output is correct
5 Correct 1160 ms 3220 KB Output is correct
6 Correct 1589 ms 3520 KB Output is correct
7 Correct 1600 ms 3380 KB Output is correct
8 Correct 1568 ms 3272 KB Output is correct
9 Correct 31 ms 900 KB Output is correct
10 Correct 1135 ms 3256 KB Output is correct
11 Correct 1124 ms 3388 KB Output is correct
12 Correct 927 ms 3572 KB Output is correct
13 Correct 847 ms 3104 KB Output is correct
14 Correct 988 ms 2516 KB Output is correct
15 Correct 653 ms 1384 KB Output is correct
16 Correct 1088 ms 2552 KB Output is correct
17 Correct 949 ms 2452 KB Output is correct
18 Correct 30 ms 856 KB Output is correct
19 Correct 1028 ms 2504 KB Output is correct
20 Correct 845 ms 2492 KB Output is correct
21 Correct 821 ms 2340 KB Output is correct
22 Correct 603 ms 2520 KB Output is correct
23 Correct 504 ms 2652 KB Output is correct
24 Correct 578 ms 2348 KB Output is correct
25 Correct 527 ms 2344 KB Output is correct
26 Correct 1161 ms 3264 KB Output is correct
27 Correct 1469 ms 3292 KB Output is correct
28 Correct 1234 ms 3292 KB Output is correct
29 Correct 888 ms 3180 KB Output is correct
30 Correct 1433 ms 3176 KB Output is correct
31 Correct 1462 ms 3476 KB Output is correct
32 Correct 1455 ms 3360 KB Output is correct
33 Correct 1227 ms 3340 KB Output is correct
34 Correct 1244 ms 3260 KB Output is correct
35 Correct 1244 ms 3200 KB Output is correct
36 Correct 946 ms 3280 KB Output is correct
37 Correct 933 ms 3356 KB Output is correct
38 Correct 913 ms 3236 KB Output is correct
39 Correct 670 ms 3280 KB Output is correct
40 Correct 659 ms 3216 KB Output is correct
41 Correct 663 ms 3224 KB Output is correct
42 Correct 678 ms 3164 KB Output is correct
43 Correct 685 ms 3244 KB Output is correct
44 Correct 688 ms 3088 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 476 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 14 ms 340 KB Output is correct
6 Correct 12 ms 432 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 14 ms 340 KB Output is correct
9 Correct 16 ms 424 KB Output is correct
10 Correct 14 ms 340 KB Output is correct
11 Correct 14 ms 440 KB Output is correct
12 Correct 18 ms 440 KB Output is correct
13 Correct 18 ms 340 KB Output is correct
14 Correct 19 ms 416 KB Output is correct
15 Correct 17 ms 340 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 15 ms 340 KB Output is correct
18 Correct 1182 ms 3232 KB Output is correct
19 Correct 1192 ms 3256 KB Output is correct
20 Correct 1171 ms 3356 KB Output is correct
21 Correct 1139 ms 3140 KB Output is correct
22 Correct 1160 ms 3220 KB Output is correct
23 Correct 1589 ms 3520 KB Output is correct
24 Correct 1600 ms 3380 KB Output is correct
25 Correct 1568 ms 3272 KB Output is correct
26 Correct 31 ms 900 KB Output is correct
27 Correct 1135 ms 3256 KB Output is correct
28 Correct 1124 ms 3388 KB Output is correct
29 Correct 927 ms 3572 KB Output is correct
30 Correct 847 ms 3104 KB Output is correct
31 Correct 988 ms 2516 KB Output is correct
32 Correct 653 ms 1384 KB Output is correct
33 Correct 1088 ms 2552 KB Output is correct
34 Correct 949 ms 2452 KB Output is correct
35 Correct 30 ms 856 KB Output is correct
36 Correct 1028 ms 2504 KB Output is correct
37 Correct 845 ms 2492 KB Output is correct
38 Correct 821 ms 2340 KB Output is correct
39 Correct 603 ms 2520 KB Output is correct
40 Correct 504 ms 2652 KB Output is correct
41 Correct 578 ms 2348 KB Output is correct
42 Correct 527 ms 2344 KB Output is correct
43 Correct 1090 ms 4708 KB Output is correct
44 Correct 31 ms 844 KB Output is correct
45 Correct 125 ms 3112 KB Output is correct
46 Correct 137 ms 3120 KB Output is correct
47 Correct 1161 ms 4796 KB Output is correct
48 Correct 1045 ms 4632 KB Output is correct
49 Correct 1110 ms 4784 KB Output is correct
50 Correct 554 ms 3032 KB Output is correct
51 Correct 528 ms 3092 KB Output is correct
52 Correct 537 ms 3232 KB Output is correct
53 Correct 812 ms 3952 KB Output is correct
54 Correct 800 ms 3844 KB Output is correct
55 Correct 800 ms 4108 KB Output is correct
56 Correct 984 ms 4956 KB Output is correct
57 Correct 1048 ms 4632 KB Output is correct
58 Correct 1099 ms 4768 KB Output is correct
59 Correct 1024 ms 4748 KB Output is correct
60 Correct 1064 ms 4664 KB Output is correct
61 Correct 1048 ms 4684 KB Output is correct
62 Correct 889 ms 4360 KB Output is correct
63 Correct 894 ms 4392 KB Output is correct
64 Correct 1028 ms 4780 KB Output is correct
65 Correct 977 ms 4324 KB Output is correct
66 Correct 1161 ms 3264 KB Output is correct
67 Correct 1469 ms 3292 KB Output is correct
68 Correct 1234 ms 3292 KB Output is correct
69 Correct 888 ms 3180 KB Output is correct
70 Correct 1433 ms 3176 KB Output is correct
71 Correct 1462 ms 3476 KB Output is correct
72 Correct 1455 ms 3360 KB Output is correct
73 Correct 1227 ms 3340 KB Output is correct
74 Correct 1244 ms 3260 KB Output is correct
75 Correct 1244 ms 3200 KB Output is correct
76 Correct 946 ms 3280 KB Output is correct
77 Correct 933 ms 3356 KB Output is correct
78 Correct 913 ms 3236 KB Output is correct
79 Correct 670 ms 3280 KB Output is correct
80 Correct 659 ms 3216 KB Output is correct
81 Correct 663 ms 3224 KB Output is correct
82 Correct 678 ms 3164 KB Output is correct
83 Correct 685 ms 3244 KB Output is correct
84 Correct 688 ms 3088 KB Output is correct
85 Correct 1576 ms 5028 KB Output is correct
86 Correct 157 ms 3540 KB Output is correct
87 Correct 184 ms 3568 KB Output is correct
88 Correct 1513 ms 5024 KB Output is correct
89 Correct 1600 ms 4796 KB Output is correct
90 Correct 1498 ms 4812 KB Output is correct
91 Correct 1288 ms 3264 KB Output is correct
92 Correct 1279 ms 3240 KB Output is correct
93 Correct 1881 ms 3336 KB Output is correct
94 Correct 1413 ms 4040 KB Output is correct
95 Correct 1396 ms 4260 KB Output is correct
96 Correct 1522 ms 4036 KB Output is correct
97 Correct 1215 ms 4916 KB Output is correct
98 Correct 1300 ms 4632 KB Output is correct
99 Correct 1610 ms 4908 KB Output is correct
100 Correct 1563 ms 5048 KB Output is correct
101 Correct 1636 ms 4876 KB Output is correct
102 Correct 1612 ms 4880 KB Output is correct
103 Correct 1633 ms 4232 KB Output is correct
104 Correct 1636 ms 4304 KB Output is correct
105 Correct 1224 ms 4200 KB Output is correct
106 Correct 967 ms 3828 KB Output is correct
107 Correct 1086 ms 4524 KB Output is correct
108 Correct 1542 ms 4712 KB Output is correct
109 Correct 1465 ms 4128 KB Output is correct