Submission #153160

#TimeUsernameProblemLanguageResultExecution timeMemory
153160phparkKing of Chairs (FXCUP4_chairs)C++17
0 / 100
41 ms5376 KiB
#include "king.h" using namespace std; long long SendInfo(vector <int> W, vector <int> C) { return 1; }
#include <set> #include <vector> #include <algorithm> #include "vassal.h" using namespace std; set <int> sit; int N; vector <int> chair; void Init(long long B, vector <int> C) { copy(C.begin(), C.end(), chair.begin()); sort(chair.begin(), chair.end()); N = C.size(); for (int i = 0; i < N; i++) sit.insert(i); } int Maid(int w) { int right = 0, left = 0, mid = 0, res = 0; while (right <= left) { mid = (right + left) / 2; if (chair[mid] > w) { right = mid - 1; if (right <= left) { res = mid; break; } } else if (chair[mid] < w) { left = mid + 1; if (right <= left) { res = right; break; } } else { res = mid; break; } } auto itr = sit.upper_bound(res); if (itr == sit.end()) { return -1; } else { int answer = *itr; sit.erase(itr); return answer; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...