# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780485 | vjudge1 | Teams (IOI15_teams) | C++17 | 4027 ms | 18040 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 pb push_back
#define st first
#define nd second
#define sp " "
#define pii pair<int, int>
int a[500005], b[500005], n;
void init(int N, int A[], int B[]) {
n = N;
vector<int> v(N);
iota(v.begin(), v.end(), 0);
sort(v.begin(), v.end(), [&](int a, int b){
if (B[a] == B[b]) return A[a] < B[a];
return B[a] < B[b];
});
for (int i = 0; i < N; i++)
a[i] = A[v[i]], b[i] = B[v[i]];
}
int can(int M, int K[]) {
int i = 0, j = 0;
while(i < n && j < M){
int curr = K[j];
while(i < n && b[i] < curr) i++;
if (i == n) return 0;
while(curr > 0 && i < n && a[i] <= K[j]) i++, curr--;
if (curr > 0) return 0;
j++;
}
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... |