oj.uz

Submission #382162

# Submission time Handle Problem Language Result Execution time Memory
382162 2021-03-26T15:40:47 Z fadi57 Monthly railway pass (LMIO18_menesinis_bilietas) C++14
10 / 100
 1916 ms 212260 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(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

menesinis_bilietas.cpp: In function 'int main()':
menesinis_bilietas.cpp:61:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   61 |     if(mp[i].size()>n-1){ans++;}
      |        ~~~~~~~~~~~~^~~~
menesinis_bilietas.cpp:59:5: warning: unused variable 'ok' [-Wunused-variable]
   59 | int ok=1;int ans=0;
      |     ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 212260 KB Output is correct
2 Correct 69 ms 117740 KB Output is correct
3 Correct 69 ms 117868 KB Output is correct
4 Correct 69 ms 117740 KB Output is correct
5 Correct 68 ms 117740 KB Output is correct
6 Correct 636 ms 142880 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1916 ms 212260 KB Output is correct
2 Correct 69 ms 117740 KB Output is correct
3 Correct 69 ms 117868 KB Output is correct
4 Correct 69 ms 117740 KB Output is correct
5 Incorrect 70 ms 117740 KB Output isn't correct
6 Halted 0 ms 0 KB -