Submission #383084

# Submission time Handle Problem Language Result Execution time Memory
383084 2021-03-28T19:38:41 Z Kalashnikov Bridges (APIO19_bridges) C++17
100 / 100
2718 ms 9776 KB
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 1e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int K = 800;

int u[N] , v[N] , d[N] , t[N] , a[N] , b[N] , used[N] , p[N] , sz[N] , ans[N];

vector<pair<int*,int>> rollback;

int get(int v) {
	if(p[v] == v) return v;
	return get(p[v]);
}

void merge(int a, int b , int keep = 0) {
	a = get(a);
	b = get(b);
	if(a == b) return;
	if(sz[a] < sz[b]) swap(a , b);
	if(keep) {
		rollback.push_back({&sz[a] , sz[a]});
		rollback.push_back({&p[b] , p[b]});
	}
	sz[a] += sz[b];
	p[b] = a;
}

void solve() {
	int n , m , q;
	cin >> n >> m;
	for(int i = 1; i <= m; i ++) {
		cin >> u[i] >> v[i] >> d[i];
	}
	cin >> q;
	int last = 0;
	for(int i = 0; i <= q; i ++) {
		if((i % K == 0 && i != 0) || i == q) {
			vector<pair<int,int>> cons;
			vector<int> necons;
			for(int j = 1; j <= m; j ++) {
				if(used[j] == 0) {
					cons.push_back({d[j] , j});
				}
				else {
					necons.push_back(j);
				}
				used[j] = 0;
			}
			sort(all(cons));
			
			for(int j = 1; j <= n; j ++) {
				p[j] = j;
				sz[j] = 1;
			}
			vector<pair<int,int>> ques;
			vector<int> changes;
			for(int j = last; j < i; j ++) {
				if(t[j] == 2) {
					ques.push_back({b[j] , j});
				}
				else {
					changes.push_back(j);
				}
			}
			sort(all(ques));
			reverse(all(ques));
			
			for(auto x: ques) {
		//		cout << x.F << ' ' << x.S << '\n';
				while(cons.size() && cons.back().F >= x.F) {
					merge(u[cons.back().S] , v[cons.back().S]);
					cons.pop_back();
				}
				for(auto to: changes) {
					if(to > x.S) break;
					//cout << "   ";
				//	cout << a[to] << ' ' << b[to] << '\n';
					rollback.push_back({&d[a[to]] , d[a[to]]});
					d[a[to]] = b[to];
				}
				for(auto to: necons) {
					if(d[to] >= x.F) {
						merge(u[to] , v[to] , 1);
					}
				}
				ans[x.S] = sz[get(a[x.S])];
				while(rollback.size()) {
					*rollback.back().F = rollback.back().S;
					rollback.pop_back();
				}
			}
			for(auto to: changes) {
				d[a[to]] = b[to];
			}
			last = i;
		}
		if(i == q) break;
		cin >> t[i] >> a[i] >> b[i];
		if(t[i] == 1) {
			used[a[i]] = 1;
		}
	}
	
	//cout << "BRIDGE\n";
	
	for(int i = 0; i < q; i ++) {
		if(t[i] == 2) {
			cout << ans[i] << '\n';
		}
	}
}
/*
*/
main() {
    ios;
    int tt = 1;
    //cin >> tt;
    while(tt --) {
        solve();
    }
    return 0;
}

Compilation message

