| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 431346 | Rouge_Hugo | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 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<bits/stdc++.h>
#include "plants.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
const int N=100;
int r[N];
using namespace std;int n;
void init(int k, vector<int> R) {
n=R.size();
for(int i=0;i<n;i++)r[i]=R[i];
if(r[0]==0)r[0]=-1;
for(int i=1;i<n;i++)
{
r[i]+=r[i-1];
}
}
int compare_plants(int x, int y) {
int z=0;
if(x>0)z=r[x-1];
if(r[y]-z==y-x)return -1;
if(-r[y]+z==y-x)return 1;
if(z+r[n-1]-r[y-1]==x+1+n-1-y)return -1;
if(z+r[n-1]-r[y-1]==-x-1-n+1+y)return 1;
return 0;
}
/*
5 2 3
1 1 1 1 1
0 1 1 3 1 4
*/