oj.uz

Submission #527572

# Submission time Handle Problem Language Result Execution time Memory
527572 2022-02-17T17:01:57 Z LucaDantas Bridges (APIO19_bridges) C++17
100 / 100
 1825 ms 11908 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 1e5+10, maxq = maxn, B = 300;

struct DSU {
	int pai[maxn], peso[maxn];
	DSU() { for(int i = 0; i < maxn; i++) pai[i] = i, peso[i] = 1; }
	void init() { for(int i = 0; i < maxn; i++) pai[i] = i, peso[i] = 1; }
	int find(int x) { return pai[x] == x ? x : pai[x] = find(pai[x]); }
	void join(int a, int b) {
		a = find(a), b = find(b);
		if(a == b) return;
		if(peso[a] < peso[b]) swap(a, b);
		pai[b] = a;
		peso[a] += peso[b];
	}
	void reset(int a) { pai[a] = a, peso[a] = 1; }
	int sz(int a) { return peso[find(a)]; }
} dsu, dsu2;

struct Edge { int a, b, d, id; bool operator<(const Edge& o) const { return d > o.d; } } e[maxn], certo[maxn];

struct Query { int tipo, x, y, t; } qr[maxq];

bool special[maxn], foi[maxn];

int ans[maxq], back[maxn];