bridges.cpp:125:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  125 | main() {
      |      ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 496 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 34 ms 620 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 21 ms 620 KB Output is correct
6 Correct 20 ms 620 KB Output is correct
7 Correct 23 ms 620 KB Output is correct
8 Correct 23 ms 620 KB Output is correct
9 Correct 27 ms 748 KB Output is correct
10 Correct 23 ms 620 KB Output is correct
11 Correct 23 ms 620 KB Output is correct
12 Correct 26 ms 620 KB Output is correct
13 Correct 28 ms 620 KB Output is correct
14 Correct 27 ms 620 KB Output is correct
15 Correct 24 ms 620 KB Output is correct
16 Correct 25 ms 620 KB Output is correct
17 Correct 24 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1538 ms 4048 KB Output is correct
2 Correct 1552 ms 4200 KB Output is correct
3 Correct 1529 ms 4296 KB Output is correct
4 Correct 1543 ms 4220 KB Output is correct
5 Correct 1553 ms 4368 KB Output is correct
6 Correct 2100 ms 4156 KB Output is correct
7 Correct 2090 ms 4640 KB Output is correct
8 Correct 2090 ms 4160 KB Output is correct
9 Correct 40 ms 2156 KB Output is correct
10 Correct 1427 ms 4084 KB Output is correct
11 Correct 1441 ms 4152 KB Output is correct
12 Correct 1386 ms 4180 KB Output is correct
13 Correct 1343 ms 4156 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1185 ms 3496 KB Output is correct
2 Correct 796 ms 2736 KB Output is correct
3 Correct 1356 ms 3408 KB Output is correct
4 Correct 1180 ms 3360 KB Output is correct
5 Correct 40 ms 2156 KB Output is correct
6 Correct 1324 ms 3348 KB Output is correct
7 Correct 1155 ms 3444 KB Output is correct
8 Correct 1039 ms 3412 KB Output is correct
9 Correct 846 ms 3552 KB Output is correct
10 Correct 784 ms 3400 KB Output is correct
11 Correct 844 ms 3608 KB Output is correct
12 Correct 763 ms 3588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2054 ms 5900 KB Output is correct
2 Correct 41 ms 3436 KB Output is correct
3 Correct 217 ms 5832 KB Output is correct
4 Correct 169 ms 5924 KB Output is correct
5 Correct 1886 ms 8172 KB Output is correct
6 Correct 2064 ms 8584 KB Output is correct
7 Correct 1954 ms 8016 KB Output is correct
8 Correct 1014 ms 6852 KB Output is correct
9 Correct 1026 ms 7000 KB Output is correct
10 Correct 995 ms 6564 KB Output is correct
11 Correct 1579 ms 8008 KB Output is correct
12 Correct 1539 ms 8132 KB Output is correct
13 Correct 1568 ms 8164 KB Output is correct
14 Correct 1691 ms 8232 KB Output is correct
15 Correct 1808 ms 7936 KB Output is correct
16 Correct 2094 ms 8592 KB Output is correct
17 Correct 2079 ms 8660 KB Output is correct
18 Correct 2057 ms 8476 KB Output is correct
19 Correct 2041 ms 9044 KB Output is correct
20 Correct 1790 ms 8164 KB Output is correct
21 Correct 1771 ms 8384 KB Output is correct
22 Correct 1998 ms 8600 KB Output is correct
23 Correct 1837 ms 7732 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1538 ms 4048 KB Output is correct
2 Correct 1552 ms 4200 KB Output is correct
3 Correct 1529 ms 4296 KB Output is correct
4 Correct 1543 ms 4220 KB Output is correct
5 Correct 1553 ms 4368 KB Output is correct
6 Correct 2100 ms 4156 KB Output is correct
7 Correct 2090 ms 4640 KB Output is correct
8 Correct 2090 ms 4160 KB Output is correct
9 Correct 40 ms 2156 KB Output is correct
10 Correct 1427 ms 4084 KB Output is correct
11 Correct 1441 ms 4152 KB Output is correct
12 Correct 1386 ms 4180 KB Output is correct
13 Correct 1343 ms 4156 KB Output is correct
14 Correct 1185 ms 3496 KB Output is correct
15 Correct 796 ms 2736 KB Output is correct
16 Correct 1356 ms 3408 KB Output is correct
17 Correct 1180 ms 3360 KB Output is correct
18 Correct 40 ms 2156 KB Output is correct
19 Correct 1324 ms 3348 KB Output is correct
20 Correct 1155 ms 3444 KB Output is correct
21 Correct 1039 ms 3412 KB Output is correct
22 Correct 846 ms 3552 KB Output is correct
23 Correct 784 ms 3400 KB Output is correct
24 Correct 844 ms 3608 KB Output is correct
25 Correct 763 ms 3588 KB Output is correct
26 Correct 1586 ms 4368 KB Output is correct
27 Correct 1950 ms 4572 KB Output is correct
28 Correct 1665 ms 4392 KB Output is correct
29 Correct 1330 ms 4196 KB Output is correct
30 Correct 1852 ms 4292 KB Output is correct
31 Correct 1882 ms 4120 KB Output is correct
32 Correct 1913 ms 4328 KB Output is correct
33 Correct 1634 ms 4296 KB Output is correct
34 Correct 1651 ms 4392 KB Output is correct
35 Correct 1651 ms 4152 KB Output is correct
36 Correct 1362 ms 4368 KB Output is correct
37 Correct 1354 ms 4224 KB Output is correct
38 Correct 1344 ms 4332 KB Output is correct
39 Correct 1123 ms 4336 KB Output is correct
40 Correct 1125 ms 4444 KB Output is correct
41 Correct 1114 ms 4240 KB Output is correct
42 Correct 1101 ms 4384 KB Output is correct
43 Correct 1106 ms 4196 KB Output is correct
44 Correct 1099 ms 4428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 496 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 34 ms 620 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 21 ms 620 KB Output is correct
6 Correct 20 ms 620 KB Output is correct
7 Correct 23 ms 620 KB Output is correct
8 Correct 23 ms 620 KB Output is correct
9 Correct 27 ms 748 KB Output is correct
10 Correct 23 ms 620 KB Output is correct
11 Correct 23 ms 620 KB Output is correct
12 Correct 26 ms 620 KB Output is correct
13 Correct 28 ms 620 KB Output is correct
14 Correct 27 ms 620 KB Output is correct
15 Correct 24 ms 620 KB Output is correct
16 Correct 25 ms 620 KB Output is correct
17 Correct 24 ms 620 KB Output is correct
18 Correct 1538 ms 4048 KB Output is correct
19 Correct 1552 ms 4200 KB Output is correct
20 Correct 1529 ms 4296 KB Output is correct
21 Correct 1543 ms 4220 KB Output is correct
22 Correct 1553 ms 4368 KB Output is correct
23 Correct 2100 ms 4156 KB Output is correct
24 Correct 2090 ms 4640 KB Output is correct
25 Correct 2090 ms 4160 KB Output is correct
26 Correct 40 ms 2156 KB Output is correct
27 Correct 1427 ms 4084 KB Output is correct
28 Correct 1441 ms 4152 KB Output is correct
29 Correct 1386 ms 4180 KB Output is correct
30 Correct 1343 ms 4156 KB Output is correct
31 Correct 1185 ms 3496 KB Output is correct
32 Correct 796 ms 2736 KB Output is correct
33 Correct 1356 ms 3408 KB Output is correct
34 Correct 1180 ms 3360 KB Output is correct
35 Correct 40 ms 2156 KB Output is correct
36 Correct 1324 ms 3348 KB Output is correct
37 Correct 1155 ms 3444 KB Output is correct
38 Correct 1039 ms 3412 KB Output is correct
39 Correct 846 ms 3552 KB Output is correct
40 Correct 784 ms 3400 KB Output is correct
41 Correct 844 ms 3608 KB Output is correct
42 Correct 763 ms 3588 KB Output is correct
43 Correct 2054 ms 5900 KB Output is correct
44 Correct 41 ms 3436 KB Output is correct
45 Correct 217 ms 5832 KB Output is correct
46 Correct 169 ms 5924 KB Output is correct
47 Correct 1886 ms 8172 KB Output is correct
48 Correct 2064 ms 8584 KB Output is correct
49 Correct 1954 ms 8016 KB Output is correct
50 Correct 1014 ms 6852 KB Output is correct
51 Correct 1026 ms 7000 KB Output is correct
52 Correct 995 ms 6564 KB Output is correct
53 Correct 1579 ms 8008 KB Output is correct
54 Correct 1539 ms 8132 KB Output is correct
55 Correct 1568 ms 8164 KB Output is correct
56 Correct 1691 ms 8232 KB Output is correct
57 Correct 1808 ms 7936 KB Output is correct
58 Correct 2094 ms 8592 KB Output is correct
59 Correct 2079 ms 8660 KB Output is correct
60 Correct 2057 ms 8476 KB Output is correct
61 Correct 2041 ms 9044 KB Output is correct
62 Correct 1790 ms 8164 KB Output is correct
63 Correct 1771 ms 8384 KB Output is correct
64 Correct 1998 ms 8600 KB Output is correct
65 Correct 1837 ms 7732 KB Output is correct
66 Correct 1586 ms 4368 KB Output is correct
67 Correct 1950 ms 4572 KB Output is correct
68 Correct 1665 ms 4392 KB Output is correct
69 Correct 1330 ms 4196 KB Output is correct
70 Correct 1852 ms 4292 KB Output is correct
71 Correct 1882 ms 4120 KB Output is correct
72 Correct 1913 ms 4328 KB Output is correct
73 Correct 1634 ms 4296 KB Output is correct
74 Correct 1651 ms 4392 KB Output is correct
75 Correct 1651 ms 4152 KB Output is correct
76 Correct 1362 ms 4368 KB Output is correct
77 Correct 1354 ms 4224 KB Output is correct
78 Correct 1344 ms 4332 KB Output is correct
79 Correct 1123 ms 4336 KB Output is correct
80 Correct 1125 ms 4444 KB Output is correct
81 Correct 1114 ms 4240 KB Output is correct
82 Correct 1101 ms 4384 KB Output is correct
83 Correct 1106 ms 4196 KB Output is correct
84 Correct 1099 ms 4428 KB Output is correct
85 Correct 2584 ms 9776 KB Output is correct
86 Correct 250 ms 4636 KB Output is correct
87 Correct 207 ms 4512 KB Output is correct
88 Correct 2444 ms 6804 KB Output is correct
89 Correct 2565 ms 6376 KB Output is correct
90 Correct 2448 ms 6684 KB Output is correct
91 Correct 1664 ms 4948 KB Output is correct
92 Correct 1669 ms 4800 KB Output is correct
93 Correct 2263 ms 4916 KB Output is correct
94 Correct 2127 ms 6088 KB Output is correct
95 Correct 2127 ms 6160 KB Output is correct
96 Correct 2348 ms 5620 KB Output is correct
97 Correct 2092 ms 6396 KB Output is correct
98 Correct 2185 ms 6352 KB Output is correct
99 Correct 2651 ms 6364 KB Output is correct
100 Correct 2635 ms 6216 KB Output is correct
101 Correct 2676 ms 6100 KB Output is correct
102 Correct 2718 ms 6140 KB Output is correct
103 Correct 2619 ms 5892 KB Output is correct
104 Correct 2610 ms 6320 KB Output is correct
105 Correct 2099 ms 6284 KB Output is correct
106 Correct 1752 ms 5848 KB Output is correct
107 Correct 2032 ms 6104 KB Output is correct
108 Correct 2660 ms 6320 KB Output is correct
109 Correct 2477 ms 5884 KB Output is correct