Submission #412956

#	Time	Username	Problem	Language	Result	Execution time	Memory
412956		ScarletS	팀들 (IOI15_teams)	C++17	0 / 100	223 ms	8832 KiB

teams

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

const int N = 5e5+7;
int n;
array<int,2> a[N];

bool cmp(array<int,2>& x, array<int,2> &y)
{
    return x[1] < y[1];
}

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

bool can(int m, int k[])
{
    sort(k,k+m);
    int c=0, x=0;
    for (int i=0;i<n&&c<m;++i)
        if (a[i][0]<=k[c]&&k[c]<=a[i][1])
            if (++x==k[c])
                x=0,++c;
    return c==m;
}

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