oj.uz

Submission #453307

# Submission time Handle Problem Language Result Execution time Memory
453307 2021-08-04T10:38:16 Z Evirir Bridges (APIO19_bridges) C++17
100 / 100
 2981 ms 9680 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

#pragma GCC optimize("O3")
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
//template<typename T>
//using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 50005;
const int MAXM = 100005;
const int MAXQ = 100005;

struct Edge
{
	int u,v; int w;
	bool operator<(const Edge &e){ return w<e.w; }
};

struct DSU
{
	struct Node{ int p; int sz; };
	vector<Node> dsu; int cc;
	vector<pair<int,Node>> upd; // (v,(p,sz))
	DSU(int n){ dsu.resize(n); cc=n; upd.clear();
		forn(i,0,n) dsu[i]={i,1};
	}
	inline int rt(int u){ return u==dsu[u].p ? u : rt(dsu[u].p); }
	inline bool sameset(int u, int v){ return rt(u)==rt(v); }
	void merge(int u, int v){
		u=rt(u); v=rt(v);
		if(u==v) return;
		if(dsu[u].sz<dsu[v].sz) swap(u,v);
		upd.pb({v,dsu[v]});
		dsu[v].p=u;
		dsu[u].sz+=dsu[v].sz;
		cc--;
	}
	void undo()
	{
		assert(!upd.empty());
		auto u=upd.back();
		int p=dsu[u.F].p;
		dsu[p].sz-=u.S.sz;
		dsu[u.F]=u.S;
		upd.pop_back();
	}
	inline Node& operator[](int u){ return dsu[u]; }
};

int n,m,Q;
vector<Edge> edges;
vector<pair<ii,int>> queries; //(node,weight), time
vector<pair<ii,int>> updates; //(id,weight), time
int ans[MAXQ];
bool chg[MAXM];
int neww[MAXM];

