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 "teams.h"
#include <bits/stdc++.h>
using namespace std;
struct unit{
int l, r;
bool operator<(const unit& rhs) const {
if(l == rhs.l){
return r < rhs.r;
}
return l < rhs.l;
}
};
vector<unit> v;
void init(int N, int A[], int B[]) {
unit t;
for(int i = 0 ; i < N; i++){
t.l = A[i];
t.r = B[i];
v.push_back(t);
}
sort(v.begin(), v.end());
}
int can(int M, int K[]) {
vector<int> q;
for(int i = 0; i < M; i++){
q.push_back(K[i]);
}
sort(q.begin(), q.end());
int i = 0, t = q[0];
for(auto x : v){
if(q[i] <= x.r && q[i] >= x.l){
t--;
if(t == 0){
i++;
if(i == M){
return 1;
}
t = q[i];
}
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |