# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090045 | onlk97 | Comparing Plants (IOI20_plants) | C++14 | 4075 ms | 8908 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;
vector <int> p;
void init(int k,vector <int> r){
int n=r.size();
p.resize(n);
for (int i=n; i; i--){
vector <int> vec;
for (int j=0; j<n; j++){
if (!r[j]) vec.push_back(j);
}
int idx=vec[0];
if (vec.size()>=2){
int g=vec[0]-vec.back()+n;
for (int j=1; j<vec.size(); j++){
if (vec[j]-vec[j-1]>g){
g=vec[j]-vec[j-1];
idx=vec[j];
}
}
}
p[idx]=i;
r[idx]=1e9;
for (int j=0; j<k; j++){
r[idx]--;
idx--;
if (idx<0) idx+=n;
}
}
}
int compare_plants(int x,int y){
if (p[x]>p[y]) return 1;
return -1;
}
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... |