# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833759 | _martynas | Arcade (NOI20_arcade) | C++11 | 1 ms | 356 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxm = 105;
using ll = long long;
struct Button {
ll a, t;
bool operator<(const Button& other) {
return t < other.t;
}
};
int n, m;
Button B[mxm];
bool dp[mxm][mxm];
int main(int argc, char const *argv[]) {
cin >> n >> m;
for(int i = 1; i <= m; i++) cin >> B[i].t;
for(int i = 1; i <= m; i++) cin >> B[i].a;
sort(B+1, B+m+1);
bool poss1 = true;
ll x = B[1].a;
for(int i = 2; i <= m; i++) {
if(labs(B[i].a-x) > B[i].t-B[i-1].t) {
poss1 = false;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |