제출 #154018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154018		youssefbou62	팀들 (IOI15_teams)	C++14	21 / 100	4093 ms	10808 KiB

teams

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

#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long 
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll; 
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab  (int  x ) { return (x>0?x:-x); }
const int MaxN = 5e5+5; 
pi st[MaxN];
int n ; 
void init(int N,int a[],int b[]){
	n = N ; 
	for(int i = 0 ; i < n ;i++ ){
		st[i]={a[i],b[i]}; 
	} 
	sort(st,st+n); 
}
bool in(int x , pi p ){
	return (x>=p.fi && x<=p.se); 
}
int can(int M,int K[]){
	sort(K,K+M); 
	bool done[n]; 
	// cout << "********"<<endl; 
	memset(done,0,sizeof done); 
	for(int i = 0 ; i < M ; i++ ){
		int k = K[i];
		while (k--){
			int ind = -1 ; 
			for(int j = 0 ; j < n ; j++ ){
				if( !done[j] ){
					if( in(K[i],st[j] ) && (st[j].se < st[ind].se || ind == -1) )ind = j ; 
				}
			}

			if( ind == -1 )return 0 ;
			done[ind]=1; 
		}
		
	}
	return 1 ;
} 

// int main(){

// 	int a[]={1,2,2,2},b[]={2,3,3,4};
// 	init(4,a,b); 

// 	int K[]={1,3},KK[]={1,1}; 
// 	cout << can(2,K)<<" " << can(2,KK)<<endl; 

// }

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