oj.uz

답안 #386361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386361 2021-04-06T12:57:19 Z Bill_00 다리 (APIO19_bridges) C++14
100 / 100
 2702 ms 11360 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define N 100005
const int c=1000;
using namespace std;
int n,m,q;
int u[N],v[N],w[N],type[N],a[N],b[N],y[N];
int id[N],sz[N],p[N],ans[N];
int find(int node){
	return (node==p[node]?node:find(p[node]));
}
int main(){
	ios_base::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] >> w[i];
	}
	cin >> q;
	for(int i=1;i<=q;i++){
		cin >> type[i] >> a[i] >> b[i];
	}
	for(int i=0;i<=(q-1)/c;i++){
		for(int j=1;j<=n;j++){
			p[j]=j;
			sz[j]=1;
		}
		vector<pair<pair<int,int>,int> >vv;
		for(int j=i*c+1;j<=min(q,(i+1)*c);j++){
			if(type[j]==1){
				id[a[j]]=i+1;
			}
			else{
				vv.pb({{-b[j],1},j});
			}
		}
		vector<int>vec;
		for(int j=1;j<=m;j++){
			if(id[j]!=(i+1)){
				vv.pb({{-w[j],0},j});
			}
			else{
				vec.pb(j);
			}
		}
		sort(vv.begin(),vv.end());
		for(int j=0;j<vv.size();j++){
			if(vv[j].ff.ss==0){
				int k=vv[j].ss;
				int aa=find(u[k]);
				int bb=find(v[k]);
				if(aa==bb) continue;
				if(sz[aa]>sz[bb]){
					p[bb]=aa;
					sz[aa]+=sz[bb];
				}
				else{
					p[aa]=bb;
					sz[bb]+=sz[aa];
				}
			}
			else{
				stack<pair<pair<int,int>,pair<int,int> > >st;
				int k=vv[j].ss;
				for(int t:vec) y[t]=-1;
				for(int t=i*c+1;t<=k;t++){
					if(type[t]==1){
						y[a[t]]=b[t];
					}
				}
				for(int t=k;t<=min(q,(i+1)*c);t++){
					if(type[t]==1 && y[a[t]]==-1) y[a[t]]=w[a[t]];
				}
				for(int t:vec){
					if(y[t]>=b[k]){
						int aa=find(u[t]);
						int bb=find(v[t]);
						if(aa==bb) continue;
						st.push({{aa,sz[aa]},{bb,sz[bb]}});
						if(sz[aa]>sz[bb]){
							p[bb]=aa;
							sz[aa]+=sz[bb];
						}
						else{
							p[aa]=bb;
							sz[bb]+=sz[aa];
						}
					}
				}
				int aa=find(a[k]);
				ans[k]=sz[aa];
				while(!st.empty()){
					p[st.top().ff.ff]=st.top().ff.ff;
					p[st.top().ss.ff]=st.top().ss.ff;
					sz[st.top().ff.ff]=st.top().ff.ss;
					sz[st.top().ss.ff]=st.top().ss.ss;
					st.pop();
				}
			}
		}
		for(int j=i*c+1;j<=min(q,(i+1)*c);j++){
			if(type[j]==1){
				w[a[j]]=b[j];
			}
		}
	}
	for(int i=1;i<=q;i++){
		if(type[i]==2){
			cout << ans[i] << '\n';
		}
	}

}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:51:16: 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]
   51 |   for(int j=0;j<vv.size();j++){
      |               ~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 620 KB Output is correct
4 Correct 15 ms 620 KB Output is correct
5 Correct 22 ms 620 KB Output is correct
6 Correct 20 ms 620 KB Output is correct
7 Correct 25 ms 620 KB Output is correct
8 Correct 26 ms 620 KB Output is correct
9 Correct 29 ms 620 KB Output is correct
10 Correct 32 ms 620 KB Output is correct
11 Correct 26 ms 620 KB Output is correct
12 Correct 29 ms 620 KB Output is correct
13 Correct 33 ms 620 KB Output is correct
14 Correct 31 ms 620 KB Output is correct
15 Correct 27 ms 620 KB Output is correct
16 Correct 26 ms 620 KB Output is correct
17 Correct 27 ms 620 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1805 ms 4756 KB Output is correct
2 Correct 1757 ms 4996 KB Output is correct
3 Correct 1763 ms 4868 KB Output is correct
4 Correct 1772 ms 4924 KB Output is correct
5 Correct 1796 ms 4924 KB Output is correct
6 Correct 2453 ms 4900 KB Output is correct
7 Correct 2441 ms 5104 KB Output is correct
8 Correct 2423 ms 5068 KB Output is correct
9 Correct 128 ms 2156 KB Output is correct
10 Correct 1785 ms 5032 KB Output is correct
11 Correct 1766 ms 4960 KB Output is correct
12 Correct 1580 ms 4840 KB Output is correct
13 Correct 1355 ms 4744 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1498 ms 4172 KB Output is correct
2 Correct 1067 ms 2684 KB Output is correct
3 Correct 1697 ms 4248 KB Output is correct
4 Correct 1441 ms 4312 KB Output is correct
5 Correct 134 ms 2156 KB Output is correct
6 Correct 1604 ms 4084 KB Output is correct
7 Correct 1346 ms 4220 KB Output is correct
8 Correct 1194 ms 4308 KB Output is correct
9 Correct 1041 ms 4292 KB Output is correct
10 Correct 968 ms 4348 KB Output is correct
11 Correct 940 ms 3632 KB Output is correct
12 Correct 798 ms 3640 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1949 ms 6656 KB Output is correct
2 Correct 132 ms 3564 KB Output is correct
3 Correct 193 ms 6344 KB Output is correct
4 Correct 212 ms 6468 KB Output is correct
5 Correct 1998 ms 8792 KB Output is correct
6 Correct 1922 ms 10336 KB Output is correct
7 Correct 1991 ms 8716 KB Output is correct
8 Correct 1008 ms 7104 KB Output is correct
9 Correct 993 ms 7388 KB Output is correct
10 Correct 1008 ms 6912 KB Output is correct
11 Correct 1519 ms 9132 KB Output is correct
12 Correct 1491 ms 9096 KB Output is correct
13 Correct 1537 ms 8856 KB Output is correct
14 Correct 1830 ms 8948 KB Output is correct
15 Correct 1914 ms 8840 KB Output is correct
16 Correct 1934 ms 10124 KB Output is correct
17 Correct 1912 ms 10392 KB Output is correct
18 Correct 1972 ms 10176 KB Output is correct
19 Correct 1953 ms 10452 KB Output is correct
20 Correct 1661 ms 9420 KB Output is correct
21 Correct 1697 ms 9372 KB Output is correct
22 Correct 1848 ms 9908 KB Output is correct
23 Correct 1775 ms 8204 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1805 ms 4756 KB Output is correct
2 Correct 1757 ms 4996 KB Output is correct
3 Correct 1763 ms 4868 KB Output is correct
4 Correct 1772 ms 4924 KB Output is correct
5 Correct 1796 ms 4924 KB Output is correct
6 Correct 2453 ms 4900 KB Output is correct
7 Correct 2441 ms 5104 KB Output is correct
8 Correct 2423 ms 5068 KB Output is correct
9 Correct 128 ms 2156 KB Output is correct
10 Correct 1785 ms 5032 KB Output is correct
11 Correct 1766 ms 4960 KB Output is correct
12 Correct 1580 ms 4840 KB Output is correct
13 Correct 1355 ms 4744 KB Output is correct
14 Correct 1498 ms 4172 KB Output is correct
15 Correct 1067 ms 2684 KB Output is correct
16 Correct 1697 ms 4248 KB Output is correct
17 Correct 1441 ms 4312 KB Output is correct
18 Correct 134 ms 2156 KB Output is correct
19 Correct 1604 ms 4084 KB Output is correct
20 Correct 1346 ms 4220 KB Output is correct
21 Correct 1194 ms 4308 KB Output is correct
22 Correct 1041 ms 4292 KB Output is correct
23 Correct 968 ms 4348 KB Output is correct
24 Correct 940 ms 3632 KB Output is correct
25 Correct 798 ms 3640 KB Output is correct
26 Correct 1954 ms 4856 KB Output is correct
27 Correct 2207 ms 7368 KB Output is correct
28 Correct 1938 ms 7868 KB Output is correct
29 Correct 1453 ms 7556 KB Output is correct
30 Correct 2254 ms 7444 KB Output is correct
31 Correct 2221 ms 7680 KB Output is correct
32 Correct 2209 ms 7356 KB Output is correct
33 Correct 1917 ms 7664 KB Output is correct
34 Correct 1981 ms 7844 KB Output is correct
35 Correct 1991 ms 7528 KB Output is correct
36 Correct 1491 ms 7456 KB Output is correct
37 Correct 1483 ms 7716 KB Output is correct
38 Correct 1469 ms 7460 KB Output is correct
39 Correct 1229 ms 7676 KB Output is correct
40 Correct 1225 ms 7900 KB Output is correct
41 Correct 1241 ms 7648 KB Output is correct
42 Correct 1121 ms 7584 KB Output is correct
43 Correct 1138 ms 7540 KB Output is correct
44 Correct 1103 ms 7416 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 41 ms 620 KB Output is correct
4 Correct 15 ms 620 KB Output is correct
5 Correct 22 ms 620 KB Output is correct
6 Correct 20 ms 620 KB Output is correct
7 Correct 25 ms 620 KB Output is correct
8 Correct 26 ms 620 KB Output is correct
9 Correct 29 ms 620 KB Output is correct
10 Correct 32 ms 620 KB Output is correct
11 Correct 26 ms 620 KB Output is correct
12 Correct 29 ms 620 KB Output is correct
13 Correct 33 ms 620 KB Output is correct
14 Correct 31 ms 620 KB Output is correct
15 Correct 27 ms 620 KB Output is correct
16 Correct 26 ms 620 KB Output is correct
17 Correct 27 ms 620 KB Output is correct
18 Correct 1805 ms 4756 KB Output is correct
19 Correct 1757 ms 4996 KB Output is correct
20 Correct 1763 ms 4868 KB Output is correct
21 Correct 1772 ms 4924 KB Output is correct
22 Correct 1796 ms 4924 KB Output is correct
23 Correct 2453 ms 4900 KB Output is correct
24 Correct 2441 ms 5104 KB Output is correct
25 Correct 2423 ms 5068 KB Output is correct
26 Correct 128 ms 2156 KB Output is correct
27 Correct 1785 ms 5032 KB Output is correct
28 Correct 1766 ms 4960 KB Output is correct
29 Correct 1580 ms 4840 KB Output is correct
30 Correct 1355 ms 4744 KB Output is correct
31 Correct 1498 ms 4172 KB Output is correct
32 Correct 1067 ms 2684 KB Output is correct
33 Correct 1697 ms 4248 KB Output is correct
34 Correct 1441 ms 4312 KB Output is correct
35 Correct 134 ms 2156 KB Output is correct
36 Correct 1604 ms 4084 KB Output is correct
37 Correct 1346 ms 4220 KB Output is correct
38 Correct 1194 ms 4308 KB Output is correct
39 Correct 1041 ms 4292 KB Output is correct
40 Correct 968 ms 4348 KB Output is correct
41 Correct 940 ms 3632 KB Output is correct
42 Correct 798 ms 3640 KB Output is correct
43 Correct 1949 ms 6656 KB Output is correct
44 Correct 132 ms 3564 KB Output is correct
45 Correct 193 ms 6344 KB Output is correct
46 Correct 212 ms 6468 KB Output is correct
47 Correct 1998 ms 8792 KB Output is correct
48 Correct 1922 ms 10336 KB Output is correct
49 Correct 1991 ms 8716 KB Output is correct
50 Correct 1008 ms 7104 KB Output is correct
51 Correct 993 ms 7388 KB Output is correct
52 Correct 1008 ms 6912 KB Output is correct
53 Correct 1519 ms 9132 KB Output is correct
54 Correct 1491 ms 9096 KB Output is correct
55 Correct 1537 ms 8856 KB Output is correct
56 Correct 1830 ms 8948 KB Output is correct
57 Correct 1914 ms 8840 KB Output is correct
58 Correct 1934 ms 10124 KB Output is correct
59 Correct 1912 ms 10392 KB Output is correct
60 Correct 1972 ms 10176 KB Output is correct
61 Correct 1953 ms 10452 KB Output is correct
62 Correct 1661 ms 9420 KB Output is correct
63 Correct 1697 ms 9372 KB Output is correct
64 Correct 1848 ms 9908 KB Output is correct
65 Correct 1775 ms 8204 KB Output is correct
66 Correct 1954 ms 4856 KB Output is correct
67 Correct 2207 ms 7368 KB Output is correct
68 Correct 1938 ms 7868 KB Output is correct
69 Correct 1453 ms 7556 KB Output is correct
70 Correct 2254 ms 7444 KB Output is correct
71 Correct 2221 ms 7680 KB Output is correct
72 Correct 2209 ms 7356 KB Output is correct
73 Correct 1917 ms 7664 KB Output is correct
74 Correct 1981 ms 7844 KB Output is correct
75 Correct 1991 ms 7528 KB Output is correct
76 Correct 1491 ms 7456 KB Output is correct
77 Correct 1483 ms 7716 KB Output is correct
78 Correct 1469 ms 7460 KB Output is correct
79 Correct 1229 ms 7676 KB Output is correct
80 Correct 1225 ms 7900 KB Output is correct
81 Correct 1241 ms 7648 KB Output is correct
82 Correct 1121 ms 7584 KB Output is correct
83 Correct 1138 ms 7540 KB Output is correct
84 Correct 1103 ms 7416 KB Output is correct
85 Correct 2702 ms 10996 KB Output is correct
86 Correct 241 ms 7128 KB Output is correct
87 Correct 269 ms 7368 KB Output is correct
88 Correct 2512 ms 9360 KB Output is correct
89 Correct 2568 ms 10884 KB Output is correct
90 Correct 2509 ms 9016 KB Output is correct
91 Correct 2049 ms 7444 KB Output is correct
92 Correct 2013 ms 7520 KB Output is correct
93 Correct 2682 ms 7712 KB Output is correct
94 Correct 2175 ms 9508 KB Output is correct
95 Correct 2216 ms 9788 KB Output is correct
96 Correct 2468 ms 9292 KB Output is correct
97 Correct 2180 ms 9204 KB Output is correct
98 Correct 2147 ms 9296 KB Output is correct
99 Correct 2565 ms 11228 KB Output is correct
100 Correct 2558 ms 11120 KB Output is correct
101 Correct 2649 ms 11360 KB Output is correct
102 Correct 2661 ms 11220 KB Output is correct
103 Correct 2691 ms 9900 KB Output is correct
104 Correct 2694 ms 9924 KB Output is correct
105 Correct 1976 ms 9868 KB Output is correct
106 Correct 1604 ms 9260 KB Output is correct
107 Correct 2008 ms 9676 KB Output is correct
108 Correct 2525 ms 10204 KB Output is correct
109 Correct 2459 ms 8240 KB Output is correct