This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "king.h"
long long SendInfo(std::vector<int> W, std::vector<int> C) {
return 0;
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> C;
int p[200005];
int find(int a){
if(a != p[a]) return p[a] = find(p[a]);
return a;
}
void Init(long long B, std::vector<int> C){
n = C.size();
for(int i = 0; i < n; i++)
p[i] = i;
::C = C;
}
int Maid(int W){
int a = lower_bound(C.begin(), C.end(), W) - C.begin();
a = find(a);
if(a >= n) return -1;
p[a] = a + 1;
return a;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |