Submission #833677

#TimeUsernameProblemLanguageResultExecution timeMemory
833677_martynasAesthetic (NOI20_aesthetic)C++11
0 / 100
165 ms5044 KiB
#include <bits/stdc++.h> using namespace std; const int mxm = 5e5+5; using ll = long long; struct Button { ll a, t; bool operator<(const Button& other) { return t < other.t; } }; Button B[mxm]; int main(int argc, char const *argv[]) { int n, m; cin >> n >> m; for(int i = 0; i < m; i++) cin >> B[i].t; for(int i = 0; i < m; i++) cin >> B[i].a; sort(B, B+m); bool poss1 = true; ll x = B[0].a; for(int i = 1; i < m; i++) { if(labs(B[i].a-x) > B[i].t-B[i-1].t) { poss1 = false; } x = B[i].a; } 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...