# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428850 | shenxy | Sparklers (JOI17_sparklers) | C++11 | 40 ms | 2884 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 <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int N, K;
long long T, X[100000], m;
bool check() {
long long arr[N];
for (int i = 0; i < N; ++i) arr[i] = 2 * m * T * i - X[i];
int l = K - 1, r = K - 1, ml = min_element(arr, arr + K) - arr, mr = max_element(arr + K - 1, arr + N) - arr;
long long rl = arr[K - 1], rr = arr[K - 1];
while (l > ml || r < mr) {
bool ch = false;
while (l > ml && arr[l - 1] <= rr) rl = min(rl, arr[--l]), ch = true;
while (r < mr && arr[r + 1] >= rl) rr = max(rr, arr[++r]), ch = true;
if (!ch) return false;
}
l = 0, r = N - 1, rl = arr[0], rr = arr[N - 1];
if (rl > rr) return false;
while (l < ml || r > mr) {
bool ch = false;
while (l < ml && arr[l + 1] <= rr) rl = min(rl, arr[++l]), ch = true;
while (r > mr && arr[r - 1] >= rl) rr = max(rr, arr[--r]), ch = true;
if (!ch) return false;
}
return true;
}
int main() {
scanf("%d %d %lld", &N, &K, &T);
for (int i = 0; i < N; ++i) scanf("%lld", &X[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |