oj.uz

답안 #402515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402515 2021-05-11T21:47:41 Z Lobo 쌀 창고 (IOI11_ricehub) C++17
100 / 100
 24 ms 2116 KB 
#include <bits/stdc++.h>
#include <ricehub.h>
 
using namespace std;
 
const long long INFll = 1e18;
const int INFii = 1e9;
const long long mod = (long long) 1e9 + 7;
typedef long long ll;
typedef int ii;
typedef double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
 
#define maxn 110000
//LEMBRAR DE MUDAR
 
ll ps[maxn];
 
int besthub(int R, int L, int X[], long long B){
  
    ps[0] = 0;
    for(ll i = R; i >= 1; i--) {
        X[i] = X[i-1];
    }
 
    for(ll i = 1; i <= R; i++) {
        ps[i] = ps[i-1] + X[i]; 
    }
 
    ll ans = 0;
    for(ll i = 1; i <= R; i++) {
        ii l = i;
        ii r = R;
        ii mid = (l+r)/2;
        ii best = i;
 
        while(l <= r) {
            ll m = (i+mid)/2;
            ll cost = X[m]*(m-i+1) - ps[m] + ps[i-1]  +  ps[mid] - ps[m] - X[m]*(mid-m);
 
            if(cost <= B) {
                best = mid;
                l = mid+1;
                mid = (l+r)/2;
            }
            else {
                r = mid-1;
                mid = (l+r)/2;
            }
        }
 
        ans = max(ans, best-i+1LL);
 
    }
 
    return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 588 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 24 ms 2116 KB Output is correct
4 Correct 20 ms 1956 KB Output is correct
5 Correct 9 ms 1156 KB Output is correct
6 Correct 9 ms 892 KB Output is correct
7 Correct 24 ms 1424 KB Output is correct
8 Correct 18 ms 1484 KB Output is correct
9 Correct 11 ms 892 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 20 ms 1444 KB Output is correct
12 Correct 20 ms 1356 KB Output is correct
13 Correct 10 ms 844 KB Output is correct
14 Correct 10 ms 844 KB Output is correct
15 Correct 15 ms 1076 KB Output is correct
16 Correct 15 ms 1100 KB Output is correct
17 Correct 18 ms 1356 KB Output is correct
18 Correct 19 ms 1400 KB Output is correct
19 Correct 21 ms 1484 KB Output is correct
20 Correct 19 ms 1416 KB Output is correct