| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 488458 | blue | Teams (IOI15_teams) | C++17 | 4085 ms | 14132 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 <vector>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
int N;
vpii PG;
void init(int N_, int A[], int B[])
{
N = N_;
for(int i = 0; i < N; i++) PG.push_back({A[i], B[i]});
sort(PG.begin(), PG.end(), [] (pii p, pii q)
{
return p.second < q.second;
});
}
int can(int M, int K[])
{
sort(K, K+M);
vpii P = PG;
vi done(M, 0);
int i = 0;
vi used(N, 0);
for(int t = 0; t < M; t++)
{
for(int i = 0; i < N; i++)
{
if(done[t] == K[t]) break;
if(used[i]) continue;
if(!(P[i].first <= K[t] && K[t] <= P[i].second)) continue;
done[t]++;
used[i]++;
}
}
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... | ||||
