답안 #971725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
971725	2024-04-29T08:17:56 Z	batsukh2006	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1000 ms	2652 KB

ricehub

#include<bits/stdc++.h>
//#include "ricehub"
using namespace std;
#define ss second
#define ff first
#define endl '\n'
int besthub(int r, int l, int x[], long long B){
	int ans=0;
	for(int i=0; i<r; i++){
		long long b=B;
		int sum=1;
		int lt=i-1,rt=i+1;
		while(lt>=0||rt<r){
			if(lt>=0&&(abs(x[i]-x[lt])<=abs(x[i]-x[rt])||rt==r)){
				if(abs(x[i]-x[lt])>b) break;
				sum++;
				b-=abs(x[i]-x[lt--]);
			}else{
				if(abs(x[i]-x[rt])>b) break;
				sum++;
				b-=abs(x[i]-x[rt++]);
			}
		}
		ans=max(ans,sum);
	}
	return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
6	Correct	0 ms	388 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	1 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	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 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	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	344 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	352 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	352 KB	Output is correct
14	Correct	2 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	3 ms	348 KB	Output is correct
18	Correct	3 ms	448 KB	Output is correct
19	Correct	5 ms	348 KB	Output is correct
20	Correct	4 ms	344 KB	Output is correct
21	Correct	3 ms	348 KB	Output is correct
22	Correct	3 ms	348 KB	Output is correct
23	Correct	46 ms	348 KB	Output is correct
24	Correct	42 ms	344 KB	Output is correct
25	Correct	98 ms	348 KB	Output is correct
26	Correct	104 ms	484 KB	Output is correct
27	Correct	33 ms	348 KB	Output is correct
28	Correct	28 ms	348 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	348 KB	Output is correct
2	Correct	5 ms	348 KB	Output is correct
3	Execution timed out	1096 ms	2652 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-