oj.uz

Submission #706952

# Submission time Handle Problem Language Result Execution time Memory
706952 2023-03-08T07:13:24 Z Nhoksocqt1 Rice Hub (IOI11_ricehub) C++17
100 / 100
 14 ms 2884 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;

ll sum[MAXN], budget;
int dis[MAXN], numField, maxCoord;

ll calcMin(int n) {
    ll res(1e18);
    for (int i = 1; i + n - 1 <= numField; ++i) {
        int j(i + n - 1), mid = (i + j) >> 1;
        ll minNow = 1LL * (mid - i + 1) * dis[mid] - sum[mid] + sum[i - 1];
        minNow += sum[j] - sum[mid] - 1LL * (j - mid) * dis[mid];

        res = min(res, minNow);
    }

    return res;
}

int besthub(int _R, int _L, int _X[], ll _B) {
    numField = _R, maxCoord = _L, budget = _B;
    for (int i = 1; i <= numField; ++i) {
        dis[i] = _X[i - 1];
        sum[i] = sum[i - 1] + dis[i];
    }

    int l(1), r(numField), answer(0);
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(calcMin(mid) <= budget) {
            answer = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }

    return answer;
}

Compilation message

ricehub.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
ricehub.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 260 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 13 ms 2868 KB Output is correct
4 Correct 11 ms 2832 KB Output is correct
5 Correct 7 ms 1336 KB Output is correct
6 Correct 6 ms 1440 KB Output is correct
7 Correct 11 ms 2644 KB Output is correct
8 Correct 10 ms 2644 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 6 ms 1388 KB Output is correct
11 Correct 14 ms 2884 KB Output is correct
12 Correct 11 ms 2844 KB Output is correct
13 Correct 8 ms 1492 KB Output is correct
14 Correct 7 ms 1480 KB Output is correct
15 Correct 9 ms 2232 KB Output is correct
16 Correct 9 ms 2216 KB Output is correct
17 Correct 10 ms 2644 KB Output is correct
18 Correct 10 ms 2572 KB Output is correct
19 Correct 11 ms 2764 KB Output is correct
20 Correct 11 ms 2772 KB Output is correct