oj.uz

Submission #1078240

# Submission time Handle Problem Language Result Execution time Memory
1078240 2024-08-27T14:27:09 Z c2zi6 Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 34964 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "overtaking.h"

struct SEGTREE {
    int n;
    VL tree;
    SEGTREE(){}
    SEGTREE(int sz) {
        n = 1;
        while (n < sz) n *= 2;
        tree = VL(2*n);
    }
    void upd(int N, int L, int R, int i, ll s) {
        if (i < L || i > R) return;
        if (L == R) {
            tree[N] = s;
            return;
        }
        int M = (L + R) / 2;
        upd(2*N+1, L, M, i, s);
        upd(2*N+2, M+1, R, i, s);
        tree[N] = max(tree[2*N+1], tree[2*N+2]);
    }
    ll get(int N, int L, int R, int l, int r) {
        if (R < l || L > r) return 0;
        if (l <= L && R <= r) return tree[N];
        int M = (L + R) / 2;
        return max(get(2*N+1, L, M, l, r), get(2*N+2, M+1, R, l, r));
    }
    void upd(int i, ll s) {
        upd(0, 0, n-1, i, s);
    }
    ll get(int l, int r) {
        return get(0, 0, n-1, l, r);
    }
};

int n;
VI W, S;
VL T;
int m;

ll expected(int i, int j) {
    /* 
     * i-rd avtobusin inchqan jamanak e petq
     * (j-1)-rd stanciaic j-rd stancia hasnelu hamar
     */
    return 1ll * W[i] * (S[j] - S[j-1]);
}

typedef vector<tuple<ll, ll, int>> VLLI;

VLLI a;

VL step(VL t, int j) {
    int n = t.size();
    /*
     * t[i]-n i-rd avtobusi (j-1)-rd stancia
     * hasnelu jamanakn e, petq everadardznel ret,
     * urdex ret[i]-n i-rd avtobusi j-rd stancia
     * hasnelu jamanakn e
     */
    VL e(n);
    rep(i, n) e[i] = t[i] + expected(i, j);
    a = VLLI(n);
    rep(i, n) a[i] = {t[i], e[i], i};
    sort(all(a));
    ll maxexp = 0;
    VL ret(n);
    for (auto[t, e, i] : a) {
        setmax(maxexp, e);
        ret[i] = maxexp;
    }
    return ret;
}

struct BESTCHOICE {
    int n;
    VL times, values;
    SEGTREE seg;
    BESTCHOICE(){}
    BESTCHOICE(VLLI a) {
        n = a.size();
        times = values = VL();
        for (auto[t, e, i] : a) {
            times.pb(t);
            values.pb(e);
        }
        seg = SEGTREE(n);
        rep(i, n) seg.upd(i, values[i]);
    }
    ll operator()(ll x) {
        int ind = lower_bound(all(times), x) - times.begin() - 1;
        return seg.get(0, ind);
    }
    void print() {
        for (ll x : times) cout << x << " ";
        cout << endl;
        for (ll x : values) cout << x << " ";
        cout << endl;
    }
};

vector<BESTCHOICE> best;

void init(int L, int N_ARG, VL T_ARG, VI W_ARG, int X, int M, VI S_ARG) {
    n = N_ARG;
    W = W_ARG;
    W.pb(X);
    m = M;
    S = S_ARG;
    T = T_ARG;

    VL cur = T;
    replr(i, 1, m-1) {
        cur = step(cur, i);
        best.pb(BESTCHOICE(a));
    }
}

