답안 #871712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
871712	2023-11-11T11:01:45 Z	dsyz	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1000 ms	3676 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
using ll = long long;
#define MAXN (1000005)

int besthub(int R, int L, int X[], long long B){
	ll maximum = 0;
	for(ll pos = 0;pos < R;pos++){
		ll Lptr = pos;
		ll Rptr = pos;
		ll curcost = 0;
		while(Lptr > 0 && curcost + abs(X[pos] - X[Lptr - 1]) <= B){
			curcost += abs(X[pos] - X[Lptr - 1]);
			Lptr--;
		}
		while(Rptr < R - 1 && curcost + abs(X[pos] - X[Rptr + 1]) <= B){
			curcost += abs(X[pos] - X[Rptr + 1]);
			Rptr++;
		}
		while(Rptr < R - 1 && abs(X[pos] - X[Lptr]) > abs(X[pos] - X[Rptr + 1])){
			curcost -= abs(X[pos] - X[Lptr]);
			curcost += abs(X[pos] - X[Rptr + 1]);
			Lptr++;
			Rptr++;
			while(Rptr < R - 1 && curcost + abs(X[pos] - X[Rptr + 1]) <= B){
				curcost += abs(X[pos] - X[Rptr + 1]);
				Rptr++;
			}
		}
		maximum = max(maximum,Rptr - Lptr + 1);
	}
	return maximum;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

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

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	600 KB	Output is correct
2	Correct	4 ms	604 KB	Output is correct
3	Execution timed out	1087 ms	3676 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-