oj.uz

답안 #486016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486016 2021-11-10T07:16:16 Z Jomnoi 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 151 ms 1636 KB 
#include <bits/stdc++.h>
#include <ricehub.h>
#define DEBUG 0
using namespace std;

int cost(int R, int X[], int pos, long long B) {
    vector <int> truckload;
    for(int i = 0; i < R; i++) {
        truckload.push_back(abs(X[i] - pos));
    }
    sort(truckload.begin(), truckload.end());
    long long sum = 0;
    for(int i = 0; i < R; i++) {
        if(sum + truckload[i] > B) {
            return i;
        }
        sum += truckload[i];
    }
    return R;
}

int besthub(int R, int L, int X[], long long B) {
    int l = 1, r = L, ans = 0;
    while(l <= r) {
        int mid = (l + r) / 2;
        int cost1 = cost(R, X, mid, B);
        int pos2 = mid + 1;
        // int l2 = l + 1, r2 = r, pos2 = r;
        // while(l2 <= r2) {
        //     int mid2 = (l2 + r2) / 2;
        //     int cost2 = cost(R, X, mid2, B);
        //     if(cost1 == cost2) {
        //         l2 = mid2 + 1;
        //     }
        //     else {
        //         r2 = mid2 - 1;
        //         pos2 = min(pos2, mid2);
        //     }
        // }
        int cost2 = cost(R, X, pos2, B);
        if(cost1 > cost2) {
            r = mid - 1;
            ans = max(ans, cost1);
        }
        else {
            l = mid + 1;
            ans = max(ans, cost2);
        }
    }
    return ans;
}

// int main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     int r, l, b;
//     cin >> r >> l >> b;
//     int x[l];
//     for(int i = 0; i < r; i++) {
//         cin >> x[i];
//     }
//     cout << besthub(r, l, x, b);
//     return 0;
// }

/*
5 20 6
1 2 10 12 14
*/

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Incorrect 0 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
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 0 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 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 588 KB Output is correct
2 Correct 14 ms 720 KB Output is correct
3 Correct 151 ms 1636 KB Output is correct
4 Correct 122 ms 1596 KB Output is correct
5 Incorrect 30 ms 972 KB Output isn't correct
6 Halted 0 ms 0 KB -