Submission #128190

#	Time	Username	Problem	Language	Result	Execution time	Memory
128190		MoNsTeR_CuBe	Teams (IOI15_teams)	C++17	0 / 100	4091 ms	13304 KiB

teams

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

vector< int > usefulPerson;

vector< int > A;
vector< int > B;
int N;

void init(int n, int a[], int b[]) {
	N = n;
	
	A.resize(n);
	B.resize(n);
	 
	vector< pair<int, int> > temp(n);
	 
	for(int i = 0; i < n; i++){
		A[i] = a[i];
		B[i] = b[i];
		temp[i] = make_pair(b[i], a[i]);
	}
	
	sort(temp.begin(), temp.end());
	
	for(int i = 0; i < n; i++){
		b[i] = temp[i].first;
		a[i] = temp[i].second;
	}
}

int can(int M, int K[]) {
	
	sort(K, K+M);
	
	vector< int > visited(N, false);
	
	for(int i = 0; i < M; i++){
		int rem = K[i];
		for(int j = 0; j < N; j++){
			if(A[j] <= K[i] && B[j] >= K[i] && !visited[j] && rem){
				visited[j] = true;
				rem--;
			}
			if(!rem) break;
		}
		if(rem) return 0;
	}
	
	return 1;
	
}

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