제출 #302046

#제출 시각아이디문제언어결과실행 시간메모리
302046VEGAnn식물 비교 (IOI20_plants)C++14
14 / 100
4045 ms5240 KiB
#include "plants.h" #include <bits/stdc++.h> #define PB push_back #define sz(x) ((int)x.size()) using namespace std; const int N = 200100; const int oo = 2e9; vector<int> vc; int per[N]; void init(int k, vector<int> r) { int n = sz(r); assert(2 * k > n); for (int it = n - 1; it >= 0; it--){ vc.clear(); for (int i = 0; i < n; i++) if (r[i] == 0) vc.PB(i); // for (int i = 0; i < n; i++) // cerr << r[i] << " "; // cerr << '\n'; assert(sz(vc) > 0); int cand = -1; for (int it = 0; it < sz(vc); it++){ int cur = vc[it]; int pre = vc[(it + sz(vc) - 1) % sz(vc)]; if (pre < cur){ if (pre - cur + n < k){ cand = cur; break; } } else { if (pre - cur < k){ cand = cur; break; } } } per[cand] = it; r[cand] = oo; for (int i = 1, loc = cand; i < k; i++){ loc = (loc + n - 1) % n; r[loc]--; } } return; } int compare_plants(int x, int y) { return (per[x] > per[y] ? 1 : -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...