Submission #133806

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
133806	2019-07-21T12:40:28 Z	Runtime_error_	Teams (IOI15_teams)	C++14	34 / 100	4000 ms	39916 KB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 5e5+9;
int n,team[inf];
vector<int> v[inf];

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

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

    for(int i=1;i<=n;i++)
        team[i] = 0;

    multiset<int> CurEnd;
    for(int i=0;i<M;i++)
        team[ K[i] ] +=K[i] ;

    for(int i=1;i<=n;i++){
        while(!CurEnd.empty() && *CurEnd.begin()<i)
            CurEnd.erase(CurEnd.begin());
        for(auto o:v[i])
            CurEnd.insert(o);

        if(CurEnd.size() < team[i])
            return 0;
        while(team[i]--)
            CurEnd.erase(CurEnd.begin());

    }

    return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:31:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(CurEnd.size() < team[i])
            ~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1

21.0 / 21.0

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

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	16176 KB	Output is correct
2	Correct	31 ms	16252 KB	Output is correct
3	Correct	75 ms	18604 KB	Output is correct
4	Correct	33 ms	16764 KB	Output is correct
5	Correct	28 ms	14712 KB	Output is correct
6	Correct	27 ms	14584 KB	Output is correct
7	Correct	18 ms	14584 KB	Output is correct
8	Correct	19 ms	14584 KB	Output is correct
9	Correct	49 ms	19316 KB	Output is correct
10	Correct	47 ms	18928 KB	Output is correct
11	Correct	48 ms	18928 KB	Output is correct
12	Correct	40 ms	18672 KB	Output is correct
13	Correct	44 ms	17652 KB	Output is correct
14	Correct	57 ms	19696 KB	Output is correct
15	Correct	75 ms	18040 KB	Output is correct
16	Correct	30 ms	16120 KB	Output is correct
17	Correct	36 ms	15968 KB	Output is correct
18	Correct	37 ms	16120 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	48 ms	16632 KB	Output is correct
2	Correct	48 ms	16632 KB	Output is correct
3	Execution timed out	4091 ms	18808 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	219 ms	28904 KB	Output is correct
2	Correct	228 ms	28876 KB	Output is correct
3	Execution timed out	4030 ms	39916 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-