oj.uz

Submission #259277

# Submission time Handle Problem Language Result Execution time Memory
259277 2020-08-07T13:36:24 Z alishahali1382 Bridges (APIO19_bridges) C++14
100 / 100
 2967 ms 6292 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=640;

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;
}

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 26 ms 896 KB Output is correct
4 Correct 8 ms 640 KB Output is correct
5 Correct 16 ms 768 KB Output is correct
6 Correct 14 ms 768 KB Output is correct
7 Correct 21 ms 640 KB Output is correct
8 Correct 22 ms 768 KB Output is correct
9 Correct 23 ms 640 KB Output is correct
10 Correct 21 ms 768 KB Output is correct
11 Correct 21 ms 768 KB Output is correct
12 Correct 22 ms 896 KB Output is correct
13 Correct 26 ms 760 KB Output is correct
14 Correct 25 ms 768 KB Output is correct
15 Correct 23 ms 768 KB Output is correct
16 Correct 22 ms 640 KB Output is correct
17 Correct 21 ms 640 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1972 ms 5480 KB Output is correct
2 Correct 1907 ms 5112 KB Output is correct
3 Correct 1907 ms 4912 KB Output is correct
4 Correct 1826 ms 5168 KB Output is correct
5 Correct 1823 ms 4828 KB Output is correct
6 Correct 1949 ms 5432 KB Output is correct
7 Correct 1916 ms 5240 KB Output is correct
8 Correct 1921 ms 5544 KB Output is correct
9 Correct 69 ms 2680 KB Output is correct
10 Correct 1775 ms 5064 KB Output is correct
11 Correct 1753 ms 5200 KB Output is correct
12 Correct 1822 ms 5624 KB Output is correct
13 Correct 860 ms 4968 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1633 ms 4612 KB Output is correct
2 Correct 1090 ms 2968 KB Output is correct
3 Correct 1653 ms 4088 KB Output is correct
4 Correct 1650 ms 3960 KB Output is correct
5 Correct 71 ms 2424 KB Output is correct
6 Correct 1664 ms 4104 KB Output is correct
7 Correct 1567 ms 4156 KB Output is correct
8 Correct 1492 ms 3932 KB Output is correct
9 Correct 1692 ms 4352 KB Output is correct
10 Correct 1672 ms 4220 KB Output is correct
11 Correct 665 ms 4228 KB Output is correct
12 Correct 638 ms 3960 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2877 ms 5804 KB Output is correct
2 Correct 83 ms 2424 KB Output is correct
3 Correct 138 ms 2808 KB Output is correct
4 Correct 98 ms 2936 KB Output is correct
5 Correct 2415 ms 6040 KB Output is correct
6 Correct 2817 ms 5872 KB Output is correct
7 Correct 2387 ms 6008 KB Output is correct
8 Correct 1864 ms 4656 KB Output is correct
9 Correct 1861 ms 4644 KB Output is correct
10 Correct 1778 ms 4728 KB Output is correct
11 Correct 2189 ms 5508 KB Output is correct
12 Correct 2235 ms 5388 KB Output is correct
13 Correct 2090 ms 5624 KB Output is correct
14 Correct 2322 ms 5752 KB Output is correct
15 Correct 2344 ms 5764 KB Output is correct
16 Correct 2761 ms 5820 KB Output is correct
17 Correct 2754 ms 5848 KB Output is correct
18 Correct 2624 ms 5696 KB Output is correct
19 Correct 2702 ms 5616 KB Output is correct
20 Correct 2153 ms 5528 KB Output is correct
21 Correct 2103 ms 5528 KB Output is correct
22 Correct 2562 ms 5696 KB Output is correct
23 Correct 2152 ms 5596 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1972 ms 5480 KB Output is correct
2 Correct 1907 ms 5112 KB Output is correct
3 Correct 1907 ms 4912 KB Output is correct
4 Correct 1826 ms 5168 KB Output is correct
5 Correct 1823 ms 4828 KB Output is correct
6 Correct 1949 ms 5432 KB Output is correct
7 Correct 1916 ms 5240 KB Output is correct
8 Correct 1921 ms 5544 KB Output is correct
9 Correct 69 ms 2680 KB Output is correct
10 Correct 1775 ms 5064 KB Output is correct
11 Correct 1753 ms 5200 KB Output is correct
12 Correct 1822 ms 5624 KB Output is correct
13 Correct 860 ms 4968 KB Output is correct
14 Correct 1633 ms 4612 KB Output is correct
15 Correct 1090 ms 2968 KB Output is correct
16 Correct 1653 ms 4088 KB Output is correct
17 Correct 1650 ms 3960 KB Output is correct
18 Correct 71 ms 2424 KB Output is correct
19 Correct 1664 ms 4104 KB Output is correct
20 Correct 1567 ms 4156 KB Output is correct
21 Correct 1492 ms 3932 KB Output is correct
22 Correct 1692 ms 4352 KB Output is correct
23 Correct 1672 ms 4220 KB Output is correct
24 Correct 665 ms 4228 KB Output is correct
25 Correct 638 ms 3960 KB Output is correct
26 Correct 1983 ms 4824 KB Output is correct
27 Correct 2365 ms 5096 KB Output is correct
28 Correct 2350 ms 5064 KB Output is correct
29 Correct 2167 ms 4992 KB Output is correct
30 Correct 2202 ms 4984 KB Output is correct
31 Correct 2250 ms 5040 KB Output is correct
32 Correct 2261 ms 4744 KB Output is correct
33 Correct 2181 ms 5016 KB Output is correct
34 Correct 2185 ms 4828 KB Output is correct
35 Correct 2206 ms 4952 KB Output is correct
36 Correct 2021 ms 4816 KB Output is correct
37 Correct 2029 ms 4856 KB Output is correct
38 Correct 2029 ms 4768 KB Output is correct
39 Correct 2011 ms 4856 KB Output is correct
40 Correct 2054 ms 4856 KB Output is correct
41 Correct 2024 ms 4876 KB Output is correct
42 Correct 885 ms 4728 KB Output is correct
43 Correct 898 ms 4728 KB Output is correct
44 Correct 897 ms 4660 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 26 ms 896 KB Output is correct
4 Correct 8 ms 640 KB Output is correct
5 Correct 16 ms 768 KB Output is correct
6 Correct 14 ms 768 KB Output is correct
7 Correct 21 ms 640 KB Output is correct
8 Correct 22 ms 768 KB Output is correct
9 Correct 23 ms 640 KB Output is correct
10 Correct 21 ms 768 KB Output is correct
11 Correct 21 ms 768 KB Output is correct
12 Correct 22 ms 896 KB Output is correct
13 Correct 26 ms 760 KB Output is correct
14 Correct 25 ms 768 KB Output is correct
15 Correct 23 ms 768 KB Output is correct
16 Correct 22 ms 640 KB Output is correct
17 Correct 21 ms 640 KB Output is correct
18 Correct 1972 ms 5480 KB Output is correct
19 Correct 1907 ms 5112 KB Output is correct
20 Correct 1907 ms 4912 KB Output is correct
21 Correct 1826 ms 5168 KB Output is correct
22 Correct 1823 ms 4828 KB Output is correct
23 Correct 1949 ms 5432 KB Output is correct
24 Correct 1916 ms 5240 KB Output is correct
25 Correct 1921 ms 5544 KB Output is correct
26 Correct 69 ms 2680 KB Output is correct
27 Correct 1775 ms 5064 KB Output is correct
28 Correct 1753 ms 5200 KB Output is correct
29 Correct 1822 ms 5624 KB Output is correct
30 Correct 860 ms 4968 KB Output is correct
31 Correct 1633 ms 4612 KB Output is correct
32 Correct 1090 ms 2968 KB Output is correct
33 Correct 1653 ms 4088 KB Output is correct
34 Correct 1650 ms 3960 KB Output is correct
35 Correct 71 ms 2424 KB Output is correct
36 Correct 1664 ms 4104 KB Output is correct
37 Correct 1567 ms 4156 KB Output is correct
38 Correct 1492 ms 3932 KB Output is correct
39 Correct 1692 ms 4352 KB Output is correct
40 Correct 1672 ms 4220 KB Output is correct
41 Correct 665 ms 4228 KB Output is correct
42 Correct 638 ms 3960 KB Output is correct
43 Correct 2877 ms 5804 KB Output is correct
44 Correct 83 ms 2424 KB Output is correct
45 Correct 138 ms 2808 KB Output is correct
46 Correct 98 ms 2936 KB Output is correct
47 Correct 2415 ms 6040 KB Output is correct
48 Correct 2817 ms 5872 KB Output is correct
49 Correct 2387 ms 6008 KB Output is correct
50 Correct 1864 ms 4656 KB Output is correct
51 Correct 1861 ms 4644 KB Output is correct
52 Correct 1778 ms 4728 KB Output is correct
53 Correct 2189 ms 5508 KB Output is correct
54 Correct 2235 ms 5388 KB Output is correct
55 Correct 2090 ms 5624 KB Output is correct
56 Correct 2322 ms 5752 KB Output is correct
57 Correct 2344 ms 5764 KB Output is correct
58 Correct 2761 ms 5820 KB Output is correct
59 Correct 2754 ms 5848 KB Output is correct
60 Correct 2624 ms 5696 KB Output is correct
61 Correct 2702 ms 5616 KB Output is correct
62 Correct 2153 ms 5528 KB Output is correct
63 Correct 2103 ms 5528 KB Output is correct
64 Correct 2562 ms 5696 KB Output is correct
65 Correct 2152 ms 5596 KB Output is correct
66 Correct 1983 ms 4824 KB Output is correct
67 Correct 2365 ms 5096 KB Output is correct
68 Correct 2350 ms 5064 KB Output is correct
69 Correct 2167 ms 4992 KB Output is correct
70 Correct 2202 ms 4984 KB Output is correct
71 Correct 2250 ms 5040 KB Output is correct
72 Correct 2261 ms 4744 KB Output is correct
73 Correct 2181 ms 5016 KB Output is correct
74 Correct 2185 ms 4828 KB Output is correct
75 Correct 2206 ms 4952 KB Output is correct
76 Correct 2021 ms 4816 KB Output is correct
77 Correct 2029 ms 4856 KB Output is correct
78 Correct 2029 ms 4768 KB Output is correct
79 Correct 2011 ms 4856 KB Output is correct
80 Correct 2054 ms 4856 KB Output is correct
81 Correct 2024 ms 4876 KB Output is correct
82 Correct 885 ms 4728 KB Output is correct
83 Correct 898 ms 4728 KB Output is correct
84 Correct 897 ms 4660 KB Output is correct
85 Correct 2912 ms 6060 KB Output is correct
86 Correct 137 ms 3576 KB Output is correct
87 Correct 98 ms 3604 KB Output is correct
88 Correct 2671 ms 6160 KB Output is correct
89 Correct 2967 ms 6288 KB Output is correct
90 Correct 2478 ms 5952 KB Output is correct
91 Correct 2135 ms 4800 KB Output is correct
92 Correct 2126 ms 4576 KB Output is correct
93 Correct 2198 ms 4608 KB Output is correct
94 Correct 2210 ms 5372 KB Output is correct
95 Correct 2289 ms 5368 KB Output is correct
96 Correct 1896 ms 5368 KB Output is correct
97 Correct 2455 ms 5880 KB Output is correct
98 Correct 1561 ms 5444 KB Output is correct
99 Correct 2781 ms 6292 KB Output is correct
100 Correct 2771 ms 6264 KB Output is correct
101 Correct 2727 ms 6176 KB Output is correct
102 Correct 2778 ms 6252 KB Output is correct
103 Correct 1923 ms 5748 KB Output is correct
104 Correct 1924 ms 5540 KB Output is correct
105 Correct 1167 ms 5324 KB Output is correct
106 Correct 918 ms 5112 KB Output is correct
107 Correct 2132 ms 5792 KB Output is correct
108 Correct 2468 ms 5636 KB Output is correct
109 Correct 2075 ms 5188 KB Output is correct