# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93481 | tincamatei | Teams (IOI15_teams) | C++14 | 4094 ms | 63476 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 <bits/stdc++.h>
#include "teams.h"
using namespace std;
const int MAX_N = 500000;
int n;
int a[MAX_N], b[1+MAX_N];
int poz[1+MAX_N];
vector<int> goright[1+MAX_N];
vector<int> goleft[1+MAX_N];
void init(int N, int A[], int B[]) {
n = N;
for(int i = 0; i < n; ++i) {
poz[i] = i;
a[i] = A[i];
b[i] = B[i];
}
for(int i = 0; i < N; ++i) {
goright[a[i]].push_back(i);
goleft[b[i]].push_back(i);
}
}
int can(int M, int K[]) {
set<pair<int, int> > xd;
int lastup = 0;
for(int i = 1; i <= n; ++i) {
for(int j = 0; j < goright[i].size(); ++j) {
int it = goright[i][j];
xd.insert(make_pair(b[it], it));
}
while(lastup < M && K[lastup] == i) {
for(int j = 0; j < i; ++j) {
if(xd.empty())
return false;
xd.erase(xd.begin());
}
++lastup;
}
for(int j = 0; j < goleft[i].size(); ++j) {
int it = goleft[i][j];
xd.erase(make_pair(i, it));
}
}
return lastup < M;
}
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... |