답안 #672015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672015 2022-12-14T15:43:38 Z Hacv16 쌀 창고 (IOI11_ricehub) C++17
43 / 100
1000 ms 596 KB
#include<bits/stdc++.h>
#include "ricehub.h"

using namespace std;

typedef long long ll;
const int INF = 0x3f3f3f3f;

int besthub(int n, int l, int x[], ll b){
	int ans = 1;

	for(int mid = 0; mid < n; mid++){
		int cnt = 1, l = mid - 1, r = mid + 1;
		ll av = b;
  	
  		while(b && (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 ans;
}
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 4 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 3 ms 212 KB Output is correct
19 Correct 4 ms 316 KB Output is correct
20 Correct 4 ms 212 KB Output is correct
21 Correct 3 ms 212 KB Output is correct
22 Correct 4 ms 212 KB Output is correct
23 Correct 57 ms 312 KB Output is correct
24 Correct 50 ms 308 KB Output is correct
25 Correct 93 ms 212 KB Output is correct
26 Correct 93 ms 212 KB Output is correct
27 Correct 27 ms 328 KB Output is correct
28 Correct 32 ms 308 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Execution timed out 1094 ms 596 KB Time limit exceeded
4 Halted 0 ms 0 KB -