Submission #500365

#TimeUsernameProblemLanguageResultExecution timeMemory
500365JaguarMonthly railway pass (LMIO18_menesinis_bilietas)C++14
0 / 100
3078 ms5836 KiB
#include <bits/stdc++.h> using namespace std; struct keliai{ int prad; int tiksl; bool trauk; }; int main() { int n,m, kiekT=0, kiekA=0; cin >> n >> m; vector <int> ats; keliai kelias[m]; bool visi[n]; fill(visi, visi+n, false); for (int i=0;i<m;i++){ char temp; cin >> kelias[i].prad >> kelias[i].tiksl;cin >> temp; if(temp=='A'){kelias[i].trauk=false;kiekA++;} else {kelias[i].trauk=true;kiekT++;} } if(kiekA==m){ for (int i=1; i<=n;i++){ int temp=0; for (int j=0;j<m;j++){ if(i==kelias[j].prad||i==kelias[j].tiksl){ temp++; } } if(temp==n-1) ats.push_back(i); } } cout << ats.size(); }
#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...