| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 331972 | pggp | Comparing Plants (IOI20_plants) | C++14 | 1 ms | 492 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>
using namespace std;
int K;
vector < int > R;
int n;
vector < int > order;
int ord;
void init(int k, vector < int > r){
K = k;
R = r;
n = R.size();
order.resize(n);
int last_up = 0;
for (int i = 0; i < n; ++i)
{
for(int ind = 0; ind < n; ind++){
if(R[ind] == 0){
for(int c = 0; c <= k; c++){
R[ind - c]--;
}
order[ind] = ord;
ord++;
}
}
}
}
int compare_plants(int x, int y){
if(order[x] > order[y]){
return 1;
}
if(order[y] > order[x]){
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... | ||||
