# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668538 | LittleCube | 팀들 (IOI15_teams) | C++14 | 4030 ms | 16056 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>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
vector<pii> u, v;
void init(int N, int A[], int B[])
{
for (int i = 0; i < N; i++)
u.emplace_back(pii(A[i], B[i]));
}
int can(int M, int K[])
{
v = u;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < M; i++)
v.emplace_back(pii(K[i], 1e9));
sort(v.begin(), v.end());
for (auto [L, R] : v)
{
if (R >= 1e8)
{
while (!pq.empty() && pq.top() < L)
pq.pop();
while (!pq.empty() && L > 0)
{
pq.pop();
L--;
}
if (L)
return 0;
}
else
pq.push(R);
}
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... |