답안 #207781

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207781	2020-03-09T00:06:32 Z	peuch	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	23 ms	2296 KB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 200000;
long long sumD[MAXN], sumE[MAXN];

bool test(int ini, int fim, int R, long long B, int X[]);

int besthub(int R, int L, int X[], long long B)
{	
    	int ans = 0;
        sumD[0] = X[0]; 
        sumE[R - 1] = 0;
    	for(int i = R - 2; i >= 0; i--)
    		sumE[i] = sumE[i + 1] + X[R - 1] - X[i];
    	for(int i = 1; i < R; i++)
    		sumD[i] = sumD[i - 1] + X[i];
    	for(int ini = 0, fim = 0; ini < R; ini++){
    		while(test(ini, fim, R, B, X) && fim < R) fim++;
    		ans = max(fim - ini, ans);
    	}
    	return ans;
}

bool test(int ini, int fim, int R, long long B, int X[]){
    int m = (ini + fim) >> 1;
  	return (sumD[fim] - sumD[m] - (fim - m) * X[m]) + (sumE[ini] - sumE[m] - (m - ini) * (X[R - 1] - X[m])) <= B;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	248 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	6 ms	376 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	504 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	504 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	6 ms	504 KB	Output is correct
26	Correct	6 ms	376 KB	Output is correct
27	Correct	5 ms	508 KB	Output is correct
28	Correct	5 ms	380 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	760 KB	Output is correct
2	Correct	8 ms	760 KB	Output is correct
3	Correct	23 ms	2296 KB	Output is correct
4	Incorrect	23 ms	2296 KB	Output isn't correct
5	Halted	0 ms	0 KB	-