oj.uz

Submission #398332

# Submission time Handle Problem Language Result Execution time Memory
398332 2021-05-04T07:15:17 Z oolimry Bridges (APIO19_bridges) C++17
100 / 100
 2166 ms 19020 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) x.size())
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << ", " << #y << " is " << y << endl;
#define show3(x, y, z) cerr << #x << " is " << x << ", " << #y << " is " << y << ", " << #z << " is " << z << endl;
typedef long long lint;
typedef pair<int, int> ii;
const int UPD = 1;
const int QRY = 2;

int edgeW[100005];
int U[100005];
int V[100005]; ///if B == -1, then is query
vector<ii> history[100005];
int n, m, Q;

int T[100005];
int queryW[100005];
int X[100005];
int ans[100005];


int p[50005];
int sz[50005];

inline void reset(){
	for(int i = 1;i <= n;i++) p[i] = i, sz[i] = 1;
}

inline int findSet(int u){
	if(p[u] == u) return u;
	else return p[u] = findSet(p[u]);
}

inline void unionSet(int u, int v){
	u = findSet(u), v = findSet(v);
	if(u == v) return;
	if((u^v)&1) swap(u,v);
	p[u] = v;
	sz[v] += sz[u];
}

bool changed[100005];
vector<int> order;
vector<int> neworder;
int ptr = 1;
inline void catchup(int limit){
	vector<int> C;
	for(;ptr <= limit;ptr++){
		if(T[ptr] == UPD){
			edgeW[X[ptr]] = queryW[ptr];
			C.push_back(X[ptr]);
			changed[X[ptr]] = true;
		}
	}
	
	sort(all(C), [&](int a, int b){ return edgeW[a] > edgeW[b]; });
	C.erase(unique(all(C)), C.end());
	
	auto it = order.begin();
	for(int e : C){
		int w = edgeW[e];
		while(it != order.end()){
			if(changed[*it]){
				it++;
				continue;
			}
			if(edgeW[*it] < w) break;
			else neworder.push_back(*it);
			it++;
		}
		neworder.push_back(e);
	}
	while(it != order.end()){
		if(not changed[*it]) neworder.push_back(*it);
		it++;
	}
	
	for(int e : C) changed[e] = false;
	swap(order,neworder); neworder.clear();	
}

vector<int> adj[50005];
bool vis[50005];

int dfs(int u){
	int res = sz[u];
	vis[u] = true;
	for(int v : adj[u]){
		if(not vis[v]){
			res += dfs(v);
		}
	}
	return res;
}


inline void solve(int L, int R){
	catchup(L);
	
	vector<int> stuff;
	vector<int> changededges;
	for(int i = L;i <= R;i++){
		stuff.push_back(i);
		if(T[i] == UPD) changededges.push_back(X[i]);
	}
	
	for(int x : changededges) changed[x] = true;
	
	reset();
	sort(all(stuff), [&](int a, int b){ return queryW[a] > queryW[b]; });
	
	auto it = order.begin();
	for(int qid : stuff){ ///decreasing w
		int w = queryW[qid];
		if(T[qid] == UPD) continue;
		
		while(it != order.end()){
			if(edgeW[*it] < w) break;
			else{
				int e = *it;
				if(not changed[e]){
					unionSet(U[e], V[e]);
				}
				it++;
			}
		}
		
		///if is query
		vector<int> special;
		for(int e : changededges){
			auto it = upper_bound(all(history[e]), ii(qid,-1)); it--;
			if(it->second < w) continue; ///edge weight not enough to handle car weight
			
			int u = findSet(U[e]), v = findSet(V[e]);
			if(u == v){
				special.push_back(u);
			}
			else{
				adj[u].push_back(v);
				adj[v].push_back(u);
				special.push_back(u);
				special.push_back(v);
			}
		}
		
		int source = findSet(X[qid]);
		special.push_back(source);
		
		int res = dfs(source);
		ans[qid] = res;
		
		///reset the stuff
		for(int u : special) vis[u] = false, adj[u].clear();
	}
	///reset the stuff
	for(int e : changededges) changed[e] = false;
}

