oj.uz

답안 #5038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
5038 2014-01-29T05:56:30 Z cki86201 쌀 창고 (IOI11_ricehub) C++
100 / 100
 20 ms 5776 KB 
typedef long long ll;
ll S[100010];

#define get(s,m,d) (S[(d)]-S[(m)]+X[(m)]*(2*(m)-(s)-(d))-S[(m)-1]+S[(s)-1])

int besthub(int R,int L,int *X,ll B)
{
	int i,j,a=0;
	for(i=R;i;i--)X[i]=X[i-1];
	for(i=1;i<=R;i++)S[i]=S[i-1]+X[i];
	for(i=j=1;i<=R;i++){
		while(j<i&&get(j,(j+i)>>1,i)>B)j++;
		a=a>i-j?a:i-j;
	}
	return a+1;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5776 KB Output is correct
2 Correct 0 ms 5776 KB Output is correct
3 Correct 16 ms 5776 KB Output is correct
4 Correct 16 ms 5776 KB Output is correct
5 Correct 8 ms 5776 KB Output is correct
6 Correct 8 ms 5776 KB Output is correct
7 Correct 12 ms 5776 KB Output is correct
8 Correct 16 ms 5776 KB Output is correct
9 Correct 4 ms 5776 KB Output is correct
10 Correct 8 ms 5776 KB Output is correct
11 Correct 16 ms 5776 KB Output is correct
12 Correct 20 ms 5776 KB Output is correct
13 Correct 8 ms 5776 KB Output is correct
14 Correct 8 ms 5776 KB Output is correct
15 Correct 12 ms 5776 KB Output is correct
16 Correct 12 ms 5776 KB Output is correct
17 Correct 16 ms 5776 KB Output is correct
18 Correct 12 ms 5776 KB Output is correct
19 Correct 16 ms 5776 KB Output is correct
20 Correct 16 ms 5776 KB Output is correct