Submission #576588

#TimeUsernameProblemLanguageResultExecution timeMemory
576588vqpahmadExam (eJOI20_exam)C++14
12 / 100
22 ms1108 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; } for (int i=0;i<n;i++){ cin >> ab[i].second; if (i){ if (ab[i-1].second!=ab[i].second) flag = 0; } } for (int i=0;i<n;i++){ if (ab[i].first==ab[i].second) ans = 1; } if (flag&&ans) { int cnt =0; for (int i=0;i<n;i++){ if (ab[i].first==ab[i].second){ int p = i; while (ab[p].first<=ab[i].second){ cnt++; p--; if (p==-1) break; } p = i+1; if (p!=n){ while (ab[p].first<=ab[i].second){ cnt++; p++; if (p==n) break; } } i = p-1; } } cout << cnt ; } 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...