| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1239579 | MuhammadSaram | 식물 비교 (IOI20_plants) | C++20 | 44 ms | 4936 KiB |
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 1;
int pre[M], n;
void init(int k, vector<int> r)
{
n=r.size();
for (int i=0;i<n;i++)
pre[i+1]=pre[i]+r[i];
return;
}
int compare_plants(int x, int y)
{
int len=y-x, val = pre[y]-pre[x];
if (val%len)
{
val=pre[n]-val, len=n-len;
if (val%len) return 0;
return (val==len?1:-1);
}
return (val==len?-1:1);
}| # | 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... | ||||
