# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521738 | A_D | 식물 비교 (IOI20_plants) | C++14 | 1 ms | 460 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;
const int NN=2e5+100;
int a[NN];
int nn;
void init(int k,vector<int> r){
nn=r.size();
int cnt=nn;
vector<int> vec;
while(1){
vec.clear();
for(int i=0;i<nn;i++){
if(r[i]==0){
vec.push_back(i);
}
}
if(vec.empty())break;
reverse(vec.begin(),vec.end());
vec.push_back(vec[0]);
reverse(vec.begin(),vec.end());
int j;
int cn=0;
// cout<<"vector\n";
// for(auto x:vec)cout<<x<<" ";cout<<endl;
for(int i=0;i<vec.size()-1;i++){
if((vec[i+1]-vec[i]+nn)%nn+1>k){
j=vec[i];
// cout<<j<<" ";
cn++;
}
}
// cout<<endl;
// cout<<cn<<endl;
// cout<<j<<endl;
if(cn>1)assert(0);
if(vec.size()==2)j=vec[0];
a[j]=cnt--;
int h=k;
while(h--){
r[j]--;j++;j%=nn;
}
// for(int i=0;i<nn;i++)cout<<a[i]<<" ";cout<<endl;
// for(int i=0;i<nn;i++)cout<<r[i]<<" ";cout<<endl;
}
}
int compare_plants(int x, int y){
if(a[x]<a[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... |