답안 #1084939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084939 2024-09-07T08:48:38 Z PakinDioxide 쌀 창고 (IOI11_ricehub) C++17
100 / 100
12 ms 2660 KB
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

int besthub(int n, int m, int a[], long long x) {
    int mx = 0, l = 1, r = 0;
    long long p[n+1];
    p[0] = 0;
    for (int i = 0; i < n; i++) p[i+1] = p[i] + a[i];
    while (r < n) {
        r++;
        while (p[r] - p[(l + r + 1)/2 - ((r - l) % 2)] - p[(l + r - 1)/2] + p[l-1] > x) l++;
        mx = max(mx, r - l + 1);
    }
    return mx;
}
# 결과 실행 시간 메모리 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
# 결과 실행 시간 메모리 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
6 Correct 0 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 1 ms 344 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 348 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 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 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 452 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 344 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 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 344 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 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 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 488 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 772 KB Output is correct
3 Correct 10 ms 2652 KB Output is correct
4 Correct 12 ms 2652 KB Output is correct
5 Correct 5 ms 1372 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 10 ms 2264 KB Output is correct
8 Correct 10 ms 2396 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 10 ms 2660 KB Output is correct
12 Correct 10 ms 2652 KB Output is correct
13 Correct 4 ms 1368 KB Output is correct
14 Correct 5 ms 1372 KB Output is correct
15 Correct 7 ms 2008 KB Output is correct
16 Correct 10 ms 1884 KB Output is correct
17 Correct 10 ms 2396 KB Output is correct
18 Correct 8 ms 2316 KB Output is correct
19 Correct 8 ms 2508 KB Output is correct
20 Correct 9 ms 2396 KB Output is correct