oj.uz

답안 #885817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885817 2023-12-10T19:25:26 Z VMaksimoski008 쌀 창고 (IOI11_ricehub) C++14
42 / 100
 69 ms 604 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int besthub(int R, int L, int v[], ll B) {
    int ans = 0;

    if(R <= 500) {
        for(int pos=1; pos<=L; pos++) {
            int res = 0;
            vector<int> dist(R);
            for(int i=0; i<R; i++)
                dist[i] = abs(pos - v[i]);
            sort(all(dist));
            ll x = B;
            for(int i=0; i<R; i++) {
                if(x >= dist[i]) {
                    res++;
                    x -= dist[i];
                } else break;
            }
            ans = max(ans, res);
        }
    }

    return ans;
}

// int32_t main() {
//     setIO();

//     int R, L;
//     ll B;
//     cin >> R >> L >> B;

//     int v[R];
//     for(int i=0; i<R; i++) cin >> v[i];

//     cout << besthub(R, L, v, B) << '\n';
//     return 0;
// }

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 2 ms 444 KB Output is correct
16 Correct 2 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 2 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 452 KB Output is correct
23 Correct 68 ms 424 KB Output is correct
24 Correct 68 ms 424 KB Output is correct
25 Correct 69 ms 420 KB Output is correct
26 Correct 67 ms 424 KB Output is correct
27 Correct 59 ms 592 KB Output is correct
28 Correct 55 ms 344 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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