oj.uz

Submission #405789

# Submission time Handle Problem Language Result Execution time Memory
405789 2021-05-16T22:40:58 Z 534351 The short shank; Redemption (BOI21_prison) C++17
35 / 100
 2000 ms 13672 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()

const int MAXN = 2000013;
const long long LLINF = 3e18;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, D, T;
int arr[MAXN], lt[MAXN];
int fen[MAXN];
ll dp[MAXN];
int cost[MAXN], taken[MAXN];
int ans;

void update(int idx, int v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        ckmax(fen[e], v);
    }
}
int query(int idx)
{
    int res = -1;
    for (int e = idx + 1; e; e -= e & (-e))
    {
        ckmax(res, fen[e]);
    }
    return res;
}
void check(int c)
{
    // cerr << "CHECKING " << c << endl;
    //assign a penalty of c for starting a new range at c.
    //minimum # of guys rebelling.
    dp[0] = 0; taken[0] = 0;
    fill(cost, cost + N + 1, 0);
    FOR(i, 0, N)
    {
        dp[i + 1] = LLINF;
        int v = lt[i];
        FOR(j, 0, v + 1)
        {
            cost[j]++;
        }
        FOR(j, 0, i + 1)
        {
            if (dp[i + 1] > dp[j] + cost[j] + c)
            {
                dp[i + 1] = dp[j] + cost[j] + c;
                taken[i + 1] = taken[j] + 1;
            }
        }
        // cerr << dp[i + 1] << ' ' << taken[i + 1] << endl;
    }
    // cerr << "DP " << dp[N] << " TAKEN " << c << endl;
    return;
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    cin >> N >> D >> T; D++;
    FOR(i, 0, N)
    {
        cin >> arr[i];
    }
    fill(fen, fen + N + 1, -1);
    FOR(i, 0, N)
    {
        int c = arr[i];
        if (c <= T)
        {
            //i...i+(T-c) are getting infected.
            update(max(0, N - 1 - (i + (T - c))), i);
        }
        lt[i] = query(N - 1 - i);
        // cerr << lt[i] << ' ';
    }
    int lo = 0, hi = N + 1;
    while(hi > lo)
    {
        int mid = (hi + lo + 1) >> 1;
        check(mid);
        if (taken[N] >= D) lo = mid;
        else hi = mid - 1;
    }
    // cerr << "LO = " << lo << endl;
    check(lo);
    // cerr << "TAKED " << taken[N] << endl;
    ll cost1 = dp[N] - lo * taken[N]; int cnt1 = taken[N];
    assert(cnt1 >= D);
    if (cnt1 == D)
    {
        ans = cost1;
    }
    else
    {
        hi++;
        check(hi);
        ll cost2 = dp[N] - hi * taken[N]; int cnt2 = taken[N];
        assert(cnt2 < D);
        // cerr << cost1 << ' ' << cnt1 << ' ' << cost2 << ' ' << cnt2 << endl;
        ans = cost2 + (cost1 - cost2) * (D - cnt2) / (cnt1 - cnt2);
    }
    cout << ans << '\n';
    //you are going to have some new blocks starting with -1....x. and then -1...x and then -1...x
    // cerr << endl;
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 2079 ms 13672 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 194 ms 496 KB Output is correct
24 Correct 200 ms 580 KB Output is correct
25 Correct 218 ms 612 KB Output is correct
26 Correct 212 ms 484 KB Output is correct
27 Correct 220 ms 484 KB Output is correct
28 Correct 184 ms 484 KB Output is correct
29 Correct 186 ms 492 KB Output is correct
30 Correct 166 ms 488 KB Output is correct
31 Correct 181 ms 580 KB Output is correct
32 Correct 150 ms 488 KB Output is correct
33 Correct 158 ms 580 KB Output is correct
34 Correct 189 ms 460 KB Output is correct
35 Correct 205 ms 468 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Execution timed out 2078 ms 3016 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 194 ms 496 KB Output is correct
24 Correct 200 ms 580 KB Output is correct
25 Correct 218 ms 612 KB Output is correct
26 Correct 212 ms 484 KB Output is correct
27 Correct 220 ms 484 KB Output is correct
28 Correct 184 ms 484 KB Output is correct
29 Correct 186 ms 492 KB Output is correct
30 Correct 166 ms 488 KB Output is correct
31 Correct 181 ms 580 KB Output is correct
32 Correct 150 ms 488 KB Output is correct
33 Correct 158 ms 580 KB Output is correct
34 Correct 189 ms 460 KB Output is correct
35 Correct 205 ms 468 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Execution timed out 2078 ms 3016 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 324 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Execution timed out 2079 ms 13672 KB Time limit exceeded
14 Halted 0 ms 0 KB -