Submission #576589

#TimeUsernameProblemLanguageResultExecution timeMemory
576589Yazan_SAExam (eJOI20_exam)C++14
0 / 100
2 ms980 KiB
#include<bits/stdc++.h> #define ll long long #define endl "\n" #define start cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); using namespace std; int main() { start //freopen("survive.in", "r", stdin); int t=1; //cin>>t; while(t--) { int n, arr[100000], arrb[100000]; cin>>n; int ans=0; for(int i=0; i<n; cin>>arr[i++]); for(int i=0; i<n; cin>>arrb[i++]); for(int i=0; i<n; i++) { int mn=1e9; bool is=1; if(arr[i]>arrb[i]) break; if(arr[i]==arrb[i]) { ans++; is=0; } for(int j=0; j<n&&is; j++) { if(i==j) continue; if(arrb[i]==arr[j] && mn>=arr[j]) { ans++; is=0; } mn=min(mn, arrb[j]); } mn=1e9; for(int j=0; j<i&&is; j++) { if(i==j) continue; if(arrb[i]==arr[j] && mn>=arr[j]) { ans++; is=0; } mn=min(mn, arrb[j]); } mn=1e9; for(int j=i+1; j<n&&is; j++) { if(i==j) continue; if(arrb[i]==arr[j] && mn>=arr[j]) { ans++; is=0; } mn=min(mn, arrb[j]); } } cout<<ans; } }
#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...