ll arrival_time(ll Y) {
    replr(i, 1, m-1) {
        auto& p = best[i-1];

        /*cout << "Kancinq hetevyal bani mijov" << endl;*/
        /*p.print();*/
        /*cout << "Expected@ " << Y + expected(n, i) << endl;*/

        Y = max(Y + expected(n, i), p(Y));

        /*cout << "Y dardzav " << Y << endl;*/
        /*cout << endl;*/
    }
    return Y;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 3 ms 448 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 668 KB Output is correct
11 Correct 4 ms 664 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 476 KB Output is correct
10 Correct 1 ms 580 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 444 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 344 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
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 3 ms 688 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 688 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 1 ms 860 KB Output is correct
40 Correct 1 ms 860 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 344 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
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 444 KB Output is correct
8 Correct 3 ms 448 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 668 KB Output is correct
12 Correct 4 ms 664 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 3 ms 688 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 860 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 856 KB Output is correct
44 Correct 1 ms 688 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 1 ms 860 KB Output is correct
48 Correct 161 ms 32796 KB Output is correct
49 Correct 402 ms 32852 KB Output is correct
50 Correct 459 ms 32940 KB Output is correct
51 Correct 398 ms 32868 KB Output is correct
52 Correct 427 ms 32780 KB Output is correct
53 Correct 408 ms 32852 KB Output is correct
54 Correct 426 ms 32916 KB Output is correct
55 Correct 132 ms 32592 KB Output is correct
56 Correct 408 ms 32720 KB Output is correct
57 Correct 400 ms 32736 KB Output is correct
58 Correct 406 ms 32852 KB Output is correct
59 Correct 380 ms 32908 KB Output is correct
60 Correct 423 ms 32812 KB Output is correct
61 Correct 388 ms 33108 KB Output is correct
62 Correct 15 ms 856 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 298 ms 16816 KB Output is correct
65 Correct 253 ms 17680 KB Output is correct
66 Correct 491 ms 32916 KB Output is correct
67 Correct 519 ms 33104 KB Output is correct
68 Correct 537 ms 32852 KB Output is correct
69 Correct 545 ms 32908 KB Output is correct
70 Correct 481 ms 32948 KB Output is correct
71 Correct 569 ms 32848 KB Output is correct
72 Correct 547 ms 32848 KB Output is correct
73 Correct 669 ms 32908 KB Output is correct
74 Correct 630 ms 32848 KB Output is correct
75 Correct 592 ms 32916 KB Output is correct
76 Correct 595 ms 32920 KB Output is correct
77 Correct 778 ms 32916 KB Output is correct
78 Correct 413 ms 32876 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 344 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
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 444 KB Output is correct
8 Correct 3 ms 448 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 668 KB Output is correct
12 Correct 4 ms 664 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 1 ms 580 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 3 ms 688 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 860 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 860 KB Output is correct
52 Correct 1 ms 860 KB Output is correct
53 Correct 1 ms 860 KB Output is correct
54 Correct 1 ms 856 KB Output is correct
55 Correct 1 ms 688 KB Output is correct
56 Correct 1 ms 860 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 1 ms 860 KB Output is correct
59 Correct 161 ms 32796 KB Output is correct
60 Correct 402 ms 32852 KB Output is correct
61 Correct 459 ms 32940 KB Output is correct
62 Correct 398 ms 32868 KB Output is correct
63 Correct 427 ms 32780 KB Output is correct
64 Correct 408 ms 32852 KB Output is correct
65 Correct 426 ms 32916 KB Output is correct
66 Correct 132 ms 32592 KB Output is correct
67 Correct 408 ms 32720 KB Output is correct
68 Correct 400 ms 32736 KB Output is correct
69 Correct 406 ms 32852 KB Output is correct
70 Correct 380 ms 32908 KB Output is correct
71 Correct 423 ms 32812 KB Output is correct
72 Correct 388 ms 33108 KB Output is correct
73 Correct 15 ms 856 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 298 ms 16816 KB Output is correct
76 Correct 253 ms 17680 KB Output is correct
77 Correct 491 ms 32916 KB Output is correct
78 Correct 519 ms 33104 KB Output is correct
79 Correct 537 ms 32852 KB Output is correct
80 Correct 545 ms 32908 KB Output is correct
81 Correct 481 ms 32948 KB Output is correct
82 Correct 569 ms 32848 KB Output is correct
83 Correct 547 ms 32848 KB Output is correct
84 Correct 669 ms 32908 KB Output is correct
85 Correct 630 ms 32848 KB Output is correct
86 Correct 592 ms 32916 KB Output is correct
87 Correct 595 ms 32920 KB Output is correct
88 Correct 778 ms 32916 KB Output is correct
89 Correct 413 ms 32876 KB Output is correct
90 Execution timed out 3557 ms 34964 KB Time limit exceeded
91 Halted 0 ms 0 KB -