oj.uz

Submission #885820

# Submission time Handle Problem Language Result Execution time Memory
885820 2023-12-10T19:29:12 Z VMaksimoski008 Rice Hub (IOI11_ricehub) C++14
68 / 100
 620 ms 600 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 <= 5000) {
        for(int pos=0; pos<R; pos++) {
            int res = 0;
            vector<int> dist(R);
            for(int i=0; i<R; i++)
                dist[i] = abs(v[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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 448 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 5 ms 440 KB Output is correct
28 Correct 4 ms 448 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 13 ms 348 KB Output is correct
4 Correct 13 ms 460 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 11 ms 348 KB Output is correct
12 Correct 11 ms 448 KB Output is correct
13 Correct 18 ms 348 KB Output is correct
14 Correct 18 ms 600 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 10 ms 464 KB Output is correct
18 Correct 10 ms 348 KB Output is correct
19 Correct 20 ms 348 KB Output is correct
20 Correct 17 ms 348 KB Output is correct
21 Correct 287 ms 480 KB Output is correct
22 Correct 267 ms 348 KB Output is correct
23 Correct 607 ms 496 KB Output is correct
24 Correct 620 ms 488 KB Output is correct
25 Correct 562 ms 496 KB Output is correct
26 Correct 582 ms 500 KB Output is correct
27 Correct 506 ms 496 KB Output is correct
28 Correct 497 ms 508 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -