# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287884 | kshitij_sodani | Teams (IOI15_teams) | C++14 | 4059 ms | 23876 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>
using namespace std;
typedef long long int llo;
#define a first
#define b second
#define pb push_back
#define mp make_pair
#include "teams.h"
int n;
int aa[500001];
int bb[500001];
void init(int nn, int A[], int B[]) {
n=nn;
for(int i=0;i<n;i++){
aa[i]=A[i];
bb[i]=B[i];
}
}
int can(int m, int k[]){
vector<pair<int,int>> xx;
for(int i=0;i<n;i++){
xx.pb({aa[i],bb[i]});
}
for(int i=0;i<m;i++){
xx.pb({k[i],n+1});
}
sort(xx.begin(),xx.end());
multiset<int> cur;
for(auto j:xx){
if(j.b==n+1){
while(cur.size()){
if(*(cur.begin())<j.a){
cur.erase(cur.begin());
}
else{
break;
}
}
for(int k=0;k<j.a;k++){
if(cur.size()==0){
return 0;
}
cur.erase(cur.begin());
}
}
else{
cur.insert(j.b);
}
}
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... |