oj.uz

Submission #548610

# Submission time Handle Problem Language Result Execution time Memory
548610 2022-04-13T23:53:54 Z GioChkhaidze Bridges (APIO19_bridges) C++14
100 / 100
 2557 ms 12248 KB 
#include <bits/stdc++.h>

#define pb push_back
#define f first
#define s second

using namespace std;

const int N = 1e5 + 5;

bool used[N], T;
int n, m, q, ms;
int ans[N], p[N], sz[N], lc[N], cl[N];
int a[N], b[N], c[N], t[N], x[N], y[N];
vector < pair < int , pair < int , int > > > rec;
vector < pair < pair < int , int > , int > > s, e, e1, e2, e3;

int P(int x) {
	if (x == p[x]) return x;
	if (T) rec.pb({x, {sz[x], p[x]}});
	return p[x] = P(p[x]);	
}

void uni(int a, int b) {
	a = P(a), b = P(b);
	if (a == b) return;
	if (sz[a] < sz[b]) swap(a, b);
	if (T) rec.pb({a, {sz[a], p[a]}});
	if (T) rec.pb({b, {sz[b], p[b]}});
	sz[a] += sz[b];
	p[b] = a;
	return ;
}

void roll_back() {
	while (rec.size()) {
		int x = rec.back().f;
		sz[x] = rec.back().s.f;
		p[x] = rec.back().s.s;
		rec.pop_back();
	}
}

main () {
	ios::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		cin >> a[i] >> b[i] >> c[i]; 
		e.pb({{c[i], 1}, i});
		lc[i] = cl[i] = c[i];
	}
	
	cin >> q;
	ms = 700;
	sort(e.begin(), e.end());
	for (int i = 1; i <= q; ++i) {
		cin >> t[i] >> x[i] >> y[i];
	}
	
	int id1, id2, id3, e1s, e2s, e3s;
	for (int i = 1; i <= q; i += ms) {
		e1.clear();
		e2.clear();
		vector < int > rc;	
		int rm = min(i + ms - 1, q);
		for (int j = i; j <= rm; ++j) { 
			if (t[j] == 1) {
				if (!used[x[j]]) rc.pb(x[j]);
				used[x[j]] = true;
			}
				else
			if (t[j] == 2) {
				e1.pb({{y[j], 0}, j});	
			}
		}

		sort(e1.begin(), e1.end());
		for (int j = 0; j < e.size(); ++j) {
			if (used[e[j].s]) continue;
			e2.pb(e[j]);
		}

		s.clear();
		id1 = 0, e1s = e1.size();
		id2 = 0, e2s = e2.size();
		while (id1 < e1s || id2 < e2s) {
			if (id2 == e2s || (id1 < e1s && e1[id1] < e2[id2])){
				s.pb(e1[id1]), id1++;
			}
				else
			if (id1 == e1s || (id2 < e2s && e2[id2] < e1[id1])) {
				s.pb(e2[id2]), id2++;
			}
		}
		
		for (int j = 1; j < i; ++j) {  
			if (t[j] == 2) continue;
			lc[x[j]] = cl[x[j]] = y[j]; 
		}
		
		for (int j = 1; j <= n; ++j) { 
			p[j] = j, sz[j] = 1; 
		}
		
		for (int j = s.size() - 1; j >= 0; --j) { 
			int tp = s[j].f.s;
			int cst = s[j].f.f;
			int id = s[j].s;
			
			if (tp) {
				uni(a[id], b[id]);
			}
				else {
				T = true;	
				for (int k = i; k <= id; ++k) { 
					if (t[k] == 1) lc[x[k]] = y[k];
				}
	
				for (int k = 0; k < rc.size(); ++k) {
					int idx = rc[k];
					if (cst <= lc[idx]) {
						uni(a[idx], b[idx]);
					}
					lc[idx] = cl[idx];
				}
					
				ans[id] = sz[P(x[id])];
				roll_back();
				T = false;
			}
		}

		e3.clear();
		for (int j = rm; j >= i; --j) {
			if (t[j] == 1) {
				if (used[x[j]]) {
					e3.pb({{y[j], 1}, x[j]});
					lc[x[j]] = cl[x[j]] = y[j];
					used[x[j]] = false;
				}
			}
		}

		e.clear();
		id2 = 0, e2s = e2.size();
		id3 = 0, e3s = e3.size();
		sort(e3.begin(), e3.end());
		while (id3 < e3s || id2 < e2s) {
			if (id2 == e2s || (id3 < e3s && e3[id3] < e2[id2])) {
				e.pb(e3[id3++]);
			}
				else
			if (id3 == e3s || (id2 < e2s && e2[id2] < e3[id3])) {
				e.pb(e2[id2++]);
			}
		}
	}
	
	for (int i = 1; i <= q; ++i) {
		if (t[i] == 2) cout << ans[i] << "\n";
	}
}

