oj.uz

Submission #877419

# Submission time Handle Problem Language Result Execution time Memory
877419 2023-11-23T08:25:54 Z aykhn Overtaking (IOI23_overtaking) C++17
100 / 100
 2073 ms 139508 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
 
#define pb push_back
#define ins insert
#define fi first
#define se second
#define mpr make_pair
#define mxn (ll)(1e3 + 5)
 
ll n, m, l, x;
vector<ll> w, t, s;
vector<pii> v[mxn];
vector<pii> ran[mxn];
vector<ll> pref[mxn];
set<pair<pii, ll>> st;
 
ll get(ll pos)
{
    return (*--st.upper_bound(mpr(mpr(pos, (ll)(2e18)), 0))).se;
}
 
void make(ll l, ll r, ll val)
{
    // cout << l << ' ' << r << ' ' << val << '\n';
    auto it = --st.lower_bound(mpr(mpr(l, -(ll)(2e18)), -(ll)(2e18)));
    pii tmp = (*it).fi;
    ll vv = (*it).se;
    if (tmp.se >= l)
    {
        st.erase(it);
        ll l1 = tmp.fi;
        ll r1 = l - 1;
        if (l1 <= r1) st.ins({{l1, r1}, vv});
      	if (l <= tmp.se) st.ins({{l, tmp.se}, vv});
    }
    it = --st.upper_bound(mpr(mpr(r, (ll)(2e18)), (ll)(2e18)));
    tmp = (*it).fi;
    vv = (*it).se;
    if (tmp.se > r)
    {
        st.erase(it);
        ll l1 = r + 1;
        ll r1 = tmp.se;
        if (l1 <= r1) st.ins({{l1, r1}, vv});
      	if (tmp.fi <= r) st.ins({{tmp.fi, r}, vv});
    }
    auto it1 = st.lower_bound(mpr(mpr(l, -(ll)(2e18)), -(ll)(2e18)));
    auto it2 = st.upper_bound(mpr(mpr(r, (ll)(2e18)), (ll)(2e18)));
    st.erase(it1, it2);
    st.ins({{l, r}, val});
    // for (pair<pii, ll> asd : st) cout << asd.fi.fi << ' ' << asd.fi.se << ' ' << asd.se << " | ";
    // cout << '\n';
}
 
void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S)
{
    n = N, m = M, l = L, x = X;
    for (ll x : W)  w.pb(x); for (ll x : T)  t.pb(x); for (ll x : S)  s.pb(x);
    for (ll i = 0; i < n; i++) v[0].pb({t[i], w[i]});
    for (ll i = 0; i + 1 < m; i++)
    {
        sort(v[i].begin(), v[i].end(), [&](const pii &a, const pii &b)
        {
            if (a.fi == b.fi) return a.se < b.se;
            return a.fi < b.fi;
        });
        for (ll j = 0; j < v[i].size(); j++)
        {
            if (!j || pref[i][j - 1] <= v[i][j].fi + (s[i + 1] - s[i]) * v[i][j].se)
            {
                v[i + 1].pb({v[i][j].fi + (s[i + 1] - s[i]) * v[i][j].se, v[i][j].se});
                ran[i].pb({v[i][j].fi, v[i][j].fi + (s[i + 1] - s[i]) * v[i][j].se});
                pref[i].pb(v[i][j].fi + (s[i + 1] - s[i]) * v[i][j].se);
                continue;
            }
            v[i + 1].pb({pref[i][j - 1], v[i][j].se});
            pref[i].pb(pref[i][j - 1]);
        }
    }
    st.ins({{0, (ll)(2e18)}, -1});
    for (ll i = m - 2; i >= 0; i--)
    {
        vector<pair<pii, ll>> late;
        for (ll j = 0; j < ran[i].size(); j++)
        {
            ll a = ran[i][j].fi;
            ll c = ran[i][j].se;
            ll b = (j + 1 < ran[i].size() ? ran[i][j + 1].fi : (ll)(2e18));
            ll lb = a + 1 + (s[m - 1] - s[i]) * x;
            ll ub = min(c - (s[i + 1] - s[i]) * x, b) + (s[m - 1] - s[i]) * x;
            if (lb > ub) continue;
            ll upd = get(c + (s[m - 1] - s[i + 1]) * x);
            if (upd == -1) upd = c + (s[m - 1] - s[i + 1]) * x;
            late.pb({{lb, ub}, upd});
        }
        for (const pair<pii, ll> &p : late)
        {
            make(p.fi.fi, p.fi.se, p.se);
        }
    }
    // for (pair<pii, ll> x : st) cout << x.fi.fi << ' ' << x.fi.se << ' ' << x.se <<  " | ";
    // cout << '\n';
}
 
ll arrival_time(ll Y)
{
    Y += l * x;
    ll cur = get(Y);
    return (cur == -1 ? Y : cur);
}

Compilation message

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:63:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   63 |     for (ll x : W)  w.pb(x); for (ll x : T)  t.pb(x); for (ll x : S)  s.pb(x);
      |     ^~~
