# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652914 | coding_snorlax | Comparing Plants (IOI20_plants) | C++14 | 1 ms | 308 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"
using namespace std;
int Answer[5005];
void init(int k,vector<int> r){
int Total=(int)r.size();
vector<int> zero;
int Count=0;
int Mark[5005]={0};
int now;
for(int j=0;j<(int)r.size();j++){
zero.clear();
for(int i=0;i<(int)r.size();i++){
if ((!r[i]) && (!Mark[i])){
zero.push_back(i);
}
}
int first=zero[int(zero.size())-1]-Total;
for(int i=0;i<(int)zero.size();i++){
if(zero[i]-first>=k){
now=zero[i];
break;
}
else first=zero[i];
}
Answer[now]=Count;
Mark[now]=1;
for(int i=now+Total;i>now+Total-k;i--){
r[i%Total]--;
}
Count++;
}
}
int compare_plants(int x,int y){
if(Answer[x]>Answer[y]) return 1;
else 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... |