Submission #153440

#TimeUsernameProblemLanguageResultExecution timeMemory
153440phparkKing of Chairs (FXCUP4_chairs)C++17
0 / 100
55 ms5928 KiB
#include "king.h" using namespace std; long long SendInfo(vector <int> W, vector <int> C) { return 1; }
#include <set> #include <iostream> #include <vector> #include <algorithm> #include "vassal.h" using namespace std; static multiset <int> sit; static vector <int> chair; static int N; void Init(long long B, vector <int> C) { N = C.size(); chair.resize(N); chair = C; for (int i = 0; i < N; i++) sit.insert(chair[i]); } int Maid(int w) { int left = 0, right = N, mid = 0; auto itr = sit.lower_bound(w); if (itr == sit.end()) { return -1; } else { int ans = *itr; int idx = 0; while (right <= left) { if (ans < chair[mid]) { right = mid - 1; } else if (chair[mid] < ans) { left = mid + 1; } else { idx = mid; } } sit.erase(sit.find(ans)); return (int)idx; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...