Submission #817269

#TimeUsernameProblemLanguageResultExecution timeMemory
817269jlallas384Comparing Plants (IOI20_plants)C++17
0 / 100
43 ms4936 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; vector<int> ans; void init(int k, std::vector<int> r) { int n = r.size(); ans.resize(n); for(int val = n - 1; val >= 0; val--){ int mn = 1e9, bst = -1; for(int i = 0; i < n; i++){ if(mn > r[i]){ mn = r[i]; bst = i; } } ans[bst] = val; r[bst] = 1e9; for(int i = 1; i < k; i++){ r[(bst - i + n) % n]--; } } } int compare_plants(int x, int y) { if(ans[x] > ans[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...