| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 285439 | Ozy | Teams (IOI15_teams) | C++17 | 4083 ms | 12908 KiB |
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;
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define debug(a) cerr << #a << " = " << a << endl;
struct x{
int ini;
int fin;
bool operator < (const x &a)
const {
//duda
return ini > a.ini;
}
};
vector<x> inicios;
priority_queue<int> cola;
void init(int N, int A[], int B[]) {
rep(i,0,N-1) inicios.push_back({A[i],B[i]});
sort(inicios.begin(), inicios.end());
}
int can(int M, int K[]) {
int cont;
sort(K,K+M);
while (!cola.empty()) cola.pop();
cont = 0;
rep(i,0,M) {
while(cont < inicios.size() && inicios[cont].ini <= K[i]) {
cola.push(-inicios[cont].fin);
cont++;
}
while (!cola.empty() && abs(cola.top()) < K[i]) cola.pop();
if (cola.size() < K[i]) return 0;
else rep(j,1,K[i]) cola.pop();
}
return 1;
}
Compilation message (stderr)
| # | 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... | ||||
