| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 727226 | vjudge1 | Teams (IOI15_teams) | C++11 | 4041 ms | 20708 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;
const int MAXN = 5e5;
int n;
int a[MAXN], b[MAXN], ord[MAXN];
void init(int N, int A[], int B[]) {
n = N;
for (int i = 0; i < n; i++) a[i] = A[i], b[i] = B[i];
iota(ord, ord + n, 0);
sort(ord, ord + n, [](int i, int j) {
return a[i] < a[j];
});
}
int can(int M, int K[]) {
priority_queue<int> pq;
int j = 0;
sort(K, K + M);
for (int i = 0; i < M; i++) {
while (j < n && a[ord[j]] <= K[i]) pq.emplace(-b[ord[j++]]);
while (pq.size() && -pq.top() < K[i]) pq.pop();
if (pq.size() < K[i]) return 0;
while (K[i]--) pq.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... | ||||
