# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382164 | 2021-03-26T15:42:20 Z | fadi57 | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 1976 ms | 212176 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll mx=5e6+10; const int mod= 1e9+7 ; const ll inf=1e18; //***while there is life there is hope //int a[mx]; int n,m; vector<pair<int,int>>adj[mx]; int vis[mx]; void dfs(int i,int par){ vis[i]=1; for(auto it:adj[i]){ if(it.first==par||vis[it.first]){continue;} dfs(it.first,i); } return; } int ist(char x){ return (x=='A'); } map<int,set<int>>mp; int main() { cin>>n>>m; int sec=0; for(int i=0;i<m;i++){ int x,y;char t; cin>>x>>y>>t; mp[x].insert(y);mp[y].insert(x); if(ist(t)){ sec=1; } adj[x].push_back({y,ist(t)}); adj[y].push_back({x,ist(t)}); } dfs(1,-1); int ok=1; for(int i=1;i<=n;i++){ if(vis[i]==0){ok=0;} } if(n==1){cout<<1;return 0;} if(sec==0){ if(ok){ cout<<n; }else{ cout<<0; }}else{ int ok=1;int ans=0; for(int i=1;i<=n;i++){ if(mp[i].size()>=n-1){ans++;} }cout<<ans; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1976 ms | 212176 KB | Output is correct |
2 | Correct | 72 ms | 117740 KB | Output is correct |
3 | Correct | 73 ms | 117868 KB | Output is correct |
4 | Correct | 73 ms | 117740 KB | Output is correct |
5 | Correct | 71 ms | 117740 KB | Output is correct |
6 | Correct | 634 ms | 142828 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 73 ms | 117740 KB | Output is correct |
2 | Correct | 71 ms | 117740 KB | Output is correct |
3 | Correct | 69 ms | 117804 KB | Output is correct |
4 | Correct | 71 ms | 117868 KB | Output is correct |
5 | Correct | 78 ms | 118764 KB | Output is correct |
6 | Correct | 1136 ms | 160440 KB | Output is correct |
7 | Correct | 1436 ms | 211292 KB | Output is correct |
8 | Correct | 95 ms | 121196 KB | Output is correct |
9 | Correct | 156 ms | 122860 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 72 ms | 117740 KB | Output is correct |
2 | Correct | 73 ms | 117868 KB | Output is correct |
3 | Correct | 69 ms | 117804 KB | Output is correct |
4 | Correct | 71 ms | 117868 KB | Output is correct |
5 | Correct | 78 ms | 118764 KB | Output is correct |
6 | Incorrect | 71 ms | 117740 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 71 ms | 117740 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 71 ms | 117740 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |