oj.uz

Submission #444334

# Submission time Handle Problem Language Result Execution time Memory
444334 2021-07-13T16:18:11 Z parsabahrami The short shank; Redemption (BOI21_prison) C++17
70 / 100
 520 ms 6216 KB 
/* I do it for the glory */
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<double, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second
#define lc                          id << 1
#define rc                          lc | 1

const int N = 7.5e4 + 10, MOD = 1e9 + 7; const double eps = 1e-14;
int R[N], t[N], n, T, D; pii dp[N], seg[N << 2];

void bld(int id = 1, int l = 1, int r = n + 1) {
    seg[id] = {MOD, 0};
    if (r - l < 2) return;
    int md = (l + r) >> 1;
    bld(lc, l, md), bld(rc, md, r);
}

void upd(int p, double x, int y, int id = 1, int l = 1, int r = n + 1) {
    if (r - l < 2) { seg[id] = min(seg[id], {x, y}); return; }
    int md = (l + r) >> 1;
    p < md ? upd(p, x, y, lc, l, md) : upd(p, x, y, rc, md, r);
    seg[id] = min(seg[lc], seg[rc]);
}

pii get(int ql, int qr, int id = 1, int l = 1, int r = n + 1) {
    if (qr <= l || r <= ql) return {MOD, 0};
    if (ql <= l && r <= qr) { return seg[id]; }
    int md = (l + r) >> 1;
    return min(get(ql, qr, lc, l, md), get(ql, qr, rc, md, r));
}

pii get(double l) {
    bld(); fill(dp, dp + n + 2, pii(0.0, 0));
    if (t[n] <= T) dp[n] = {1.0, 0};
    else dp[n] = {0.0, 0};
    upd(n, dp[n].F + n, dp[n].S);
    for (int i = n - 1; i; i--) {
        if (R[i] < i) 
            if (l <= 0) dp[i] = {dp[i + 1].F + l, dp[i + 1].S + 1};
            else dp[i] = dp[i + 1];
        else {
            pii x = get(i + 1, R[i] + 2);
            dp[i] = {x.F + l - i, x.S + 1};
            dp[i] = min(dp[i], {dp[R[i] + 1].F + R[i] - i + 1, dp[R[i] + 1].S});
        }
        upd(i, dp[i].F + i, dp[i].S);
    }
    return dp[1];
}

int main() {
    scanf("%d%d%d", &n, &D, &T);
    assert(n <= N);
    for (int i = 1; i <= n; i++) 
        scanf("%d", &t[i]);
    for (int i = n; i; i--) {
        for (R[i] = i + 1; R[i] <= n && t[R[i]] - R[i] > t[i] - i; R[i] = R[R[i]]);
    }
    for (int i = n; i; i--) {
        if (R[i] <= min(n, i + T - t[i])) 
            R[i] = R[R[i]];
        else R[i] = min(n, i + T - t[i]);
        if (R[i] < i) R[i] = -1;
    }
    double l = -N, r = N;
    for (; r - l > 1; ) {
        double md = (l + r) / 2.0;
        if (get(md).S >= D) l = md;
        else r = md;
    }
    if (get(l).S == D) {
        int ret = get(l).F - l * D;
        printf("%d\n", ret);
    } else {
        pii A = get(l); int x = A.F - l * A.S;
        pii B = get(r); int y = B.F - r * B.S;
        printf("%d\n", y + (D - B.S) * (x - y) / (A.S - B.S));
    }
    return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf("%d%d%d", &n, &D, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
prison.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         scanf("%d", &t[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 19 ms 460 KB Output is correct
24 Correct 20 ms 540 KB Output is correct
25 Correct 19 ms 540 KB Output is correct
26 Correct 22 ms 536 KB Output is correct
27 Correct 18 ms 536 KB Output is correct
28 Correct 20 ms 460 KB Output is correct
29 Correct 18 ms 536 KB Output is correct
30 Correct 16 ms 540 KB Output is correct
31 Correct 16 ms 536 KB Output is correct
32 Correct 18 ms 540 KB Output is correct
33 Correct 18 ms 460 KB Output is correct
34 Correct 20 ms 460 KB Output is correct
35 Correct 19 ms 536 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 474 ms 6148 KB Output is correct
3 Correct 520 ms 6140 KB Output is correct
4 Correct 454 ms 6092 KB Output is correct
5 Correct 463 ms 6212 KB Output is correct
6 Correct 469 ms 6152 KB Output is correct
7 Correct 378 ms 6212 KB Output is correct
8 Correct 371 ms 6152 KB Output is correct
9 Correct 288 ms 6212 KB Output is correct
10 Correct 463 ms 6156 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 19 ms 460 KB Output is correct
24 Correct 20 ms 540 KB Output is correct
25 Correct 19 ms 540 KB Output is correct
26 Correct 22 ms 536 KB Output is correct
27 Correct 18 ms 536 KB Output is correct
28 Correct 20 ms 460 KB Output is correct
29 Correct 18 ms 536 KB Output is correct
30 Correct 16 ms 540 KB Output is correct
31 Correct 16 ms 536 KB Output is correct
32 Correct 18 ms 540 KB Output is correct
33 Correct 18 ms 460 KB Output is correct
34 Correct 20 ms 460 KB Output is correct
35 Correct 19 ms 536 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 474 ms 6148 KB Output is correct
38 Correct 520 ms 6140 KB Output is correct
39 Correct 454 ms 6092 KB Output is correct
40 Correct 463 ms 6212 KB Output is correct
41 Correct 469 ms 6152 KB Output is correct
42 Correct 378 ms 6212 KB Output is correct
43 Correct 371 ms 6152 KB Output is correct
44 Correct 288 ms 6212 KB Output is correct
45 Correct 463 ms 6156 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 332 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 18 ms 460 KB Output is correct
58 Correct 20 ms 460 KB Output is correct
59 Correct 18 ms 544 KB Output is correct
60 Correct 20 ms 544 KB Output is correct
61 Correct 18 ms 540 KB Output is correct
62 Correct 21 ms 460 KB Output is correct
63 Correct 19 ms 544 KB Output is correct
64 Correct 17 ms 540 KB Output is correct
65 Correct 16 ms 460 KB Output is correct
66 Correct 18 ms 460 KB Output is correct
67 Correct 18 ms 532 KB Output is correct
68 Correct 19 ms 540 KB Output is correct
69 Correct 19 ms 460 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 465 ms 6144 KB Output is correct
72 Correct 513 ms 6140 KB Output is correct
73 Correct 448 ms 6144 KB Output is correct
74 Correct 462 ms 6144 KB Output is correct
75 Correct 444 ms 6148 KB Output is correct
76 Correct 364 ms 6216 KB Output is correct
77 Correct 367 ms 6156 KB Output is correct
78 Correct 289 ms 6140 KB Output is correct
79 Correct 462 ms 6136 KB Output is correct
80 Correct 498 ms 6148 KB Output is correct
81 Correct 450 ms 6212 KB Output is correct
82 Correct 491 ms 6144 KB Output is correct
83 Correct 474 ms 6212 KB Output is correct
84 Correct 444 ms 6140 KB Output is correct
85 Correct 400 ms 6144 KB Output is correct
86 Correct 402 ms 6144 KB Output is correct
87 Correct 384 ms 6144 KB Output is correct
88 Correct 288 ms 6140 KB Output is correct
89 Correct 294 ms 6092 KB Output is correct
90 Correct 362 ms 6144 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Runtime error 1 ms 460 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -