| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1268408 | abdelhakim | 식물 비교 (IOI20_plants) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#include "plants.h"
#define ll long long
#define inf (ll) 1e17
using namespace std;
vector<ll> p;
ll n;
ll sum(ll l, ll r)
{
if(l<=r)
{
ll sm=p[r];
if(l>0) sm-=p[l-1];
return sm;
}
else
{
return sum(r,n-1)+sum(0,l);
}
}
void init(int k, std::vector<int> r)
{
n=r.size();
p.resize(n);
p[0]=r[0];
for (int i=1;i<n;i++)
{
p[i]=p[i-1]+r[i];
}
}
int compare_plants(int x, int y)
{
ll sm1=sum(x,y-1);
ll sm2;
if(x==0) sm2=sum(y,n-1);
else
{
sm2=sum(y,x-1);
}
if(sm1 == y-x || sm2==0)
{
return -1;
}
else if(sm2==n-(y-x) || sm1==0) return 1;
else 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... | ||||
