oj.uz

답안 #983732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983732 2024-05-16T03:05:17 Z pcc 다리 (APIO19_bridges) C++17
43 / 100
 368 ms 8324 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

const int mxn = 2e5+10;
const int lim = 3030;
int N,M,Q;
vector<pair<int,pii>> edges;
pair<int,pii> req[mxn];

struct DSU{
	int dsu[mxn],sz[mxn];
	DSU(){}
	void init(int n){
		for(int i = 0;i<n;i++)dsu[i] = i,sz[i] = 1;
		return;
	}
	int root(int k){
		return k == dsu[k]?k:dsu[k] = root(dsu[k]);
	}
	void onion(int a,int b){
		a = root(a),b = root(b);
		if(a == b)return;
		if(sz[a]<sz[b])swap(a,b);
		dsu[b] = a;
		sz[a] += sz[b];
	}
};

namespace S1{
	DSU dsu;
	void GO(){
		for(int i = 0;i<Q;i++){
			if(req[i].fs == 1){
				int id = req[i].sc.fs,w = req[i].sc.sc;
				edges[id-1].fs = w;
			}
			else{
				dsu.init(N+1);
				for(auto &j:edges){
					if(j.fs>=req[i].sc.sc)dsu.onion(j.sc.fs,j.sc.sc);
				}
				cout<<dsu.sz[dsu.root(req[i].sc.fs)]<<'\n';
			}
		}
		return;
	}
}


namespace S2{
	struct SEG{
#define mid ((l+r)>>1)
#define ls now*2+1
#define rs now*2+2
		int seg[mxn*4];
		void modify(int now,int l,int r,int p,int v){
			if(l == r){
				seg[now] = v;
				return;
			}
			if(mid>=p)modify(ls,l,mid,p,v);
			else modify(rs,mid+1,r,p,v);
			seg[now] = min(seg[ls],seg[rs]);
		}
		int getval(int now,int l,int r,int s,int e){
			assert(e>=s);
			if(l>=s&&e>=r)return seg[now];
			if(mid>=e)return getval(ls,l,mid,s,e);
			else if(mid<s)return getval(rs,mid+1,r,s,e);
			else return min(getval(ls,l,mid,s,e),getval(rs,mid+1,r,s,e));
		}
#undef ls
#undef rs
#undef mid
	};
	SEG seg;
	void GO(){
		for(int i = 0;i<N-1;i++){
			seg.modify(0,1,N-1,i+1,edges[i].fs);
		}
		for(int i = 0;i<Q;i++){
			auto [t,_] = req[i];
			auto [a,b] = _;
			if(t == 1){
				seg.modify(0,1,N-1,a,b);
				edges[a-1].fs = b;
			}
			else{
				int lp = a,rp = a;
				int l = 1,r = a-1;
				while(l < r){
					int mid = (l+r)>>1;
					if(seg.getval(0,1,N-1,mid,a-1)>=b)r = mid;
					else l = mid+1;
				}
				if(a!=1&&edges[a-2].fs>=b)lp = l;
				l = a,r = N-1;
				while(l<r){
					int mid = (l+r+1)>>1;
					if(seg.getval(0,1,N-1,a,mid)>=b)l = mid;
					else r = mid-1;
				}
				if(a != N&&edges[a-1].fs>=b)rp = l+1;
				cout<<rp-lp+1<<'\n';
			}
		}
		return;
	}
}

namespace S3{
	int ans[mxn];
	DSU dsu;
	void GO(){
		vector<pair<int,pii>> v;
		for(int i = 0;i<Q;i++){
			int t = req[i].fs;
			auto [a,b] = req[i].sc;
			v.push_back(make_pair(b,pii(a,i)));
		}
		sort(v.rbegin(),v.rend());
		sort(edges.begin(),edges.end());
		dsu.init(N+1);
		for(auto [w,_]:v){
			auto [s,id] = _;
			while(!edges.empty()&&edges.back().fs>=w){
				dsu.onion(edges.back().sc.fs,edges.back().sc.sc);
				edges.pop_back();
			}
			ans[id] = dsu.sz[dsu.root(s)];
		}
		for(int i = 0;i<Q;i++)cout<<ans[i]<<'\n';
		return;
	}
}


int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M;
	bool flag = false;
	for(int i = 0;i<M;i++){
		int a,b,c;
		cin>>a>>b>>c;
		edges.push_back(make_pair(c,pii(a,b)));
	}
	cin>>Q;
	for(int i = 0;i<Q;i++){
		int t,a,b;
		cin>>t>>a>>b;
		req[i] = make_pair(t,pii(a,b));
		if(t == 1)flag = true;
	}
	if(N<=lim&&M<=lim&&Q<=lim*10)S1::GO();
	else if(flag)S2::GO();
	else S3::GO();
	return 0;
}

Compilation message

