제출 #745640

#제출 시각아이디문제언어결과실행 시간메모리
745640ogibogi2004팀들 (IOI15_teams)C++14
0 / 100
4077 ms9012 KiB
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=5e5+6;

int n;
int a[MAXN];
int b[MAXN];

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

int can(int M, int K[]) {
    sort(K,K+M);
    int sum=0;
    for(int l=0;l<M;l++)
    {
        sum=0;
        for(int r=l;r<M;r++)
        {
            sum+=K[r];
            int cnt_av=0;
            for(int i=0;i<n;i++)
            {
                for(int j=l;j<=r;j++)
                {
                    if(a[i]<=K[j]&&b[i]>=K[j]){cnt_av++;break;}
                }
            }
            if(cnt_av<sum)return 0;
        }
    }
	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...