Submission #374663

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
374663	2021-03-07T19:32:25 Z	idk321	Teams (IOI15_teams)	C++11	34 / 100	4000 ms	27948 KB

teams

#include "teams.h"

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

int* k;

int n;
vector<array<int, 2>> v;

void init(int N, int A[], int B[]) {

    n = N;
    v.resize(n);
    for (int i = 0; i< n; i++)
    {
        v[i][0] = A[i];
        v[i][1] = B[i];
    }
    sort(v.begin(), v.end());
}

int can(int m, int K[]) {

    k = K;
    sort(k, k + m);
    vector<vector<int>> from(m);
    for (int i = 0; i < n; i++)
    {
        auto it = lower_bound(k, k + m, v[i][0]);
        if (it != k + m && v[i][1] >= *it)
        {
            from[it - k].push_back(v[i][1]);
        }
    }
    for (int i = 0; i < m; i++)
    {
        sort(from[i].begin(), from[i].end());
    }

    multiset<int> cur;
    for (int i = 0; i < m; i++)
    {

        for (int j : from[i]) cur.insert(j);
        while (!cur.empty() && *cur.begin() < k[i])
        {
            cur.erase(cur.begin());
        }
        for (int j = 0; j < k[i]; j++)
        {

            if (cur.empty())
            {
                return 0;
            }

            cur.erase(cur.begin());
        }
    }

	return 1;
}

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	640 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	2 ms	364 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	3052 KB	Output is correct
2	Correct	19 ms	3052 KB	Output is correct
3	Correct	30 ms	5096 KB	Output is correct
4	Correct	25 ms	5992 KB	Output is correct
5	Correct	24 ms	3308 KB	Output is correct
6	Correct	21 ms	3052 KB	Output is correct
7	Correct	17 ms	3308 KB	Output is correct
8	Correct	17 ms	3180 KB	Output is correct
9	Correct	38 ms	8676 KB	Output is correct
10	Correct	36 ms	8036 KB	Output is correct
11	Correct	36 ms	7652 KB	Output is correct
12	Correct	36 ms	7396 KB	Output is correct
13	Correct	35 ms	5992 KB	Output is correct
14	Correct	32 ms	6244 KB	Output is correct
15	Correct	21 ms	3692 KB	Output is correct
16	Correct	19 ms	3180 KB	Output is correct
17	Correct	29 ms	4588 KB	Output is correct
18	Correct	33 ms	4844 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	258 ms	3820 KB	Output is correct
2	Correct	312 ms	3820 KB	Output is correct
3	Execution timed out	4051 ms	6168 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1310 ms	16568 KB	Output is correct
2	Correct	1530 ms	16588 KB	Output is correct
3	Execution timed out	4035 ms	27948 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-