제출 #382156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382156		fadi57	Monthly railway pass (LMIO18_menesinis_bilietas)	C++14	0 / 100	614 ms	132844 KiB

menesinis_bilietas

#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=1;
for(int i=1;i<=n;i++){
    if(vis[i]==0){ok=0;}
}
if(ok){
    cout<<n;
}else{
cout<<0;
}

}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 6
• Subtask 3: 0 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 19