oj.uz

Submission #382154

# Submission time Handle Problem Language Result Execution time Memory
382154 2021-03-26T15:28:45 Z fadi57 Monthly railway pass (LMIO18_menesinis_bilietas) C++14
0 / 100
 674 ms 140816 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');

}
int main() {
cin>>n>>m;

for(int i=0;i<m;i++){
int x,y;char t;
cin>>x>>y>>t;

    adj[x].push_back({y,ist(t)});
       adj[y].push_back({x,ist(t)});

}
dfs(1,-1);
int ok;
for(int i=1;i<=n;i++){
    if(vis[i]==0){ok=0;}
}
if(ok){
    cout<<n;
}else{
cout<<0;
}

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 674 ms 140816 KB Output isn't correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 117780 KB Output is correct
2 Incorrect 69 ms 117740 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 117740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 117740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 674 ms 140816 KB Output isn't correct