# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397247 | Antekb | Comparing Plants (IOI20_plants) | C++14 | 4070 ms | 9864 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>
#define pb(x) push_back(x)
using namespace std;
vector<int> V, V2;
void init(int k, std::vector<int> r) {
int n=r.size();
k--;
V.resize(n);
auto r2=r;
for(int i=0; i<n; i++){
vector<int> V2;
for(int j=0; j<n; j++){
if(r2[j]==k){
V2.push_back(j);
}
}
int j=V2[0];
if(V2.size()>1){
for(int l=0; l<V2.size(); l++)if(((V2[(l+1)%(V2.size())]-V2[l]+n)%n)>k)j=V2[(l+1)%V2.size()];
}
V[j]=i;
r2[j]=-1;
for(int l=1; l<=k; l++){
r2[(j-l+n)%n]++;
}
}
return;
}
int compare_plants(int x, int y){
if(V[x]<V[y])return -1;
if(V[x]>V[y])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... |