oj.uz

Submission #259274

# Submission time Handle Problem Language Result Execution time Memory
259274 2020-08-07T13:32:06 Z alishahali1382 Bridges (APIO19_bridges) C++14
100 / 100
 2961 ms 7156 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010, SQ=600;

int n, m, q, u, v, x, y, t, a, b;
int E[MAXN][2], W[MAXN], W2[MAXN];
int typ[MAXN], A[MAXN], B[MAXN], ans[MAXN];
int ind[MAXN], ind1[MAXN], ind2[MAXN], m1, m2;
int par[MAXN], sz[MAXN], par2[MAXN], sz2[MAXN], comp[MAXN];
int bad[MAXN], vec[MAXN], ted;
pii Q[SQ+1];

inline bool cmp(int x, int y){ return W[x]>W[y];}
int getpar(int x){ return (par[x]==x?x:par[x]=getpar(par[x]));}
inline void join(int x, int y){
	x=getpar(x);
	y=getpar(y);
	if (x==y) return ;
	sz[x]+=sz[y];
	par[y]=x;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=m; i++) cin>>E[i][0]>>E[i][1]>>W[i], ind[i]=i;
	sort(ind+1, ind+m+1, cmp);
	cin>>q;
	for (int i=0; i<q; i++) cin>>typ[i]>>A[i]>>B[i];
	for (int block=0; block*SQ<q; block++){
		for (int i=1; i<=n; i++) par[i]=i, sz[i]=1;
		int ql=block*SQ, qr=min(q, ql+SQ);
		ted=0;
		for (int i=ql; i<qr; i++){
			if (typ[i]==1) bad[A[i]]=1;
			else vec[ted++]=A[i];
		}
		for (int i=1; i<=m; i++) if (bad[i]) vec[ted++]=E[i][0], vec[ted++]=E[i][1];
		sort(vec, vec+ted);
		ted=unique(vec, vec+ted)-vec;
		
		int qq=0;
		for (int i=ql; i<qr; i++) if (typ[i]==2) Q[++qq]={B[i], i};
		sort(Q+1, Q+qq+1);
		m1=m2=0;
		for (int i=1; i<=m; i++){
			if (bad[ind[i]]) ind1[++m1]=ind[i];
			else ind2[++m2]=ind[i];
		}
		
		ind2[m2+1]=0;
		for (int i=1; i<=m2+1; i++){
			int e=ind2[i];
			while (qq && Q[qq].first>W[e]){
				int id=Q[qq--].second;
				
				for (int j=0; j<ted; j++){
					int v=comp[vec[j]]=getpar(vec[j]);
					par2[v]=par[v], sz2[v]=sz[v];
				}
				for (int j=1; j<=m1; j++) W2[ind1[j]]=W[ind1[j]];
				for (int j=ql; j<id; j++) if (typ[j]==1) W2[A[j]]=B[j];
				
				for (int j=1; j<=m1; j++) if (W2[ind1[j]]>=B[id])
					join(comp[E[ind1[j]][0]], comp[E[ind1[j]][1]]);
				
				ans[id]=sz[getpar(comp[A[id]])];
				for (int j=0; j<ted; j++){
					int v=comp[vec[j]];
					par[v]=par2[v], sz[v]=sz2[v];
				}
			}
			join(E[e][0], E[e][1]);
		}
		for (int i=ql; i<qr; i++) if (typ[i]==1) W[A[i]]=B[i];
		sort(ind1+1, ind1+m1+1, cmp);
		merge(ind1+1, ind1+m1+1, ind2+1, ind2+m2+1, ind+1, cmp);
		
		for (int i=ql; i<qr; i++) if (typ[i]==1) bad[A[i]]=0;
	}
	for (int i=0; i<q; i++) if (typ[i]==2) cout<<ans[i]<<"\n";
	
	return 0;
}
/*
3 4
1 2 5
2 3 2
3 1 4
2 3 8
1
2 1 5


3 4
1 2 5
2 3 2
3 1 4
2 3 8
2
1 4 1
2 2 5


3 4
1 2 5
2 3 2
3 1 4
2 3 8
2
1 4 1
2 2 5


*/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 25 ms 640 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 17 ms 640 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 20 ms 640 KB Output is correct
8 Correct 22 ms 640 KB Output is correct
9 Correct 23 ms 632 KB Output is correct
10 Correct 20 ms 632 KB Output is correct
11 Correct 21 ms 632 KB Output is correct
12 Correct 24 ms 632 KB Output is correct
13 Correct 26 ms 640 KB Output is correct
14 Correct 24 ms 632 KB Output is correct
15 Correct 23 ms 632 KB Output is correct
16 Correct 21 ms 640 KB Output is correct
17 Correct 22 ms 640 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1791 ms 4408 KB Output is correct
2 Correct 1793 ms 4468 KB Output is correct
3 Correct 1760 ms 4472 KB Output is correct
4 Correct 1723 ms 4472 KB Output is correct
5 Correct 1736 ms 4456 KB Output is correct
6 Correct 1820 ms 4728 KB Output is correct
7 Correct 1833 ms 4712 KB Output is correct
8 Correct 1868 ms 4520 KB Output is correct
9 Correct 69 ms 2168 KB Output is correct
10 Correct 1716 ms 4624 KB Output is correct
11 Correct 1659 ms 4728 KB Output is correct
12 Correct 1770 ms 4984 KB Output is correct
13 Correct 855 ms 4472 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1576 ms 3696 KB Output is correct
2 Correct 1020 ms 2548 KB Output is correct
3 Correct 1542 ms 3872 KB Output is correct
4 Correct 1523 ms 3704 KB Output is correct
5 Correct 72 ms 2168 KB Output is correct
6 Correct 1545 ms 3960 KB Output is correct
7 Correct 1492 ms 4100 KB Output is correct
8 Correct 1452 ms 4008 KB Output is correct
9 Correct 1542 ms 4216 KB Output is correct
10 Correct 1617 ms 4216 KB Output is correct
11 Correct 652 ms 3960 KB Output is correct
12 Correct 607 ms 3832 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2795 ms 5272 KB Output is correct
2 Correct 84 ms 2296 KB Output is correct
3 Correct 127 ms 2680 KB Output is correct
4 Correct 96 ms 2808 KB Output is correct
5 Correct 2400 ms 5760 KB Output is correct
6 Correct 2817 ms 6056 KB Output is correct
7 Correct 2215 ms 5848 KB Output is correct
8 Correct 1653 ms 4460 KB Output is correct
9 Correct 1673 ms 4680 KB Output is correct
10 Correct 1516 ms 4600 KB Output is correct
11 Correct 2162 ms 5052 KB Output is correct
12 Correct 2165 ms 4952 KB Output is correct
13 Correct 1999 ms 5424 KB Output is correct
14 Correct 2299 ms 6008 KB Output is correct
15 Correct 2308 ms 5876 KB Output is correct
16 Correct 2768 ms 5796 KB Output is correct
17 Correct 2736 ms 5660 KB Output is correct
18 Correct 2645 ms 6040 KB Output is correct
19 Correct 2704 ms 5864 KB Output is correct
20 Correct 2088 ms 5628 KB Output is correct
21 Correct 2086 ms 5772 KB Output is correct
22 Correct 2551 ms 5856 KB Output is correct
23 Correct 2126 ms 5736 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1791 ms 4408 KB Output is correct
2 Correct 1793 ms 4468 KB Output is correct
3 Correct 1760 ms 4472 KB Output is correct
4 Correct 1723 ms 4472 KB Output is correct
5 Correct 1736 ms 4456 KB Output is correct
6 Correct 1820 ms 4728 KB Output is correct
7 Correct 1833 ms 4712 KB Output is correct
8 Correct 1868 ms 4520 KB Output is correct
9 Correct 69 ms 2168 KB Output is correct
10 Correct 1716 ms 4624 KB Output is correct
11 Correct 1659 ms 4728 KB Output is correct
12 Correct 1770 ms 4984 KB Output is correct
13 Correct 855 ms 4472 KB Output is correct
14 Correct 1576 ms 3696 KB Output is correct
15 Correct 1020 ms 2548 KB Output is correct
16 Correct 1542 ms 3872 KB Output is correct
17 Correct 1523 ms 3704 KB Output is correct
18 Correct 72 ms 2168 KB Output is correct
19 Correct 1545 ms 3960 KB Output is correct
20 Correct 1492 ms 4100 KB Output is correct
21 Correct 1452 ms 4008 KB Output is correct
22 Correct 1542 ms 4216 KB Output is correct
23 Correct 1617 ms 4216 KB Output is correct
24 Correct 652 ms 3960 KB Output is correct
25 Correct 607 ms 3832 KB Output is correct
26 Correct 1935 ms 4924 KB Output is correct
27 Correct 2259 ms 4984 KB Output is correct
28 Correct 2250 ms 4784 KB Output is correct
29 Correct 2052 ms 4856 KB Output is correct
30 Correct 2095 ms 4884 KB Output is correct
31 Correct 2111 ms 4916 KB Output is correct
32 Correct 2170 ms 4964 KB Output is correct
33 Correct 2078 ms 4928 KB Output is correct
34 Correct 2071 ms 4984 KB Output is correct
35 Correct 2102 ms 4728 KB Output is correct
36 Correct 1940 ms 4812 KB Output is correct
37 Correct 1980 ms 4856 KB Output is correct
38 Correct 1943 ms 4972 KB Output is correct
39 Correct 1912 ms 4924 KB Output is correct
40 Correct 1956 ms 4932 KB Output is correct
41 Correct 2061 ms 4856 KB Output is correct
42 Correct 943 ms 4728 KB Output is correct
43 Correct 911 ms 4728 KB Output is correct
44 Correct 911 ms 4600 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 25 ms 640 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 17 ms 640 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 20 ms 640 KB Output is correct
8 Correct 22 ms 640 KB Output is correct
9 Correct 23 ms 632 KB Output is correct
10 Correct 20 ms 632 KB Output is correct
11 Correct 21 ms 632 KB Output is correct
12 Correct 24 ms 632 KB Output is correct
13 Correct 26 ms 640 KB Output is correct
14 Correct 24 ms 632 KB Output is correct
15 Correct 23 ms 632 KB Output is correct
16 Correct 21 ms 640 KB Output is correct
17 Correct 22 ms 640 KB Output is correct
18 Correct 1791 ms 4408 KB Output is correct
19 Correct 1793 ms 4468 KB Output is correct
20 Correct 1760 ms 4472 KB Output is correct
21 Correct 1723 ms 4472 KB Output is correct
22 Correct 1736 ms 4456 KB Output is correct
23 Correct 1820 ms 4728 KB Output is correct
24 Correct 1833 ms 4712 KB Output is correct
25 Correct 1868 ms 4520 KB Output is correct
26 Correct 69 ms 2168 KB Output is correct
27 Correct 1716 ms 4624 KB Output is correct
28 Correct 1659 ms 4728 KB Output is correct
29 Correct 1770 ms 4984 KB Output is correct
30 Correct 855 ms 4472 KB Output is correct
31 Correct 1576 ms 3696 KB Output is correct
32 Correct 1020 ms 2548 KB Output is correct
33 Correct 1542 ms 3872 KB Output is correct
34 Correct 1523 ms 3704 KB Output is correct
35 Correct 72 ms 2168 KB Output is correct
36 Correct 1545 ms 3960 KB Output is correct
37 Correct 1492 ms 4100 KB Output is correct
38 Correct 1452 ms 4008 KB Output is correct
39 Correct 1542 ms 4216 KB Output is correct
40 Correct 1617 ms 4216 KB Output is correct
41 Correct 652 ms 3960 KB Output is correct
42 Correct 607 ms 3832 KB Output is correct
43 Correct 2795 ms 5272 KB Output is correct
44 Correct 84 ms 2296 KB Output is correct
45 Correct 127 ms 2680 KB Output is correct
46 Correct 96 ms 2808 KB Output is correct
47 Correct 2400 ms 5760 KB Output is correct
48 Correct 2817 ms 6056 KB Output is correct
49 Correct 2215 ms 5848 KB Output is correct
50 Correct 1653 ms 4460 KB Output is correct
51 Correct 1673 ms 4680 KB Output is correct
52 Correct 1516 ms 4600 KB Output is correct
53 Correct 2162 ms 5052 KB Output is correct
54 Correct 2165 ms 4952 KB Output is correct
55 Correct 1999 ms 5424 KB Output is correct
56 Correct 2299 ms 6008 KB Output is correct
57 Correct 2308 ms 5876 KB Output is correct
58 Correct 2768 ms 5796 KB Output is correct
59 Correct 2736 ms 5660 KB Output is correct
60 Correct 2645 ms 6040 KB Output is correct
61 Correct 2704 ms 5864 KB Output is correct
62 Correct 2088 ms 5628 KB Output is correct
63 Correct 2086 ms 5772 KB Output is correct
64 Correct 2551 ms 5856 KB Output is correct
65 Correct 2126 ms 5736 KB Output is correct
66 Correct 1935 ms 4924 KB Output is correct
67 Correct 2259 ms 4984 KB Output is correct
68 Correct 2250 ms 4784 KB Output is correct
69 Correct 2052 ms 4856 KB Output is correct
70 Correct 2095 ms 4884 KB Output is correct
71 Correct 2111 ms 4916 KB Output is correct
72 Correct 2170 ms 4964 KB Output is correct
73 Correct 2078 ms 4928 KB Output is correct
74 Correct 2071 ms 4984 KB Output is correct
75 Correct 2102 ms 4728 KB Output is correct
76 Correct 1940 ms 4812 KB Output is correct
77 Correct 1980 ms 4856 KB Output is correct
78 Correct 1943 ms 4972 KB Output is correct
79 Correct 1912 ms 4924 KB Output is correct
80 Correct 1956 ms 4932 KB Output is correct
81 Correct 2061 ms 4856 KB Output is correct
82 Correct 943 ms 4728 KB Output is correct
83 Correct 911 ms 4728 KB Output is correct
84 Correct 911 ms 4600 KB Output is correct
85 Correct 2961 ms 6900 KB Output is correct
86 Correct 128 ms 4216 KB Output is correct
87 Correct 97 ms 4216 KB Output is correct
88 Correct 2517 ms 6780 KB Output is correct
89 Correct 2897 ms 6704 KB Output is correct
90 Correct 2512 ms 6660 KB Output is correct
91 Correct 2035 ms 5368 KB Output is correct
92 Correct 2049 ms 5368 KB Output is correct
93 Correct 2071 ms 5408 KB Output is correct
94 Correct 2181 ms 6160 KB Output is correct
95 Correct 2333 ms 5984 KB Output is correct
96 Correct 1847 ms 6080 KB Output is correct
97 Correct 2483 ms 6868 KB Output is correct
98 Correct 1606 ms 6340 KB Output is correct
99 Correct 2852 ms 7052 KB Output is correct
100 Correct 2731 ms 6812 KB Output is correct
101 Correct 2676 ms 6788 KB Output is correct
102 Correct 2786 ms 7156 KB Output is correct
103 Correct 1917 ms 6340 KB Output is correct
104 Correct 1926 ms 6172 KB Output is correct
105 Correct 1204 ms 6008 KB Output is correct
106 Correct 960 ms 5880 KB Output is correct
107 Correct 2135 ms 6356 KB Output is correct
108 Correct 2690 ms 6308 KB Output is correct
109 Correct 2073 ms 6264 KB Output is correct