oj.uz

답안 #412959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412959 2021-05-27T21:02:17 Z ScarletS 팀들 (IOI15_teams) C++17
0 / 100
 216 ms 8836 KB 
#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,cmp);
}

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;
}

// int main()
// {
//     int t,q,k;
//     cin>>t;
//     int A[t],B[t];
//     for (int i=0;i<t;++i)
//         cin>>A[i]>>B[i];
//     init(t,A,B);
//     cin>>q;
//     while (q--)
//     {
//         cin>>k;
//         int c[k];
//         for (int i=0;i<k;++i)
//             cin>>c[i];
//         cout<<can(k,c)<<"\n";
//     }
// }

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Incorrect 1 ms 332 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 1880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 216 ms 8836 KB Output isn't correct
2 Halted 0 ms 0 KB -