Compilation message

bridges.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main () {
      | ^~~~
bridges.cpp: In function 'int main()':
bridges.cpp:79:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for (int j = 0; j < e.size(); ++j) {
      |                   ~~^~~~~~~~~~
bridges.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int k = 0; k < rc.size(); ++k) {
      |                     ~~^~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 768 KB Output is correct
4 Correct 6 ms 592 KB Output is correct
5 Correct 17 ms 596 KB Output is correct
6 Correct 17 ms 712 KB Output is correct
7 Correct 19 ms 600 KB Output is correct
8 Correct 17 ms 696 KB Output is correct
9 Correct 27 ms 596 KB Output is correct
10 Correct 19 ms 596 KB Output is correct
11 Correct 17 ms 692 KB Output is correct
12 Correct 20 ms 700 KB Output is correct
13 Correct 26 ms 596 KB Output is correct
14 Correct 23 ms 704 KB Output is correct
15 Correct 20 ms 696 KB Output is correct
16 Correct 24 ms 596 KB Output is correct
17 Correct 24 ms 600 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1085 ms 5868 KB Output is correct
2 Correct 1123 ms 6016 KB Output is correct
3 Correct 1111 ms 5984 KB Output is correct
4 Correct 1294 ms 6044 KB Output is correct
5 Correct 1290 ms 5948 KB Output is correct
6 Correct 2557 ms 6156 KB Output is correct
7 Correct 2529 ms 7984 KB Output is correct
8 Correct 2503 ms 8136 KB Output is correct
9 Correct 65 ms 3444 KB Output is correct
10 Correct 1299 ms 7172 KB Output is correct
11 Correct 1193 ms 6928 KB Output is correct
12 Correct 1296 ms 8224 KB Output is correct
13 Correct 1158 ms 7928 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 888 ms 4908 KB Output is correct
2 Correct 840 ms 3460 KB Output is correct
3 Correct 1211 ms 4916 KB Output is correct
4 Correct 879 ms 4992 KB Output is correct
5 Correct 65 ms 2772 KB Output is correct
6 Correct 1022 ms 4940 KB Output is correct
7 Correct 808 ms 5004 KB Output is correct
8 Correct 718 ms 4872 KB Output is correct
9 Correct 565 ms 5096 KB Output is correct
10 Correct 495 ms 5072 KB Output is correct
11 Correct 564 ms 4800 KB Output is correct
12 Correct 500 ms 4808 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 909 ms 9036 KB Output is correct
2 Correct 64 ms 2764 KB Output is correct
3 Correct 101 ms 7648 KB Output is correct
4 Correct 82 ms 7692 KB Output is correct
5 Correct 716 ms 9000 KB Output is correct
6 Correct 943 ms 8924 KB Output is correct
7 Correct 706 ms 9064 KB Output is correct
8 Correct 522 ms 5968 KB Output is correct
9 Correct 508 ms 6032 KB Output is correct
10 Correct 520 ms 6100 KB Output is correct
11 Correct 805 ms 7648 KB Output is correct
12 Correct 781 ms 7624 KB Output is correct
13 Correct 794 ms 7756 KB Output is correct
14 Correct 695 ms 9052 KB Output is correct
15 Correct 711 ms 9036 KB Output is correct
16 Correct 975 ms 8968 KB Output is correct
17 Correct 973 ms 9104 KB Output is correct
18 Correct 986 ms 9124 KB Output is correct
19 Correct 980 ms 8936 KB Output is correct
20 Correct 891 ms 8280 KB Output is correct
21 Correct 902 ms 8276 KB Output is correct
22 Correct 935 ms 8868 KB Output is correct
23 Correct 744 ms 8032 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1085 ms 5868 KB Output is correct
2 Correct 1123 ms 6016 KB Output is correct
3 Correct 1111 ms 5984 KB Output is correct
4 Correct 1294 ms 6044 KB Output is correct
5 Correct 1290 ms 5948 KB Output is correct
6 Correct 2557 ms 6156 KB Output is correct
7 Correct 2529 ms 7984 KB Output is correct
8 Correct 2503 ms 8136 KB Output is correct
9 Correct 65 ms 3444 KB Output is correct
10 Correct 1299 ms 7172 KB Output is correct
11 Correct 1193 ms 6928 KB Output is correct
12 Correct 1296 ms 8224 KB Output is correct
13 Correct 1158 ms 7928 KB Output is correct
14 Correct 888 ms 4908 KB Output is correct
15 Correct 840 ms 3460 KB Output is correct
16 Correct 1211 ms 4916 KB Output is correct
17 Correct 879 ms 4992 KB Output is correct
18 Correct 65 ms 2772 KB Output is correct
19 Correct 1022 ms 4940 KB Output is correct
20 Correct 808 ms 5004 KB Output is correct
21 Correct 718 ms 4872 KB Output is correct
22 Correct 565 ms 5096 KB Output is correct
23 Correct 495 ms 5072 KB Output is correct
24 Correct 564 ms 4800 KB Output is correct
25 Correct 500 ms 4808 KB Output is correct
26 Correct 1033 ms 8296 KB Output is correct
27 Correct 1466 ms 7996 KB Output is correct
28 Correct 1145 ms 8132 KB Output is correct
29 Correct 798 ms 8264 KB Output is correct
30 Correct 1534 ms 7984 KB Output is correct
31 Correct 1566 ms 8092 KB Output is correct
32 Correct 1546 ms 8040 KB Output is correct
33 Correct 1187 ms 8060 KB Output is correct
34 Correct 1177 ms 8372 KB Output is correct
35 Correct 1172 ms 8120 KB Output is correct
36 Correct 861 ms 8088 KB Output is correct
37 Correct 855 ms 8168 KB Output is correct
38 Correct 842 ms 8036 KB Output is correct
39 Correct 648 ms 8088 KB Output is correct
40 Correct 637 ms 8184 KB Output is correct
41 Correct 630 ms 8220 KB Output is correct
42 Correct 638 ms 7896 KB Output is correct
43 Correct 639 ms 8036 KB Output is correct
44 Correct 638 ms 7952 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 768 KB Output is correct
4 Correct 6 ms 592 KB Output is correct
5 Correct 17 ms 596 KB Output is correct
6 Correct 17 ms 712 KB Output is correct
7 Correct 19 ms 600 KB Output is correct
8 Correct 17 ms 696 KB Output is correct
9 Correct 27 ms 596 KB Output is correct
10 Correct 19 ms 596 KB Output is correct
11 Correct 17 ms 692 KB Output is correct
12 Correct 20 ms 700 KB Output is correct
13 Correct 26 ms 596 KB Output is correct
14 Correct 23 ms 704 KB Output is correct
15 Correct 20 ms 696 KB Output is correct
16 Correct 24 ms 596 KB Output is correct
17 Correct 24 ms 600 KB Output is correct
18 Correct 1085 ms 5868 KB Output is correct
19 Correct 1123 ms 6016 KB Output is correct
20 Correct 1111 ms 5984 KB Output is correct
21 Correct 1294 ms 6044 KB Output is correct
22 Correct 1290 ms 5948 KB Output is correct
23 Correct 2557 ms 6156 KB Output is correct
24 Correct 2529 ms 7984 KB Output is correct
25 Correct 2503 ms 8136 KB Output is correct
26 Correct 65 ms 3444 KB Output is correct
27 Correct 1299 ms 7172 KB Output is correct
28 Correct 1193 ms 6928 KB Output is correct
29 Correct 1296 ms 8224 KB Output is correct
30 Correct 1158 ms 7928 KB Output is correct
31 Correct 888 ms 4908 KB Output is correct
32 Correct 840 ms 3460 KB Output is correct
33 Correct 1211 ms 4916 KB Output is correct
34 Correct 879 ms 4992 KB Output is correct
35 Correct 65 ms 2772 KB Output is correct
36 Correct 1022 ms 4940 KB Output is correct
37 Correct 808 ms 5004 KB Output is correct
38 Correct 718 ms 4872 KB Output is correct
39 Correct 565 ms 5096 KB Output is correct
40 Correct 495 ms 5072 KB Output is correct
41 Correct 564 ms 4800 KB Output is correct
42 Correct 500 ms 4808 KB Output is correct
43 Correct 909 ms 9036 KB Output is correct
44 Correct 64 ms 2764 KB Output is correct
45 Correct 101 ms 7648 KB Output is correct
46 Correct 82 ms 7692 KB Output is correct
47 Correct 716 ms 9000 KB Output is correct
48 Correct 943 ms 8924 KB Output is correct
49 Correct 706 ms 9064 KB Output is correct
50 Correct 522 ms 5968 KB Output is correct
51 Correct 508 ms 6032 KB Output is correct
52 Correct 520 ms 6100 KB Output is correct
53 Correct 805 ms 7648 KB Output is correct
54 Correct 781 ms 7624 KB Output is correct
55 Correct 794 ms 7756 KB Output is correct
56 Correct 695 ms 9052 KB Output is correct
57 Correct 711 ms 9036 KB Output is correct
58 Correct 975 ms 8968 KB Output is correct
59 Correct 973 ms 9104 KB Output is correct
60 Correct 986 ms 9124 KB Output is correct
61 Correct 980 ms 8936 KB Output is correct
62 Correct 891 ms 8280 KB Output is correct
63 Correct 902 ms 8276 KB Output is correct
64 Correct 935 ms 8868 KB Output is correct
65 Correct 744 ms 8032 KB Output is correct
66 Correct 1033 ms 8296 KB Output is correct
67 Correct 1466 ms 7996 KB Output is correct
68 Correct 1145 ms 8132 KB Output is correct
69 Correct 798 ms 8264 KB Output is correct
70 Correct 1534 ms 7984 KB Output is correct
71 Correct 1566 ms 8092 KB Output is correct
72 Correct 1546 ms 8040 KB Output is correct
73 Correct 1187 ms 8060 KB Output is correct
74 Correct 1177 ms 8372 KB Output is correct
75 Correct 1172 ms 8120 KB Output is correct
76 Correct 861 ms 8088 KB Output is correct
77 Correct 855 ms 8168 KB Output is correct
78 Correct 842 ms 8036 KB Output is correct
79 Correct 648 ms 8088 KB Output is correct
80 Correct 637 ms 8184 KB Output is correct
81 Correct 630 ms 8220 KB Output is correct
82 Correct 638 ms 7896 KB Output is correct
83 Correct 639 ms 8036 KB Output is correct
84 Correct 638 ms 7952 KB Output is correct
85 Correct 1484 ms 12248 KB Output is correct
86 Correct 138 ms 9024 KB Output is correct
87 Correct 144 ms 9112 KB Output is correct
88 Correct 1309 ms 10652 KB Output is correct
89 Correct 1455 ms 12124 KB Output is correct
90 Correct 1332 ms 10520 KB Output is correct
91 Correct 1266 ms 8012 KB Output is correct
92 Correct 1248 ms 8044 KB Output is correct
93 Correct 2272 ms 8020 KB Output is correct
94 Correct 1560 ms 10300 KB Output is correct
95 Correct 1485 ms 10408 KB Output is correct
96 Correct 2099 ms 10160 KB Output is correct
97 Correct 934 ms 10640 KB Output is correct
98 Correct 958 ms 10428 KB Output is correct
99 Correct 1641 ms 11908 KB Output is correct
100 Correct 1581 ms 11980 KB Output is correct
101 Correct 1609 ms 12108 KB Output is correct
102 Correct 1646 ms 12048 KB Output is correct
103 Correct 2103 ms 10768 KB Output is correct
104 Correct 2409 ms 10912 KB Output is correct
105 Correct 1339 ms 10772 KB Output is correct
106 Correct 1065 ms 10164 KB Output is correct
107 Correct 1291 ms 10740 KB Output is correct
108 Correct 1761 ms 11604 KB Output is correct
109 Correct 1631 ms 9424 KB Output is correct