#include <iostream>
#include "king.h"
using namespace std;
long long SendInfo(vector <int> W, vector <int> C)
{
return 1;
}
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include "vassal.h"
using namespace std;
int N;
set <int> sit;
vector <int> C, W;
void Init(long long B, vector <int> C)
{
sort(C.begin(), C.end());
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 (C[mid] > w) {
right = mid - 1;
if (right <= left) {
res = mid;
break;
}
}
else if (C[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;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
736 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
41 ms |
4664 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
41 ms |
4564 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |