Submission #805667

#TimeUsernameProblemLanguageResultExecution timeMemory
805667HD1Monthly railway pass (LMIO18_menesinis_bilietas)C++14
30 / 100
3084 ms54792 KiB
// we all are lost trying to be someone. #include <bits/stdc++.h> #define fastio ios_base::sync_with_studio(0); cin.tie(0); #define sz(x) int(x.size()) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define pb push_back #define ss second #define ff first using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> ii; const int MAX=1e6; const int inf=1e9; const int mod=1e9+7; vector<ii>gfo[MAX]; ll dist[MAX]; void dikstra(ll ini){ set<ii> q; q.insert({0,ini}); dist[ini]=0; while(sz(q)){ ii x=*q.begin(); q.erase(q.begin()); ll u=x.ss; ll dist_u=x.ff; if(dist[u]!=dist_u) continue; for(auto y:gfo[u]){ ll v=y.ff; ll w=y.ss; if(dist[v]>dist[u]+w){ dist[v]=dist[u]+w; q.insert({dist[v],v}); } } } } void coso(ll n){ for(int i=0; i<=n; i++){ dist[i]=inf; } return; } void solve(){ ll n, m, u, v; char x; cin>>n>>m; for(ll i=0; i<m; i++){ cin>>u>>v>>x; if(x=='A'){ gfo[u].pb({v,1}); gfo[v].pb({u,1}); } else{ gfo[u].pb({v,0}); gfo[v].pb({u,0}); } } ll ans=0; for(ll i=1; i<=n; i++){ coso(n); dikstra(i); ll cont=0; for(ll j=1; j<=n; j++){ if(dist[j]<=1)cont++; } if(cont==n)ans++; } cout<<ans<<endl; return; } int main(){ solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...