oj.uz

답안 #1015739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015739 2024-07-06T17:45:10 Z KasymK 쌀 창고 (IOI11_ricehub) C++17
17 / 100
 1000 ms 936 KB 
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(v) v.begin(), v.end()

int besthub(int r, int l, int x[], ll b){
    int ans = 0;
    for(int hub = 1; hub <= l; ++hub){
        vector<int> v;
        for(int i = 0; i < r; ++i)
            v.pb(abs(hub-x[i]));
        sort(v.rbegin(), v.rend());
        ll b_ = b;
        int cnt = 0;
        while(1){
            int x = v.back();
            if(b_-x >= 0)
                b_ -= x, v.pop_back(), cnt++;
            else
                break;
        }
        ans = max(ans, cnt);
    }
    return ans;
}

// const int N = 20;
// int a[N];

// int main(){
//     int r, l;
//     ll b;
//     r = 5, l = 20, b = 6;
//     a[0] = 1, a[1] = 2, a[2] = 10, a[3] = 12, a[4] = 14;
//     printf("%d\n", besthub(r, l, a, b));
//     return 0;
// }

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 456 KB Output is correct
2 Correct 13 ms 348 KB Output is correct
3 Execution timed out 1051 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1004 ms 936 KB Time limit exceeded
2 Halted 0 ms 0 KB -