const int B = 300;

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n >> m;
	for(int i = 1;i <= m;i++) cin >> U[i] >> V[i] >> edgeW[i];
	sort(all(order), [&](int a, int b){ return edgeW[a] > edgeW[b]; });
	cin >> Q;
	for(int i = 1;i <= Q;i++) cin >> T[i] >> X[i] >> queryW[i];
	
	order.resize(m);
	for(int i = 1;i <= m;i++) order[i-1] = i;
	sort(all(order), [&](int a, int b){ return edgeW[a] > edgeW[b]; });
	
	for(int i = 1;i <= m;i++) history[i].push_back(ii(0, edgeW[i]));
	for(int i = 1;i <= Q;i++){
		if(T[i] == UPD) history[X[i]].push_back(ii(i, queryW[i]));
	}
	
	///bruh prunning
	int L = -1, R = -1, cnt = 0;
	for(int i = 1;i <= Q;i++){
		if(L == -1){
			if(T[i] == QRY) L = i, R = i;
		}
		else{
			if(T[i] == UPD) cnt++;
			else R = i;
		}
		
		if(cnt >= B or i == Q){
			solve(L,R);
			cnt = 0, L = -1, R = -1;
		}
	}
	
	for(int i = 1;i <= Q;i++){
		if(T[i] == QRY) cout << ans[i] << '\n';
	}
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 50 ms 4140 KB Output is correct
4 Correct 8 ms 4044 KB Output is correct
5 Correct 86 ms 4112 KB Output is correct
6 Correct 79 ms 4044 KB Output is correct
7 Correct 83 ms 4044 KB Output is correct
8 Correct 85 ms 4088 KB Output is correct
9 Correct 102 ms 4112 KB Output is correct
10 Correct 84 ms 4096 KB Output is correct
11 Correct 82 ms 4112 KB Output is correct
12 Correct 89 ms 4100 KB Output is correct
13 Correct 83 ms 4164 KB Output is correct
14 Correct 79 ms 4228 KB Output is correct
15 Correct 93 ms 4044 KB Output is correct
16 Correct 89 ms 4108 KB Output is correct
17 Correct 88 ms 4108 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1214 ms 10204 KB Output is correct
2 Correct 1178 ms 10172 KB Output is correct
3 Correct 1146 ms 10116 KB Output is correct
4 Correct 1185 ms 10256 KB Output is correct
5 Correct 1147 ms 10176 KB Output is correct
6 Correct 1656 ms 9444 KB Output is correct
7 Correct 1682 ms 9428 KB Output is correct
8 Correct 1512 ms 9504 KB Output is correct
9 Correct 53 ms 5900 KB Output is correct
10 Correct 1374 ms 10124 KB Output is correct
11 Correct 1176 ms 10196 KB Output is correct
12 Correct 1961 ms 9100 KB Output is correct
13 Correct 944 ms 9796 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1131 ms 10952 KB Output is correct
2 Correct 1085 ms 9092 KB Output is correct
3 Correct 1394 ms 13480 KB Output is correct
4 Correct 1210 ms 16056 KB Output is correct
5 Correct 51 ms 5928 KB Output is correct
6 Correct 1387 ms 14160 KB Output is correct
7 Correct 1143 ms 14072 KB Output is correct
8 Correct 1018 ms 12564 KB Output is correct
9 Correct 1556 ms 13904 KB Output is correct
10 Correct 1161 ms 11904 KB Output is correct
11 Correct 910 ms 12528 KB Output is correct
12 Correct 827 ms 11408 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 11624 KB Output is correct
2 Correct 61 ms 5940 KB Output is correct
3 Correct 58 ms 9248 KB Output is correct
4 Correct 51 ms 9280 KB Output is correct
5 Correct 95 ms 11572 KB Output is correct
6 Correct 134 ms 11504 KB Output is correct
7 Correct 100 ms 11452 KB Output is correct
8 Correct 92 ms 8884 KB Output is correct
9 Correct 93 ms 8820 KB Output is correct
10 Correct 92 ms 8836 KB Output is correct
11 Correct 120 ms 10084 KB Output is correct
12 Correct 102 ms 10128 KB Output is correct
13 Correct 106 ms 10276 KB Output is correct
14 Correct 83 ms 11568 KB Output is correct
15 Correct 104 ms 11464 KB Output is correct
16 Correct 116 ms 11428 KB Output is correct
17 Correct 120 ms 11412 KB Output is correct
18 Correct 116 ms 11396 KB Output is correct
19 Correct 124 ms 11420 KB Output is correct
20 Correct 104 ms 10764 KB Output is correct
21 Correct 106 ms 10804 KB Output is correct
22 Correct 119 ms 11376 KB Output is correct
23 Correct 97 ms 10728 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1214 ms 10204 KB Output is correct
2 Correct 1178 ms 10172 KB Output is correct
3 Correct 1146 ms 10116 KB Output is correct
4 Correct 1185 ms 10256 KB Output is correct
5 Correct 1147 ms 10176 KB Output is correct
6 Correct 1656 ms 9444 KB Output is correct
7 Correct 1682 ms 9428 KB Output is correct
8 Correct 1512 ms 9504 KB Output is correct
9 Correct 53 ms 5900 KB Output is correct
10 Correct 1374 ms 10124 KB Output is correct
11 Correct 1176 ms 10196 KB Output is correct
12 Correct 1961 ms 9100 KB Output is correct
13 Correct 944 ms 9796 KB Output is correct
14 Correct 1131 ms 10952 KB Output is correct
15 Correct 1085 ms 9092 KB Output is correct
16 Correct 1394 ms 13480 KB Output is correct
17 Correct 1210 ms 16056 KB Output is correct
18 Correct 51 ms 5928 KB Output is correct
19 Correct 1387 ms 14160 KB Output is correct
20 Correct 1143 ms 14072 KB Output is correct
21 Correct 1018 ms 12564 KB Output is correct
22 Correct 1556 ms 13904 KB Output is correct
23 Correct 1161 ms 11904 KB Output is correct
24 Correct 910 ms 12528 KB Output is correct
25 Correct 827 ms 11408 KB Output is correct
26 Correct 1512 ms 13316 KB Output is correct
27 Correct 1861 ms 13052 KB Output is correct
28 Correct 1616 ms 18852 KB Output is correct
29 Correct 1159 ms 15320 KB Output is correct
30 Correct 1569 ms 12880 KB Output is correct
31 Correct 1685 ms 12796 KB Output is correct
32 Correct 1591 ms 12904 KB Output is correct
33 Correct 1338 ms 12948 KB Output is correct
34 Correct 1420 ms 12976 KB Output is correct
35 Correct 1403 ms 13088 KB Output is correct
36 Correct 1100 ms 12888 KB Output is correct
37 Correct 1092 ms 13004 KB Output is correct
38 Correct 1076 ms 12944 KB Output is correct
39 Correct 860 ms 12156 KB Output is correct
40 Correct 864 ms 12112 KB Output is correct
41 Correct 811 ms 12232 KB Output is correct
42 Correct 967 ms 13504 KB Output is correct
43 Correct 998 ms 13632 KB Output is correct
44 Correct 1016 ms 13436 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 50 ms 4140 KB Output is correct
4 Correct 8 ms 4044 KB Output is correct
5 Correct 86 ms 4112 KB Output is correct
6 Correct 79 ms 4044 KB Output is correct
7 Correct 83 ms 4044 KB Output is correct
8 Correct 85 ms 4088 KB Output is correct
9 Correct 102 ms 4112 KB Output is correct
10 Correct 84 ms 4096 KB Output is correct
11 Correct 82 ms 4112 KB Output is correct
12 Correct 89 ms 4100 KB Output is correct
13 Correct 83 ms 4164 KB Output is correct
14 Correct 79 ms 4228 KB Output is correct
15 Correct 93 ms 4044 KB Output is correct
16 Correct 89 ms 4108 KB Output is correct
17 Correct 88 ms 4108 KB Output is correct
18 Correct 1214 ms 10204 KB Output is correct
19 Correct 1178 ms 10172 KB Output is correct
20 Correct 1146 ms 10116 KB Output is correct
21 Correct 1185 ms 10256 KB Output is correct
22 Correct 1147 ms 10176 KB Output is correct
23 Correct 1656 ms 9444 KB Output is correct
24 Correct 1682 ms 9428 KB Output is correct
25 Correct 1512 ms 9504 KB Output is correct
26 Correct 53 ms 5900 KB Output is correct
27 Correct 1374 ms 10124 KB Output is correct
28 Correct 1176 ms 10196 KB Output is correct
29 Correct 1961 ms 9100 KB Output is correct
30 Correct 944 ms 9796 KB Output is correct
31 Correct 1131 ms 10952 KB Output is correct
32 Correct 1085 ms 9092 KB Output is correct
33 Correct 1394 ms 13480 KB Output is correct
34 Correct 1210 ms 16056 KB Output is correct
35 Correct 51 ms 5928 KB Output is correct
36 Correct 1387 ms 14160 KB Output is correct
37 Correct 1143 ms 14072 KB Output is correct
38 Correct 1018 ms 12564 KB Output is correct
39 Correct 1556 ms 13904 KB Output is correct
40 Correct 1161 ms 11904 KB Output is correct
41 Correct 910 ms 12528 KB Output is correct
42 Correct 827 ms 11408 KB Output is correct
43 Correct 125 ms 11624 KB Output is correct
44 Correct 61 ms 5940 KB Output is correct
45 Correct 58 ms 9248 KB Output is correct
46 Correct 51 ms 9280 KB Output is correct
47 Correct 95 ms 11572 KB Output is correct
48 Correct 134 ms 11504 KB Output is correct
49 Correct 100 ms 11452 KB Output is correct
50 Correct 92 ms 8884 KB Output is correct
51 Correct 93 ms 8820 KB Output is correct
52 Correct 92 ms 8836 KB Output is correct
53 Correct 120 ms 10084 KB Output is correct
54 Correct 102 ms 10128 KB Output is correct
55 Correct 106 ms 10276 KB Output is correct
56 Correct 83 ms 11568 KB Output is correct
57 Correct 104 ms 11464 KB Output is correct
58 Correct 116 ms 11428 KB Output is correct
59 Correct 120 ms 11412 KB Output is correct
60 Correct 116 ms 11396 KB Output is correct
61 Correct 124 ms 11420 KB Output is correct
62 Correct 104 ms 10764 KB Output is correct
63 Correct 106 ms 10804 KB Output is correct
64 Correct 119 ms 11376 KB Output is correct
65 Correct 97 ms 10728 KB Output is correct
66 Correct 1512 ms 13316 KB Output is correct
67 Correct 1861 ms 13052 KB Output is correct
68 Correct 1616 ms 18852 KB Output is correct
69 Correct 1159 ms 15320 KB Output is correct
70 Correct 1569 ms 12880 KB Output is correct
71 Correct 1685 ms 12796 KB Output is correct
72 Correct 1591 ms 12904 KB Output is correct
73 Correct 1338 ms 12948 KB Output is correct
74 Correct 1420 ms 12976 KB Output is correct
75 Correct 1403 ms 13088 KB Output is correct
76 Correct 1100 ms 12888 KB Output is correct
77 Correct 1092 ms 13004 KB Output is correct
78 Correct 1076 ms 12944 KB Output is correct
79 Correct 860 ms 12156 KB Output is correct
80 Correct 864 ms 12112 KB Output is correct
81 Correct 811 ms 12232 KB Output is correct
82 Correct 967 ms 13504 KB Output is correct
83 Correct 998 ms 13632 KB Output is correct
84 Correct 1016 ms 13436 KB Output is correct
85 Correct 2115 ms 18992 KB Output is correct
86 Correct 128 ms 11132 KB Output is correct
87 Correct 100 ms 11652 KB Output is correct
88 Correct 1731 ms 14608 KB Output is correct
89 Correct 2147 ms 19020 KB Output is correct
90 Correct 1662 ms 14572 KB Output is correct
91 Correct 1349 ms 13128 KB Output is correct
92 Correct 1333 ms 13040 KB Output is correct
93 Correct 1603 ms 12340 KB Output is correct
94 Correct 1463 ms 14424 KB Output is correct
95 Correct 1528 ms 14652 KB Output is correct
96 Correct 1398 ms 13676 KB Output is correct
97 Correct 1029 ms 14008 KB Output is correct
98 Correct 2154 ms 15024 KB Output is correct
99 Correct 2166 ms 17000 KB Output is correct
100 Correct 1989 ms 16888 KB Output is correct
101 Correct 1949 ms 16892 KB Output is correct
102 Correct 2072 ms 16808 KB Output is correct
103 Correct 1495 ms 14412 KB Output is correct
104 Correct 1507 ms 14276 KB Output is correct
105 Correct 1763 ms 14860 KB Output is correct
106 Correct 1537 ms 14192 KB Output is correct
107 Correct 1052 ms 14144 KB Output is correct
108 Correct 1936 ms 15552 KB Output is correct
109 Correct 1507 ms 13340 KB Output is correct