bridges.cpp: In function 'void S3::GO()':
bridges.cpp:124:8: warning: unused variable 't' [-Wunused-variable]
  124 |    int t = req[i].fs;
      |        ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 23 ms 4596 KB Output is correct
4 Correct 3 ms 4440 KB Output is correct
5 Correct 5 ms 4444 KB Output is correct
6 Correct 4 ms 4440 KB Output is correct
7 Correct 4 ms 4440 KB Output is correct
8 Correct 5 ms 4444 KB Output is correct
9 Correct 4 ms 4576 KB Output is correct
10 Correct 5 ms 4444 KB Output is correct
11 Correct 5 ms 4444 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 7 ms 4444 KB Output is correct
14 Correct 7 ms 4440 KB Output is correct
15 Correct 7 ms 4444 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 5 ms 4568 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 5596 KB Output is correct
2 Correct 205 ms 7924 KB Output is correct
3 Correct 201 ms 8008 KB Output is correct
4 Correct 210 ms 8132 KB Output is correct
5 Correct 201 ms 8084 KB Output is correct
6 Correct 235 ms 7884 KB Output is correct
7 Correct 236 ms 8104 KB Output is correct
8 Correct 225 ms 7936 KB Output is correct
9 Correct 30 ms 7368 KB Output is correct
10 Correct 212 ms 7084 KB Output is correct
11 Correct 208 ms 6916 KB Output is correct
12 Correct 368 ms 8324 KB Output is correct
13 Correct 77 ms 7880 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 181 ms 5080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 7488 KB Output is correct
2 Correct 29 ms 5836 KB Output is correct
3 Correct 28 ms 5832 KB Output is correct
4 Correct 32 ms 6096 KB Output is correct
5 Correct 56 ms 7488 KB Output is correct
6 Correct 60 ms 7560 KB Output is correct
7 Correct 56 ms 7440 KB Output is correct
8 Correct 56 ms 6724 KB Output is correct
9 Correct 54 ms 6724 KB Output is correct
10 Correct 46 ms 6964 KB Output is correct
11 Correct 53 ms 6984 KB Output is correct
12 Correct 65 ms 6976 KB Output is correct
13 Correct 52 ms 7360 KB Output is correct
14 Correct 57 ms 7492 KB Output is correct
15 Correct 63 ms 7560 KB Output is correct
16 Correct 60 ms 7584 KB Output is correct
17 Correct 61 ms 7492 KB Output is correct
18 Correct 61 ms 7496 KB Output is correct
19 Correct 60 ms 7492 KB Output is correct
20 Correct 63 ms 7492 KB Output is correct
21 Correct 55 ms 7348 KB Output is correct
22 Correct 58 ms 7496 KB Output is correct
23 Correct 51 ms 7488 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 5596 KB Output is correct
2 Correct 205 ms 7924 KB Output is correct
3 Correct 201 ms 8008 KB Output is correct
4 Correct 210 ms 8132 KB Output is correct
5 Correct 201 ms 8084 KB Output is correct
6 Correct 235 ms 7884 KB Output is correct
7 Correct 236 ms 8104 KB Output is correct
8 Correct 225 ms 7936 KB Output is correct
9 Correct 30 ms 7368 KB Output is correct
10 Correct 212 ms 7084 KB Output is correct
11 Correct 208 ms 6916 KB Output is correct
12 Correct 368 ms 8324 KB Output is correct
13 Correct 77 ms 7880 KB Output is correct
14 Incorrect 181 ms 5080 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 23 ms 4596 KB Output is correct
4 Correct 3 ms 4440 KB Output is correct
5 Correct 5 ms 4444 KB Output is correct
6 Correct 4 ms 4440 KB Output is correct
7 Correct 4 ms 4440 KB Output is correct
8 Correct 5 ms 4444 KB Output is correct
9 Correct 4 ms 4576 KB Output is correct
10 Correct 5 ms 4444 KB Output is correct
11 Correct 5 ms 4444 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 7 ms 4444 KB Output is correct
14 Correct 7 ms 4440 KB Output is correct
15 Correct 7 ms 4444 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 5 ms 4568 KB Output is correct
18 Correct 205 ms 5596 KB Output is correct
19 Correct 205 ms 7924 KB Output is correct
20 Correct 201 ms 8008 KB Output is correct
21 Correct 210 ms 8132 KB Output is correct
22 Correct 201 ms 8084 KB Output is correct
23 Correct 235 ms 7884 KB Output is correct
24 Correct 236 ms 8104 KB Output is correct
25 Correct 225 ms 7936 KB Output is correct
26 Correct 30 ms 7368 KB Output is correct
27 Correct 212 ms 7084 KB Output is correct
28 Correct 208 ms 6916 KB Output is correct
29 Correct 368 ms 8324 KB Output is correct
30 Correct 77 ms 7880 KB Output is correct
31 Incorrect 181 ms 5080 KB Output isn't correct
32 Halted 0 ms 0 KB -