Submission #1368472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1368472		diegoangulo5	Traffic (CEOI11_tra)	C++20	32 / 100	5095 ms	25032 KiB

tra

#include <bits/stdc++.h>
using namespace std;
#define ll long long 
vector<vector<ll>> adj;
vector<bool> vis;
void dfs(ll cur){
	vis[cur]=true;
	for(auto x:adj[cur]){
		if(!vis[x]){
			dfs(x);
		}
	}
}
	int main(int argc, char *argv[]){
		ll n,m,a,b;
		cin>>n>>m>>a>>b;
		adj.resize(n);
		vector<pair<ll,ll>> V;
		vector<ll> S;
		for(int i=0;i<n;i++){
			ll x,y;
			cin>>x>>y;
			if(x==0){
				V.push_back({y,i});
			}
			if(x==a){
				S.push_back(i);
			}
		}
		sort(V.rbegin(),V.rend());
		for(int i=0;i<m;i++){
			ll x,y,z;
			cin>>x>>y>>z;
			x--;
			y--;
			if(z==1){
				adj[x].push_back(y);
			}else{
				adj[x].push_back(y);
				adj[y].push_back(x);
			}
		}
		for(auto x:V){
			vis.assign(n,false);
			dfs(x.second);
			ll ans=0;
			for(auto y:S){
				if(vis[y]){
					ans++;
				}
			}
			cout<<ans<<"\n";
		}
	}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9