답안 #672028

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672028	2022-12-14T16:05:10 Z	Hacv16	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1000 ms	572 KB

ricehub

#include<bits/stdc++.h>
#include "ricehub.h"
 
using namespace std;
 
typedef long long ll;
const ll INF = 5e18 + 15;

int besthub(int n, int l, int x[], ll b){
	ll ans = 0;
 
	for(int mid = 0; mid < n; mid++){
		ll cnt = 1, l = mid - 1, r = mid + 1;
		ll av = b;
  	
  		while(av >= 0 && (l >= 0 || r < n)){
  			ll dl = (l >= 0 ? x[mid] - x[l] : INF);
  			ll dr = (r <  n ? x[r] - x[mid] : INF);
 
  			if(av - min(dl, dr) < 0) break;
  			av -= min(dl, dr);
 
  			if(dl < dr) l--;
  			else r++;
 
  			cnt++;
  		}
  		
  		ans = max(ans, cnt);
	}
 
	return (int) ans;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

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

Subtask #4

0 / 32.0

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