# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496657 | Hanksburger | Comparing Plants (IOI20_plants) | C++17 | 86 ms | 8768 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 "plants.h"
#include <bits/stdc++.h>
using namespace std;
int S[200005], K;
vector<int> R;
void init(int k, vector<int> r)
{
K=k;
R=r;
for (int i=0; i<R.size(); i++)
{
for (int j=i+1; j<R.size(); j++)
{
if (R[i]!=R[j])
{
for (int l=i; l<j; l++)
S[l]=j;
i=j-1;
break;
}
}
if (S[i]==0)
{
for (int j=0; j<i; j++)
{
if (R[i]!=R[j])
{
for (int l=i; l<R.size(); l++)
S[l]=j;
i=R.size()-1;
break;
}
}
}
}
return;
}
int compare_plants(int x, int y)
{
if (S[x]>=y || S[x]<x)
{
if (R[x])
return -1;
else
return 1;
}
else if (S[y]>=x && S[y]<y)
{
if (R[y])
return 1;
else
return -1;
}
return 0;
}
Compilation message (stderr)
# | 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... |