# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72854 | square1001 | Teams (IOI15_teams) | C++14 | 4048 ms | 74800 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 <queue>
#include <vector>
#include <functional>
using namespace std;
vector<vector<int> > G;
void init(int N, int A[], int B[]) {
G.resize(N + 1);
for(int i = 0; i < N; ++i) {
G[A[i]].push_back(B[i]);
}
}
int can(int M, int K[]) {
vector<int> c(G.size());
for(int i = 0; i < M; ++i) ++c[K[i]];
priority_queue<int, vector<int>, greater<int> > que;
for(int i = 0; i < G.size(); ++i) {
for(int j : G[i]) que.push(j);
for(int j = 0; j < c[i]; ++j) {
for(int k = 0; k < i; ++k) {
bool f = false;
while(!que.empty()) {
int u = que.top(); que.pop();
if(u >= i) {
f = true;
break;
}
}
if(!f) return 0;
}
}
}
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... |