Submission #597537

#	Time	Username	Problem	Language	Result	Execution time	Memory
597537		WongChun1234	Bridges (APIO19_bridges)	C++14	13 / 100	3078 ms	12236 KiB

bridges

#include<bits/stdc++.h>
using namespace std;
const int N=150050;
int n,m,q,u[N],v[N],w[N],ans,t,a,b;
bool vis[N];
vector<int> adj[N];
void dfs(int nde,int lim){
	vis[nde]=1;
	for (int i:adj[nde]){
		if (i>0){
			if (w[i]>=lim&&!vis[v[i]]) dfs(v[i],lim);
		}else{
			if (w[-i]>=lim&&!vis[u[-i]]) dfs(u[-i],lim);
		}
	}
}
int main(){
	cin>>n>>m;
	for (int i=1;i<=m;i++){
		cin>>u[i]>>v[i]>>w[i];
		adj[u[i]].push_back(i);
		adj[v[i]].push_back(-i);
	}
	cin>>q;
	while (q--){
		cin>>t>>a>>b;
		if (t==1){
			w[a]=b;
			continue;
		}
		for (int i=1;i<=n;i++) vis[i]=0;
		dfs(a,b);
		ans=0;
		for (int i=1;i<=n;i++) ans+=vis[i];
		cout<<ans<<"\n";
	}
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27