int main() {
	memset(ans, -1, sizeof ans);
	
	int n, m; scanf("%d %d", &n, &m);
	for(int i = 0; i < m; i++)
		scanf("%d %d %d", &e[i].a, &e[i].b, &e[i].d), e[i].id = i, certo[i] = e[i];

	int q; scanf("%d", &q);
	for(int i = 0; i < q; i++) {
		scanf("%d %d %d", &qr[i].tipo, &qr[i].x, &qr[i].y);
		if(qr[i].tipo == 1) --qr[i].x;
		qr[i].t = i;
	}

	// ordenar as arestas pelo peso decrescente
	sort(e, e+m, [](const Edge& a, const Edge& b) { return a.d > b.d; });

	for(int i = 0; i < m; i++)
		back[e[i].id] = i;

	for(int k = 0; k < q; k += B) {
		vector<Query> ask;

		for(int i = k; i < min(q, k+B); i++) {
			if(qr[i].tipo == 1) // update
				special[qr[i].x] = 1;
			else ask.push_back(qr[i]);
		}

		sort(ask.begin(), ask.end(), [](const Query& a, const Query& b) { return a.y > b.y; }); // y==peso, ordeno pelo peso decrescente

		for(int i = 0, ptr = 0; i < (int)ask.size(); i++) {

			for(; ptr < m && e[ptr].d >= ask[i].y; ptr++) {
				if(!special[e[ptr].id])
					dsu.join(e[ptr].a, e[ptr].b);
			}

			vector<int> ver = {dsu.find(ask[i].x)}; // todos os caras que eu vou olhar no dsu2 pra ver se está junto ao vertice da pergunta

			for(int j = ask[i].t-1; j >= k; j--) { // vejo todos os updates anteriores pra ver se adiciono ou não
				if(qr[j].tipo == 1 && qr[j].y >= ask[i].y && !foi[qr[j].x]) {
					int id = qr[j].x;
					dsu2.join(dsu.find(certo[id].a), dsu.find(certo[id].b));
					ver.push_back(dsu.find(certo[id].a)), ver.push_back(dsu.find(certo[id].b));
				}
				if(qr[j].tipo == 1)
					foi[qr[j].x] = 1;
			}

			for(int j = ask[i].t; j < min(q, k+B); j++) {
				if(qr[j].tipo == 1 && certo[qr[j].x].d >= ask[i].y && !foi[qr[j].x]) {
					int id = qr[j].x;
					dsu2.join(dsu.find(certo[id].a), dsu.find(certo[id].b));
					ver.push_back(dsu.find(certo[id].a)), ver.push_back(dsu.find(certo[id].b));
				}
			}

			for(int j = ask[i].t-1; j >= k; j--)
				foi[qr[j].x] = 0;

			int val = 0;

			for(int x : ver) {
				if(!foi[x] && dsu2.find(dsu.find(ask[i].x)) == dsu2.find(x))
					foi[x] = 1, val += dsu.sz(x);
			}

			for(int x : ver) dsu2.reset(x), foi[x] = 0;

			ans[ask[i].t] = val;
		}


		// reiniciar as coisas pro próximo bloco
		dsu.init();
		ask.clear();
		vector<Edge> sla, bom;
		vector<int> add_dps;
		
		for(int i = 0; i < m; i++)
			if(!special[e[i].id]) bom.push_back(certo[e[i].id]);
			else add_dps.push_back(e[i].id);

		for(int i = k; i < min(q, k+B); i++) {
			if(qr[i].tipo == 1) {
				special[qr[i].x] = 0;
				certo[qr[i].x].d = qr[i].y;
			}
		}

		for(int x : add_dps)
			sla.push_back(certo[x]);
		
		sort(sla.begin(), sla.end());
		merge(bom.begin(), bom.end(), sla.begin(), sla.end(), e);
	}

	for(int i = 0; i < q; i++)
		if(ans[i] != -1) printf("%d\n", ans[i]);
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:33:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  int n, m; scanf("%d %d", &n, &m);
      |            ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%d %d %d", &e[i].a, &e[i].b, &e[i].d), e[i].id = i, certo[i] = e[i];
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  int q; scanf("%d", &q);
      |         ~~~~~^~~~~~~~~~
bridges.cpp:39:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |   scanf("%d %d %d", &qr[i].tipo, &qr[i].x, &qr[i].y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2256 KB Output is correct
2 Correct 1 ms 2252 KB Output is correct
3 Correct 27 ms 2668 KB Output is correct
4 Correct 14 ms 2572 KB Output is correct
5 Correct 28 ms 2580 KB Output is correct
6 Correct 27 ms 2596 KB Output is correct
7 Correct 33 ms 2520 KB Output is correct
8 Correct 34 ms 2508 KB Output is correct
9 Correct 40 ms 2508 KB Output is correct
10 Correct 33 ms 2584 KB Output is correct
11 Correct 36 ms 2588 KB Output is correct
12 Correct 33 ms 2584 KB Output is correct
13 Correct 43 ms 2508 KB Output is correct
14 Correct 31 ms 2508 KB Output is correct
15 Correct 37 ms 2580 KB Output is correct
16 Correct 33 ms 2516 KB Output is correct
17 Correct 33 ms 2512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1058 ms 7976 KB Output is correct
2 Correct 1102 ms 7796 KB Output is correct
3 Correct 1114 ms 8036 KB Output is correct
4 Correct 1183 ms 7864 KB Output is correct
5 Correct 1111 ms 8020 KB Output is correct
6 Correct 1407 ms 7980 KB Output is correct
7 Correct 1369 ms 7844 KB Output is correct
8 Correct 1410 ms 7776 KB Output is correct
9 Correct 139 ms 4368 KB Output is correct
10 Correct 1089 ms 7824 KB Output is correct
11 Correct 1071 ms 7784 KB Output is correct
12 Correct 963 ms 8032 KB Output is correct
13 Correct 956 ms 7772 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 769 ms 6528 KB Output is correct
2 Correct 482 ms 4696 KB Output is correct
3 Correct 786 ms 6504 KB Output is correct
4 Correct 722 ms 6356 KB Output is correct
5 Correct 124 ms 4200 KB Output is correct
6 Correct 801 ms 6404 KB Output is correct
7 Correct 670 ms 6448 KB Output is correct
8 Correct 614 ms 6412 KB Output is correct
9 Correct 597 ms 6468 KB Output is correct
10 Correct 605 ms 6328 KB Output is correct
11 Correct 510 ms 6328 KB Output is correct
12 Correct 487 ms 6324 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1468 ms 11816 KB Output is correct
2 Correct 126 ms 4340 KB Output is correct
3 Correct 128 ms 9952 KB Output is correct
4 Correct 114 ms 10016 KB Output is correct
5 Correct 1411 ms 11776 KB Output is correct
6 Correct 1550 ms 11908 KB Output is correct
7 Correct 1490 ms 11448 KB Output is correct
8 Correct 860 ms 7888 KB Output is correct
9 Correct 793 ms 7880 KB Output is correct
10 Correct 798 ms 7496 KB Output is correct
11 Correct 1567 ms 9800 KB Output is correct
12 Correct 1325 ms 9916 KB Output is correct
13 Correct 1447 ms 9796 KB Output is correct
14 Correct 1507 ms 11128 KB Output is correct
15 Correct 1428 ms 11060 KB Output is correct
16 Correct 1650 ms 11084 KB Output is correct
17 Correct 1667 ms 11024 KB Output is correct
18 Correct 1707 ms 11132 KB Output is correct
19 Correct 1726 ms 11096 KB Output is correct
20 Correct 1553 ms 10376 KB Output is correct
21 Correct 1499 ms 10404 KB Output is correct
22 Correct 1627 ms 10820 KB Output is correct
23 Correct 1380 ms 10260 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1058 ms 7976 KB Output is correct
2 Correct 1102 ms 7796 KB Output is correct
3 Correct 1114 ms 8036 KB Output is correct
4 Correct 1183 ms 7864 KB Output is correct
5 Correct 1111 ms 8020 KB Output is correct
6 Correct 1407 ms 7980 KB Output is correct
7 Correct 1369 ms 7844 KB Output is correct
8 Correct 1410 ms 7776 KB Output is correct
9 Correct 139 ms 4368 KB Output is correct
10 Correct 1089 ms 7824 KB Output is correct
11 Correct 1071 ms 7784 KB Output is correct
12 Correct 963 ms 8032 KB Output is correct
13 Correct 956 ms 7772 KB Output is correct
14 Correct 769 ms 6528 KB Output is correct
15 Correct 482 ms 4696 KB Output is correct
16 Correct 786 ms 6504 KB Output is correct
17 Correct 722 ms 6356 KB Output is correct
18 Correct 124 ms 4200 KB Output is correct
19 Correct 801 ms 6404 KB Output is correct
20 Correct 670 ms 6448 KB Output is correct
21 Correct 614 ms 6412 KB Output is correct
22 Correct 597 ms 6468 KB Output is correct
23 Correct 605 ms 6328 KB Output is correct
24 Correct 510 ms 6328 KB Output is correct
25 Correct 487 ms 6324 KB Output is correct
26 Correct 1002 ms 7608 KB Output is correct
27 Correct 1249 ms 7616 KB Output is correct
28 Correct 1144 ms 7592 KB Output is correct
29 Correct 987 ms 7640 KB Output is correct
30 Correct 1281 ms 7560 KB Output is correct
31 Correct 1267 ms 7636 KB Output is correct
32 Correct 1295 ms 7580 KB Output is correct
33 Correct 1160 ms 7536 KB Output is correct
34 Correct 1135 ms 7520 KB Output is correct
35 Correct 1151 ms 7572 KB Output is correct
36 Correct 1006 ms 7724 KB Output is correct
37 Correct 1000 ms 7636 KB Output is correct
38 Correct 1004 ms 7540 KB Output is correct
39 Correct 935 ms 7548 KB Output is correct
40 Correct 904 ms 7572 KB Output is correct
41 Correct 878 ms 7648 KB Output is correct
42 Correct 728 ms 7520 KB Output is correct
43 Correct 774 ms 7536 KB Output is correct
44 Correct 744 ms 7668 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2256 KB Output is correct
2 Correct 1 ms 2252 KB Output is correct
3 Correct 27 ms 2668 KB Output is correct
4 Correct 14 ms 2572 KB Output is correct
5 Correct 28 ms 2580 KB Output is correct
6 Correct 27 ms 2596 KB Output is correct
7 Correct 33 ms 2520 KB Output is correct
8 Correct 34 ms 2508 KB Output is correct
9 Correct 40 ms 2508 KB Output is correct
10 Correct 33 ms 2584 KB Output is correct
11 Correct 36 ms 2588 KB Output is correct
12 Correct 33 ms 2584 KB Output is correct
13 Correct 43 ms 2508 KB Output is correct
14 Correct 31 ms 2508 KB Output is correct
15 Correct 37 ms 2580 KB Output is correct
16 Correct 33 ms 2516 KB Output is correct
17 Correct 33 ms 2512 KB Output is correct
18 Correct 1058 ms 7976 KB Output is correct
19 Correct 1102 ms 7796 KB Output is correct
20 Correct 1114 ms 8036 KB Output is correct
21 Correct 1183 ms 7864 KB Output is correct
22 Correct 1111 ms 8020 KB Output is correct
23 Correct 1407 ms 7980 KB Output is correct
24 Correct 1369 ms 7844 KB Output is correct
25 Correct 1410 ms 7776 KB Output is correct
26 Correct 139 ms 4368 KB Output is correct
27 Correct 1089 ms 7824 KB Output is correct
28 Correct 1071 ms 7784 KB Output is correct
29 Correct 963 ms 8032 KB Output is correct
30 Correct 956 ms 7772 KB Output is correct
31 Correct 769 ms 6528 KB Output is correct
32 Correct 482 ms 4696 KB Output is correct
33 Correct 786 ms 6504 KB Output is correct
34 Correct 722 ms 6356 KB Output is correct
35 Correct 124 ms 4200 KB Output is correct
36 Correct 801 ms 6404 KB Output is correct
37 Correct 670 ms 6448 KB Output is correct
38 Correct 614 ms 6412 KB Output is correct
39 Correct 597 ms 6468 KB Output is correct
40 Correct 605 ms 6328 KB Output is correct
41 Correct 510 ms 6328 KB Output is correct
42 Correct 487 ms 6324 KB Output is correct
43 Correct 1468 ms 11816 KB Output is correct
44 Correct 126 ms 4340 KB Output is correct
45 Correct 128 ms 9952 KB Output is correct
46 Correct 114 ms 10016 KB Output is correct
47 Correct 1411 ms 11776 KB Output is correct
48 Correct 1550 ms 11908 KB Output is correct
49 Correct 1490 ms 11448 KB Output is correct
50 Correct 860 ms 7888 KB Output is correct
51 Correct 793 ms 7880 KB Output is correct
52 Correct 798 ms 7496 KB Output is correct
53 Correct 1567 ms 9800 KB Output is correct
54 Correct 1325 ms 9916 KB Output is correct
55 Correct 1447 ms 9796 KB Output is correct
56 Correct 1507 ms 11128 KB Output is correct
57 Correct 1428 ms 11060 KB Output is correct
58 Correct 1650 ms 11084 KB Output is correct
59 Correct 1667 ms 11024 KB Output is correct
60 Correct 1707 ms 11132 KB Output is correct
61 Correct 1726 ms 11096 KB Output is correct
62 Correct 1553 ms 10376 KB Output is correct
63 Correct 1499 ms 10404 KB Output is correct
64 Correct 1627 ms 10820 KB Output is correct
65 Correct 1380 ms 10260 KB Output is correct
66 Correct 1002 ms 7608 KB Output is correct
67 Correct 1249 ms 7616 KB Output is correct
68 Correct 1144 ms 7592 KB Output is correct
69 Correct 987 ms 7640 KB Output is correct
70 Correct 1281 ms 7560 KB Output is correct
71 Correct 1267 ms 7636 KB Output is correct
72 Correct 1295 ms 7580 KB Output is correct
73 Correct 1160 ms 7536 KB Output is correct
74 Correct 1135 ms 7520 KB Output is correct
75 Correct 1151 ms 7572 KB Output is correct
76 Correct 1006 ms 7724 KB Output is correct
77 Correct 1000 ms 7636 KB Output is correct
78 Correct 1004 ms 7540 KB Output is correct
79 Correct 935 ms 7548 KB Output is correct
80 Correct 904 ms 7572 KB Output is correct
81 Correct 878 ms 7648 KB Output is correct
82 Correct 728 ms 7520 KB Output is correct
83 Correct 774 ms 7536 KB Output is correct
84 Correct 744 ms 7668 KB Output is correct
85 Correct 1684 ms 11336 KB Output is correct
86 Correct 138 ms 9796 KB Output is correct
87 Correct 134 ms 9804 KB Output is correct
88 Correct 1617 ms 11280 KB Output is correct
89 Correct 1675 ms 11252 KB Output is correct
90 Correct 1572 ms 11244 KB Output is correct
91 Correct 1099 ms 7788 KB Output is correct
92 Correct 1077 ms 7636 KB Output is correct
93 Correct 1315 ms 7548 KB Output is correct
94 Correct 1597 ms 9988 KB Output is correct
95 Correct 1593 ms 10048 KB Output is correct
96 Correct 1670 ms 9908 KB Output is correct
97 Correct 1435 ms 11116 KB Output is correct
98 Correct 1420 ms 11128 KB Output is correct
99 Correct 1807 ms 11332 KB Output is correct
100 Correct 1809 ms 11320 KB Output is correct
101 Correct 1823 ms 11256 KB Output is correct
102 Correct 1825 ms 11132 KB Output is correct
103 Correct 1721 ms 10304 KB Output is correct
104 Correct 1778 ms 10400 KB Output is correct
105 Correct 1507 ms 10324 KB Output is correct
106 Correct 1337 ms 9848 KB Output is correct
107 Correct 1580 ms 10488 KB Output is correct
108 Correct 1808 ms 11140 KB Output is correct
109 Correct 1638 ms 10532 KB Output is correct