Submission #1268450

#TimeUsernameProblemLanguageResultExecution timeMemory
1268450abdelhakimComparing Plants (IOI20_plants)C++20
0 / 100
41 ms3140 KiB
#include <bits/stdc++.h> #include "plants.h" #define ll long long #define inf (ll) 1e17 using namespace std; vector<ll> p; ll n; void init(int k, std::vector<int> r) { n=r.size(); p.resize(n); vector<bool> vis(n); for (int i=0;i<n;i++) { r[i]=k-1-r[i]; } for (int i=0;i<n;i++) { ll ind=0; for (int j=0;j<n;j++) { if(vis[j]) continue; if(r[j]==0) { ind=j; j+=k; } } vis[ind]=true; p[ind]=i; for (int j=i-1;j>=i-k+1;j--) { ll index=j; if(index < 0) index+=n; r[index]--; } } } int compare_plants(int x, int y) { if(p[x]<p[y]) return -1; else return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...