| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1291699 | kahoul | 식물 비교 (IOI20_plants) | C++20 | 2 ms | 1092 KiB |
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int k;
vector<int> psum(maxn);
void init(int K, vector<int> r) {
k = K;
int n = r.size();
psum[0] = 0;
for (int i = 1; i <= n; i++) {
psum[i] = psum[i - 1] + r[i - 1];
}
}
int compare_plants(int x, int y) {
x++;
y++;
if (psum[y] - psum[x - 1] == y - x + 1) return -1;
if (psum[y] - psum[x - 1] == 0) return +1;
return 0;
}
| # | 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... | ||||
