제출 #819792

#제출 시각아이디문제언어결과실행 시간메모리
819792Abrar_Al_Samit식물 비교 (IOI20_plants)C++17
14 / 100
182 ms7700 KiB
#include <bits/stdc++.h> #include "plants.h" using namespace std; const int nax = 5002; int val[nax], n, k; bool done[nax]; bool cmp(int x, int y) { if(x + k - 1 < n) { return y > x && y <= x + k - 1; } else { if(y < x) return (x + k - 1) % n >= y; else return y > x; } } void init(int K, vector<int> r) { k = K; n = r.size(); for(int tg=1; tg<=n; ++tg) { int mn = -1; for(int i=0; i<n; ++i) if(!done[i] && r[i]==k-1) { if(mn==-1) mn = i; else if(!cmp(mn, i)) mn = i; } val[mn] = tg; done[mn] = true; for(int i=mn, cnt=0; cnt<k; ++cnt, i=(i-1+n)%n) { ++r[i]; } } // for(int i=0; i<n; ++i) { // cerr<<val[i]<<' '; // } // cerr<<'\n'; } int compare_plants(int x, int y) { if(val[x]>val[y]) return 1; 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...