# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
833987 | 2023-08-22T09:58:56 Z | finn__ | 식물 비교 (IOI20_plants) | C++17 | 70 ms | 5056 KB |
#include <bits/stdc++.h> #include "plants.h" using namespace std; constexpr size_t N = 200000; size_t n; int subtask, s[N], h[N]; void init(int k, std::vector<int> r) { n = r.size(); if (k == 2) subtask = 1; else subtask = 2; if (subtask == 1) { partial_sum(r.begin(), r.end(), s); } else { for (size_t i = 0; i < n; ++i) { size_t conseq_nonzero = 0; int next_max = 0; for (size_t j = 0; j < 2 * n;) { while (j < 2 * n && !r[j % n]) ++j; size_t k = j; while (k < 2 * n && r[k % n]) ++k; if (k - j > conseq_nonzero) conseq_nonzero = k - j, next_max = k % n; j = k; } h[next_max] = n - i; for (int j = next_max - k + 1; j < next_max; ++j) if (r[(j + (int)n) % n]) r[(j + (int)n) % n]--; } } } int compare_plants(int x, int y) { if (subtask == 1) { int z = s[y - 1] - (x ? s[x - 1] : 0); return !z ? 1 : (z == y - x ? -1 : (!(s[n - 1] - z) ? -1 : ((s[n - 1] - z == n - (y - x) ? 1 : 0)))); } else { return h[x] > h[y] ? 1 : -1; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 37 ms | 3164 KB | Output is correct |
7 | Correct | 41 ms | 3312 KB | Output is correct |
8 | Correct | 70 ms | 4996 KB | Output is correct |
9 | Correct | 53 ms | 4940 KB | Output is correct |
10 | Correct | 53 ms | 4940 KB | Output is correct |
11 | Correct | 54 ms | 4940 KB | Output is correct |
12 | Correct | 57 ms | 5056 KB | Output is correct |
13 | Correct | 53 ms | 4944 KB | Output is correct |
14 | Correct | 51 ms | 4940 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Incorrect | 0 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Incorrect | 0 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 37 ms | 3164 KB | Output is correct |
7 | Correct | 41 ms | 3312 KB | Output is correct |
8 | Correct | 70 ms | 4996 KB | Output is correct |
9 | Correct | 53 ms | 4940 KB | Output is correct |
10 | Correct | 53 ms | 4940 KB | Output is correct |
11 | Correct | 54 ms | 4940 KB | Output is correct |
12 | Correct | 57 ms | 5056 KB | Output is correct |
13 | Correct | 53 ms | 4944 KB | Output is correct |
14 | Correct | 51 ms | 4940 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 212 KB | Output is correct |
17 | Incorrect | 0 ms | 212 KB | Output isn't correct |
18 | Halted | 0 ms | 0 KB | - |