bool cmpw(pair<ii,int> &a, pair<ii,int> &b){ return a.F.S>b.F.S; }
void process()
{
	vector<Edge> fixed;
	reverse(all(updates));
	forn(i,0,m)
	{
		if(!chg[i]) fixed.pb(edges[i]);
		else updates.pb({{i,edges[i].w},-1});
	}
	sort(all(fixed));
	reverse(all(updates));
	sort(all(queries),cmpw);
	
	DSU dsu(n);
	
	// large w to small w
	for(auto q: queries)
	{
		int u=q.F.F; int w=q.F.S; int qtime=q.S;
		while(!fixed.empty() && fixed.back().w>=w)
		{
			dsu.merge(fixed.back().u, fixed.back().v);
			fixed.pop_back();
		}
		
		for(auto upd: updates)
		{
			if(upd.S>qtime) break;
			int id=upd.F.F;
			neww[id]=upd.F.S;
		}
		
		int updcnt=0;
		for(auto upd: updates)
		{
			if(upd.S>qtime) break;
			int id=upd.F.F;
			if(neww[id]>=w)
			{
				if(dsu.sameset(edges[id].u, edges[id].v)) continue;
				dsu.merge(edges[id].u, edges[id].v);
				updcnt++;
			}
		}
		
		ans[qtime]=dsu[dsu.rt(u)].sz;
		
		while(updcnt--) dsu.undo();
	}
	
	for(auto upd: updates)
	{
		chg[upd.F.F]=0;
		edges[upd.F.F].w=upd.F.S;
	}
	queries.clear();
	updates.clear();
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m;
	forn(i,0,m)
	{
		int u,v; int w; cin>>u>>v>>w; u--; v--;
		edges.pb({u,v,w});
	}
	
	cin>>Q;
	forn(i,0,Q) ans[i]=-1;
	
	int qcnt=0;
	forn(i,0,Q)
	{
		int t; cin>>t;
		if(t==1)
		{
			int id; int w; cin>>id>>w; id--;
			updates.pb({{id,w},i});
			chg[id]=1;
		}
		else
		{
			int u; int w; cin>>u>>w; u--;
			queries.pb({{u,w},i});
		}
		
		qcnt++;
		if(qcnt>=1000 || i==Q-1)
		{
			process();
			qcnt=0;
		}
	}
	
	forn(i,0,Q)
	{
		if(ans[i]!=-1) cout<<ans[i]<<'\n';
	}
	
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 47 ms 444 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 25 ms 408 KB Output is correct
6 Correct 20 ms 408 KB Output is correct
7 Correct 26 ms 392 KB Output is correct
8 Correct 30 ms 332 KB Output is correct
9 Correct 27 ms 408 KB Output is correct
10 Correct 32 ms 396 KB Output is correct
11 Correct 35 ms 396 KB Output is correct
12 Correct 40 ms 392 KB Output is correct
13 Correct 41 ms 408 KB Output is correct
14 Correct 38 ms 452 KB Output is correct
15 Correct 37 ms 388 KB Output is correct
16 Correct 29 ms 404 KB Output is correct
17 Correct 32 ms 400 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1799 ms 4232 KB Output is correct
2 Correct 1878 ms 4276 KB Output is correct
3 Correct 1826 ms 4400 KB Output is correct
4 Correct 1875 ms 4224 KB Output is correct
5 Correct 1902 ms 4224 KB Output is correct
6 Correct 2848 ms 4512 KB Output is correct
7 Correct 2981 ms 4240 KB Output is correct
8 Correct 2918 ms 4248 KB Output is correct
9 Correct 43 ms 964 KB Output is correct
10 Correct 1748 ms 4240 KB Output is correct
11 Correct 1686 ms 4260 KB Output is correct
12 Correct 1569 ms 4140 KB Output is correct
13 Correct 1733 ms 4184 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1511 ms 2748 KB Output is correct
2 Correct 1062 ms 1248 KB Output is correct
3 Correct 1775 ms 2736 KB Output is correct
4 Correct 1428 ms 2852 KB Output is correct
5 Correct 43 ms 852 KB Output is correct
6 Correct 1598 ms 2916 KB Output is correct
7 Correct 1324 ms 2824 KB Output is correct
8 Correct 1241 ms 2840 KB Output is correct
9 Correct 869 ms 2832 KB Output is correct
10 Correct 793 ms 2860 KB Output is correct
11 Correct 947 ms 2768 KB Output is correct
12 Correct 834 ms 2804 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1758 ms 5408 KB Output is correct
2 Correct 42 ms 856 KB Output is correct
3 Correct 186 ms 4264 KB Output is correct
4 Correct 109 ms 4248 KB Output is correct
5 Correct 1077 ms 5456 KB Output is correct
6 Correct 1697 ms 5368 KB Output is correct
7 Correct 1092 ms 5260 KB Output is correct
8 Correct 882 ms 4096 KB Output is correct
9 Correct 941 ms 3860 KB Output is correct
10 Correct 947 ms 3984 KB Output is correct
11 Correct 1359 ms 4688 KB Output is correct
12 Correct 1340 ms 4732 KB Output is correct
13 Correct 1372 ms 4776 KB Output is correct
14 Correct 1104 ms 5248 KB Output is correct
15 Correct 1110 ms 5508 KB Output is correct
16 Correct 1741 ms 5284 KB Output is correct
17 Correct 1792 ms 5284 KB Output is correct
18 Correct 1792 ms 5332 KB Output is correct
19 Correct 1778 ms 5360 KB Output is correct
20 Correct 1506 ms 4896 KB Output is correct
21 Correct 1531 ms 5036 KB Output is correct
22 Correct 1705 ms 5184 KB Output is correct
23 Correct 1120 ms 4828 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1799 ms 4232 KB Output is correct
2 Correct 1878 ms 4276 KB Output is correct
3 Correct 1826 ms 4400 KB Output is correct
4 Correct 1875 ms 4224 KB Output is correct
5 Correct 1902 ms 4224 KB Output is correct
6 Correct 2848 ms 4512 KB Output is correct
7 Correct 2981 ms 4240 KB Output is correct
8 Correct 2918 ms 4248 KB Output is correct
9 Correct 43 ms 964 KB Output is correct
10 Correct 1748 ms 4240 KB Output is correct
11 Correct 1686 ms 4260 KB Output is correct
12 Correct 1569 ms 4140 KB Output is correct
13 Correct 1733 ms 4184 KB Output is correct
14 Correct 1511 ms 2748 KB Output is correct
15 Correct 1062 ms 1248 KB Output is correct
16 Correct 1775 ms 2736 KB Output is correct
17 Correct 1428 ms 2852 KB Output is correct
18 Correct 43 ms 852 KB Output is correct
19 Correct 1598 ms 2916 KB Output is correct
20 Correct 1324 ms 2824 KB Output is correct
21 Correct 1241 ms 2840 KB Output is correct
22 Correct 869 ms 2832 KB Output is correct
23 Correct 793 ms 2860 KB Output is correct
24 Correct 947 ms 2768 KB Output is correct
25 Correct 834 ms 2804 KB Output is correct
26 Correct 1794 ms 4228 KB Output is correct
27 Correct 2289 ms 4156 KB Output is correct
28 Correct 1940 ms 4112 KB Output is correct
29 Correct 1400 ms 4184 KB Output is correct
30 Correct 2390 ms 4160 KB Output is correct
31 Correct 2344 ms 4280 KB Output is correct
32 Correct 2395 ms 4332 KB Output is correct
33 Correct 1885 ms 4128 KB Output is correct
34 Correct 1942 ms 4184 KB Output is correct
35 Correct 1928 ms 4400 KB Output is correct
36 Correct 1478 ms 4272 KB Output is correct
37 Correct 1431 ms 4196 KB Output is correct
38 Correct 1502 ms 4412 KB Output is correct
39 Correct 1091 ms 4104 KB Output is correct
40 Correct 1080 ms 4300 KB Output is correct
41 Correct 1053 ms 4088 KB Output is correct
42 Correct 1123 ms 4276 KB Output is correct
43 Correct 1095 ms 4212 KB Output is correct
44 Correct 1092 ms 4112 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 47 ms 444 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 25 ms 408 KB Output is correct
6 Correct 20 ms 408 KB Output is correct
7 Correct 26 ms 392 KB Output is correct
8 Correct 30 ms 332 KB Output is correct
9 Correct 27 ms 408 KB Output is correct
10 Correct 32 ms 396 KB Output is correct
11 Correct 35 ms 396 KB Output is correct
12 Correct 40 ms 392 KB Output is correct
13 Correct 41 ms 408 KB Output is correct
14 Correct 38 ms 452 KB Output is correct
15 Correct 37 ms 388 KB Output is correct
16 Correct 29 ms 404 KB Output is correct
17 Correct 32 ms 400 KB Output is correct
18 Correct 1799 ms 4232 KB Output is correct
19 Correct 1878 ms 4276 KB Output is correct
20 Correct 1826 ms 4400 KB Output is correct
21 Correct 1875 ms 4224 KB Output is correct
22 Correct 1902 ms 4224 KB Output is correct
23 Correct 2848 ms 4512 KB Output is correct
24 Correct 2981 ms 4240 KB Output is correct
25 Correct 2918 ms 4248 KB Output is correct
26 Correct 43 ms 964 KB Output is correct
27 Correct 1748 ms 4240 KB Output is correct
28 Correct 1686 ms 4260 KB Output is correct
29 Correct 1569 ms 4140 KB Output is correct
30 Correct 1733 ms 4184 KB Output is correct
31 Correct 1511 ms 2748 KB Output is correct
32 Correct 1062 ms 1248 KB Output is correct
33 Correct 1775 ms 2736 KB Output is correct
34 Correct 1428 ms 2852 KB Output is correct
35 Correct 43 ms 852 KB Output is correct
36 Correct 1598 ms 2916 KB Output is correct
37 Correct 1324 ms 2824 KB Output is correct
38 Correct 1241 ms 2840 KB Output is correct
39 Correct 869 ms 2832 KB Output is correct
40 Correct 793 ms 2860 KB Output is correct
41 Correct 947 ms 2768 KB Output is correct
42 Correct 834 ms 2804 KB Output is correct
43 Correct 1758 ms 5408 KB Output is correct
44 Correct 42 ms 856 KB Output is correct
45 Correct 186 ms 4264 KB Output is correct
46 Correct 109 ms 4248 KB Output is correct
47 Correct 1077 ms 5456 KB Output is correct
48 Correct 1697 ms 5368 KB Output is correct
49 Correct 1092 ms 5260 KB Output is correct
50 Correct 882 ms 4096 KB Output is correct
51 Correct 941 ms 3860 KB Output is correct
52 Correct 947 ms 3984 KB Output is correct
53 Correct 1359 ms 4688 KB Output is correct
54 Correct 1340 ms 4732 KB Output is correct
55 Correct 1372 ms 4776 KB Output is correct
56 Correct 1104 ms 5248 KB Output is correct
57 Correct 1110 ms 5508 KB Output is correct
58 Correct 1741 ms 5284 KB Output is correct
59 Correct 1792 ms 5284 KB Output is correct
60 Correct 1792 ms 5332 KB Output is correct
61 Correct 1778 ms 5360 KB Output is correct
62 Correct 1506 ms 4896 KB Output is correct
63 Correct 1531 ms 5036 KB Output is correct
64 Correct 1705 ms 5184 KB Output is correct
65 Correct 1120 ms 4828 KB Output is correct
66 Correct 1794 ms 4228 KB Output is correct
67 Correct 2289 ms 4156 KB Output is correct
68 Correct 1940 ms 4112 KB Output is correct
69 Correct 1400 ms 4184 KB Output is correct
70 Correct 2390 ms 4160 KB Output is correct
71 Correct 2344 ms 4280 KB Output is correct
72 Correct 2395 ms 4332 KB Output is correct
73 Correct 1885 ms 4128 KB Output is correct
74 Correct 1942 ms 4184 KB Output is correct
75 Correct 1928 ms 4400 KB Output is correct
76 Correct 1478 ms 4272 KB Output is correct
77 Correct 1431 ms 4196 KB Output is correct
78 Correct 1502 ms 4412 KB Output is correct
79 Correct 1091 ms 4104 KB Output is correct
80 Correct 1080 ms 4300 KB Output is correct
81 Correct 1053 ms 4088 KB Output is correct
82 Correct 1123 ms 4276 KB Output is correct
83 Correct 1095 ms 4212 KB Output is correct
84 Correct 1092 ms 4112 KB Output is correct
85 Correct 2626 ms 5856 KB Output is correct
86 Correct 244 ms 6628 KB Output is correct
87 Correct 171 ms 6832 KB Output is correct
88 Correct 1864 ms 7984 KB Output is correct
89 Correct 2659 ms 9556 KB Output is correct
90 Correct 1970 ms 7832 KB Output is correct
91 Correct 2023 ms 6748 KB Output is correct
92 Correct 2074 ms 6872 KB Output is correct
93 Correct 2930 ms 6712 KB Output is correct
94 Correct 2283 ms 8332 KB Output is correct
95 Correct 2280 ms 8312 KB Output is correct
96 Correct 2697 ms 8132 KB Output is correct
97 Correct 1294 ms 7752 KB Output is correct
98 Correct 1446 ms 7732 KB Output is correct
99 Correct 2670 ms 9560 KB Output is correct
100 Correct 2620 ms 9432 KB Output is correct
101 Correct 2687 ms 9584 KB Output is correct
102 Correct 2649 ms 9680 KB Output is correct
103 Correct 2925 ms 8428 KB Output is correct
104 Correct 2955 ms 8400 KB Output is correct
105 Correct 2080 ms 8432 KB Output is correct
106 Correct 1657 ms 8100 KB Output is correct
107 Correct 2001 ms 8372 KB Output is correct
108 Correct 2684 ms 8932 KB Output is correct
109 Correct 2074 ms 7024 KB Output is correct