| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 46320 | rajarshi_basu | Teams (IOI15_teams) | C++14 | 0 ms | 0 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 <iostream>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define pb(a) push_back(a)
#define vi vector<int>
#define ii pair<int,int>
#define iii pair<pair<int,int>, int>
#define mp(a,b) make_pair(a,b)
using namespace std;
#define ff first
#define ss second
int n;
int* a;
int* b;
ii* arr;
bool comp(ii a,ii b){
return a.ss > b.ss;
}
class Compare
{
public:
bool comp(ii a,ii b){
return a.ss > b.ss;
}
bool operator() (ii a, ii b)
{
return comp(a,b);
}
};
void init(int N,int* A,int* B){
n=N;
a = A;
b = B;
arr = new ii[n];
FOR(i,n)arr[i].ff = a[i];
FOR(i,n)arr[i].ss = b[i];
sort(arr,arr+n);
}
bool call(int m,int* k){
priority_queue<ii, vector<ii> , Compare > pq;
int PTR = 0;
FOR(i,m){
while(arr[PTR].ff<=k[i])pq.push(arr[PTR++]);
int ctr = k[i];
while(!pq.empty() && pq.top().ss < ctr)pq.pop();
while(!pq.empty() && pq.top().ss < k[i] && ctr > 0){
pq.pop();
ctr--;
}
if(ctr > 0)return 0;
}
return 1;
}