Submission #218771

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
218771	2020-04-02T17:37:33 Z	Andrei_Cotor	Rice Hub (IOI11_ricehub)	C++11	42 / 100	22 ms	2176 KB

ricehub

#include<algorithm>
#include"ricehub.h"

using namespace std;

int Sum[100005];

long long getCost(int st, int dr, int X[])
{
    int poz=(st+dr)/2;

    long long rez=-1LL*Sum[poz]+Sum[dr]-Sum[poz];;
    if(st>0)
        rez+=Sum[st-1];
    if((dr-st+1)%2==1)
        rez+=X[poz];
    return rez;
}

int besthub(int N, int L, int X[], long long B)
{
    Sum[0]=X[0];
    for(int i=1; i<=N; i++)
        Sum[i]=Sum[i-1]+X[i];

    int st=0;
    int rez=0;
    for(int i=0; i<N; i++)
    {
        if(getCost(st,i,X)>B)
            st++;
        rez=max(rez,i-st+1);
    }
    return rez;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct

Subtask #2

25.0 / 25.0

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

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	256 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Incorrect	5 ms	384 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	640 KB	Output is correct
2	Correct	8 ms	640 KB	Output is correct
3	Correct	22 ms	2176 KB	Output is correct
4	Incorrect	22 ms	2176 KB	Output isn't correct
5	Halted	0 ms	0 KB	-