Submission #576569

#TimeUsernameProblemLanguageResultExecution timeMemory
576569vqpahmadExam (eJOI20_exam)C++14
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #define ll long long #define endl '\n' #define all(a) a.begin(),a.end() #define mod (ll)(10000007) using namespace std; const int mx = 1e6 + 15; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<pair<int,int>> ab(n); bool flag = 1; bool ans = 0; for (int i=0;i<n;i++){ cin >> ab[i].first >> ab[i].second; if (i){ if (ab[i].second!=ab[i-1].second){ flag = 0; } if (ab[i].first==ab[i].second || ab[i-1].first==ab[i].second) ans =1; } } if (flag&&ans) cout << n ; else cout << 0 << endl; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...