Submission #922060

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922060	2024-02-05T00:44:09 Z	coding_snorlax	Teams (IOI15_teams)	C++14	34 / 100	4000 ms	13516 KB

teams

#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> List[100005];
int Req[100005]={0};
multiset<int> in_queue;
int n;
void init(int N, int A[], int B[]) {
    n=N;
    for(int i=0;i<N;i++) List[A[i]].push_back(B[i]);
}

int can(int M, int K[]) {
    for(int i=0;i<=n;i++) Req[i]=0;
    in_queue.clear();
    for(int i=0;i<M;i++){
        Req[K[i]]+=K[i];
    }
    for(int i=1;i<=n;i++){
        for(int j:List[i]) in_queue.insert(j);
        while(Req[i]){
            if(in_queue.size()) in_queue.erase(in_queue.begin());
            else return 0;
            Req[i]--;
        }
        in_queue.erase(i);
    }
	return 1;
}

Subtask #1

21.0 / 21.0

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

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	5720 KB	Output is correct
2	Correct	13 ms	5976 KB	Output is correct
3	Correct	34 ms	8028 KB	Output is correct
4	Correct	11 ms	7516 KB	Output is correct
5	Correct	11 ms	5208 KB	Output is correct
6	Correct	10 ms	5212 KB	Output is correct
7	Correct	5 ms	5212 KB	Output is correct
8	Correct	5 ms	5396 KB	Output is correct
9	Correct	21 ms	9936 KB	Output is correct
10	Correct	20 ms	9428 KB	Output is correct
11	Correct	25 ms	9420 KB	Output is correct
12	Correct	18 ms	9264 KB	Output is correct
13	Correct	20 ms	8060 KB	Output is correct
14	Correct	28 ms	10304 KB	Output is correct
15	Correct	30 ms	8504 KB	Output is correct
16	Correct	10 ms	6748 KB	Output is correct
17	Correct	17 ms	6536 KB	Output is correct
18	Correct	18 ms	6748 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	5980 KB	Output is correct
2	Correct	16 ms	5940 KB	Output is correct
3	Execution timed out	4026 ms	8120 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	30 ms	13516 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-