Submission #833672

#TimeUsernameProblemLanguageResultExecution timeMemory
833672_martynasAesthetic (NOI20_aesthetic)C++11
0 / 100
135 ms9616 KiB
#include <bits/stdc++.h> using namespace std; const int mxm = 5e5+5; using ll = long long; ll A[mxm], T[mxm]; int main(int argc, char const *argv[]) { int n, m; cin >> n >> m; for(int i = 0; i < m; i++) cin >> A[i]; for(int i = 0; i < m; i++) cin >> T[i]; bool poss1 = true; ll x = A[0]; for(int i = 1; i < m; i++) { if(labs(A[i]-x) > T[i]-T[i-1]) { poss1 = false; } x = A[i]; } cout << (poss1 ? 1 : 2) << "\n"; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...