oj.uz

답안 #577497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577497 2022-06-14T21:57:42 Z jeroenodb 쌀 창고 (IOI11_ricehub) C++14
100 / 100
 12 ms 2508 KB 
#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;

int besthub(int R, int L, int X[], long long B) {
    vector<ll> p(R+1);
    for(int i=0;i<R;++i) {
        p[i+1]=p[i]+X[i];
    }
    int ans=0;
    for(int i=0,j=0;i<R;++i) {
        auto cost = [&](int jj) {
            int m = i+(jj-i)/2, m2 = jj- (jj-i)/2;
            return (p[jj+1]-p[m2])-(p[m+1]-p[i]);
        };
        while(j<R-1 and cost(j+1)<=B) {
            ++j;
        }
        ans = max(ans,j-i+1);
    }
    return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 0 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 216 KB Output is correct
9 Correct 0 ms 220 KB Output is correct
10 Correct 1 ms 220 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 216 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 220 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 220 KB Output is correct
19 Correct 1 ms 216 KB Output is correct
20 Correct 0 ms 220 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 312 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 212 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 352 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 11 ms 2460 KB Output is correct
4 Correct 11 ms 2500 KB Output is correct
5 Correct 6 ms 1144 KB Output is correct
6 Correct 5 ms 1236 KB Output is correct
7 Correct 10 ms 2164 KB Output is correct
8 Correct 10 ms 2240 KB Output is correct
9 Correct 5 ms 1088 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 12 ms 2508 KB Output is correct
12 Correct 11 ms 2456 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 9 ms 1244 KB Output is correct
15 Correct 8 ms 1876 KB Output is correct
16 Correct 8 ms 1872 KB Output is correct
17 Correct 10 ms 2224 KB Output is correct
18 Correct 11 ms 2232 KB Output is correct
19 Correct 11 ms 2392 KB Output is correct
20 Correct 10 ms 2324 KB Output is correct