Submission #287653

#	Time	Username	Problem	Language	Result	Execution time	Memory
287653		b00n0rp	Teams (IOI15_teams)	C++17	34 / 100	4045 ms	12660 KiB

teams

#include "teams.h"
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define F first
#define S second

const int MAXN = 500005;
const int LIM = 1000;

int n;
pii a[MAXN];
int dp[MAXN];

void init(int N, int A[], int B[]){
	n = N;
	for(int i = 0; i < n; i ++){
		a[i] = {A[i],B[i]};
	}
	sort(a,a+n);
}

int query(int l,int r,int val){
	int res = 0;
	for(int i = l; i <= r; i++){
		if(a[i].S >= val) res++;
	}
	return res;
}

int can(int M, int K[]) {
	sort(K,K+M);
	if(M > 0){
		priority_queue<int,vector<int>,greater<int> > pq;
		int cur = 0;
		for(int i = 0; i < M; i ++){
			while(cur < n and a[cur].F <= K[i]){
				pq.push(a[cur].S);
				cur++;
			}
			int cnt = 0;
			while(cnt < K[i] and (!pq.empty())){
				int x = pq.top();
				pq.pop();
				if(x >= K[i]) cnt++;
			}
			if(cnt < K[i]) return 0;
		}
		return 1;
	}
	else{
		dp[0] = 0;
		for(int i = 1; i <= M; i ++){
			dp[i] = n+1;
			for(int j = 0; j < i; j ++){
				// dp[j] + (No. of kids (A, B) satisfying K[j-1] < A <= K[i-1] and B >= K[i-1]))-K[i-1]
				int ind1 = (j?(lower_bound(a,a+n,make_pair(K[j-1]+1,-1))-a):0);
				int ind2 = (lower_bound(a,a+n,make_pair(K[i-1]+1,-1))-a)-1;
				dp[i] = min(dp[i],dp[j]-K[i-1]+query(ind1,ind2,K[i-1]));
			}
			if(dp[i] < 0) return 0;
		}
		return 1;
	}
}

Compilation message (stderr)

teams.cpp: In function 'int can(int, int*)':
teams.cpp:58:18: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   58 |     int ind1 = (j?(lower_bound(a,a+n,make_pair(K[j-1]+1,-1))-a):0);
      |                ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
teams.cpp:59:61: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   59 |     int ind2 = (lower_bound(a,a+n,make_pair(K[i-1]+1,-1))-a)-1;
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23