overtaking.cpp:63:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   63 |     for (ll x : W)  w.pb(x); for (ll x : T)  t.pb(x); for (ll x : S)  s.pb(x);
      |                              ^~~
overtaking.cpp:72:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for (ll j = 0; j < v[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~
overtaking.cpp:89:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for (ll j = 0; j < ran[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~~~
overtaking.cpp:93:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |             ll b = (j + 1 < ran[i].size() ? ran[i][j + 1].fi : (ll)(2e18));
      |                     ~~~~~~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 856 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 8 ms 1372 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 8 ms 1372 KB Output is correct
12 Correct 8 ms 1152 KB Output is correct
13 Correct 8 ms 1372 KB Output is correct
14 Correct 8 ms 1372 KB Output is correct
15 Correct 7 ms 1068 KB Output is correct
16 Correct 7 ms 860 KB Output is correct
17 Correct 7 ms 1112 KB Output is correct
18 Correct 7 ms 1116 KB Output is correct
19 Correct 7 ms 1116 KB Output is correct
20 Correct 7 ms 1116 KB Output is correct
21 Correct 3 ms 776 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 5 ms 860 KB Output is correct
27 Correct 5 ms 1028 KB Output is correct
28 Correct 4 ms 824 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 600 KB Output is correct
31 Correct 4 ms 764 KB Output is correct
32 Correct 7 ms 1628 KB Output is correct
33 Correct 7 ms 1472 KB Output is correct
34 Correct 7 ms 1628 KB Output is correct
35 Correct 7 ms 1628 KB Output is correct
36 Correct 8 ms 1640 KB Output is correct
37 Correct 7 ms 1564 KB Output is correct
38 Correct 1 ms 856 KB Output is correct
39 Correct 1 ms 860 KB Output is correct
40 Correct 6 ms 1276 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 508 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 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 8 ms 1372 KB Output is correct
17 Correct 8 ms 1372 KB Output is correct
18 Correct 8 ms 1372 KB Output is correct
19 Correct 8 ms 1152 KB Output is correct
20 Correct 8 ms 1372 KB Output is correct
21 Correct 8 ms 1372 KB Output is correct
22 Correct 7 ms 1068 KB Output is correct
23 Correct 7 ms 860 KB Output is correct
24 Correct 7 ms 1112 KB Output is correct
25 Correct 7 ms 1116 KB Output is correct
26 Correct 7 ms 1116 KB Output is correct
27 Correct 7 ms 1116 KB Output is correct
28 Correct 3 ms 776 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 4 ms 860 KB Output is correct
31 Correct 5 ms 860 KB Output is correct
32 Correct 5 ms 860 KB Output is correct
33 Correct 5 ms 860 KB Output is correct
34 Correct 5 ms 1028 KB Output is correct
35 Correct 4 ms 824 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 4 ms 600 KB Output is correct
38 Correct 4 ms 764 KB Output is correct
39 Correct 7 ms 1628 KB Output is correct
40 Correct 7 ms 1472 KB Output is correct
41 Correct 7 ms 1628 KB Output is correct
42 Correct 7 ms 1628 KB Output is correct
43 Correct 8 ms 1640 KB Output is correct
44 Correct 7 ms 1564 KB Output is correct
45 Correct 1 ms 856 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 6 ms 1276 KB Output is correct
48 Correct 744 ms 41532 KB Output is correct
49 Correct 803 ms 42580 KB Output is correct
50 Correct 872 ms 42856 KB Output is correct
51 Correct 809 ms 42576 KB Output is correct
52 Correct 798 ms 42640 KB Output is correct
53 Correct 808 ms 42584 KB Output is correct
54 Correct 792 ms 42608 KB Output is correct
55 Correct 365 ms 40012 KB Output is correct
56 Correct 697 ms 41584 KB Output is correct
57 Correct 671 ms 41596 KB Output is correct
58 Correct 704 ms 41768 KB Output is correct
59 Correct 708 ms 41720 KB Output is correct
60 Correct 695 ms 41676 KB Output is correct
61 Correct 714 ms 41664 KB Output is correct
62 Correct 2 ms 856 KB Output is correct
63 Correct 2 ms 860 KB Output is correct
64 Correct 304 ms 20832 KB Output is correct
65 Correct 285 ms 20892 KB Output is correct
66 Correct 390 ms 40968 KB Output is correct
67 Correct 568 ms 41336 KB Output is correct
68 Correct 603 ms 41008 KB Output is correct
69 Correct 914 ms 103656 KB Output is correct
70 Correct 913 ms 103268 KB Output is correct
71 Correct 939 ms 103760 KB Output is correct
72 Correct 1145 ms 93312 KB Output is correct
73 Correct 930 ms 103448 KB Output is correct
74 Correct 910 ms 103268 KB Output is correct
75 Correct 49 ms 40784 KB Output is correct
76 Correct 49 ms 40620 KB Output is correct
77 Correct 49 ms 40708 KB Output is correct
78 Correct 690 ms 72092 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 508 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 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 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 520 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 8 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 8 ms 1372 KB Output is correct
30 Correct 8 ms 1152 KB Output is correct
31 Correct 8 ms 1372 KB Output is correct
32 Correct 8 ms 1372 KB Output is correct
33 Correct 7 ms 1068 KB Output is correct
34 Correct 7 ms 860 KB Output is correct
35 Correct 7 ms 1112 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 7 ms 1116 KB Output is correct
38 Correct 7 ms 1116 KB Output is correct
39 Correct 3 ms 776 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 5 ms 860 KB Output is correct
43 Correct 5 ms 860 KB Output is correct
44 Correct 5 ms 860 KB Output is correct
45 Correct 5 ms 1028 KB Output is correct
46 Correct 4 ms 824 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 4 ms 600 KB Output is correct
49 Correct 4 ms 764 KB Output is correct
50 Correct 7 ms 1628 KB Output is correct
51 Correct 7 ms 1472 KB Output is correct
52 Correct 7 ms 1628 KB Output is correct
53 Correct 7 ms 1628 KB Output is correct
54 Correct 8 ms 1640 KB Output is correct
55 Correct 7 ms 1564 KB Output is correct
56 Correct 1 ms 856 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 6 ms 1276 KB Output is correct
59 Correct 744 ms 41532 KB Output is correct
60 Correct 803 ms 42580 KB Output is correct
61 Correct 872 ms 42856 KB Output is correct
62 Correct 809 ms 42576 KB Output is correct
63 Correct 798 ms 42640 KB Output is correct
64 Correct 808 ms 42584 KB Output is correct
65 Correct 792 ms 42608 KB Output is correct
66 Correct 365 ms 40012 KB Output is correct
67 Correct 697 ms 41584 KB Output is correct
68 Correct 671 ms 41596 KB Output is correct
69 Correct 704 ms 41768 KB Output is correct
70 Correct 708 ms 41720 KB Output is correct
71 Correct 695 ms 41676 KB Output is correct
72 Correct 714 ms 41664 KB Output is correct
73 Correct 2 ms 856 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 304 ms 20832 KB Output is correct
76 Correct 285 ms 20892 KB Output is correct
77 Correct 390 ms 40968 KB Output is correct
78 Correct 568 ms 41336 KB Output is correct
79 Correct 603 ms 41008 KB Output is correct
80 Correct 914 ms 103656 KB Output is correct
81 Correct 913 ms 103268 KB Output is correct
82 Correct 939 ms 103760 KB Output is correct
83 Correct 1145 ms 93312 KB Output is correct
84 Correct 930 ms 103448 KB Output is correct
85 Correct 910 ms 103268 KB Output is correct
86 Correct 49 ms 40784 KB Output is correct
87 Correct 49 ms 40620 KB Output is correct
88 Correct 49 ms 40708 KB Output is correct
89 Correct 690 ms 72092 KB Output is correct
90 Correct 754 ms 44672 KB Output is correct
91 Correct 1060 ms 77536 KB Output is correct
92 Correct 1122 ms 77312 KB Output is correct
93 Correct 1038 ms 77760 KB Output is correct
94 Correct 1060 ms 77128 KB Output is correct
95 Correct 1051 ms 77444 KB Output is correct
96 Correct 1036 ms 77668 KB Output is correct
97 Correct 403 ms 43140 KB Output is correct
98 Correct 944 ms 76160 KB Output is correct
99 Correct 921 ms 77056 KB Output is correct
100 Correct 956 ms 76452 KB Output is correct
101 Correct 961 ms 76148 KB Output is correct
102 Correct 946 ms 76112 KB Output is correct
103 Correct 965 ms 76476 KB Output is correct
104 Correct 517 ms 53764 KB Output is correct
105 Correct 541 ms 58244 KB Output is correct
106 Correct 728 ms 83768 KB Output is correct
107 Correct 721 ms 83540 KB Output is correct
108 Correct 820 ms 83600 KB Output is correct
109 Correct 728 ms 83452 KB Output is correct
110 Correct 821 ms 83684 KB Output is correct
111 Correct 1342 ms 139044 KB Output is correct
112 Correct 1346 ms 138372 KB Output is correct
113 Correct 1556 ms 139508 KB Output is correct
114 Correct 2008 ms 110696 KB Output is correct
115 Correct 1523 ms 138756 KB Output is correct
116 Correct 1366 ms 139452 KB Output is correct
117 Correct 230 ms 79488 KB Output is correct
118 Correct 228 ms 79492 KB Output is correct
119 Correct 221 ms 77592 KB Output is correct
120 Correct 233 ms 79640 KB Output is correct
121 Correct 231 ms 80748 KB Output is correct
122 Correct 1132 ms 101140 KB Output is correct
123 Correct 2073 ms 110776 KB Output is correct
124 Correct 2005 ms 102980 KB Output is correct
125 Correct 1935 ms 100256 KB Output is correct