oj.uz

Submission #954150

# Submission time Handle Problem Language Result Execution time Memory
954150 2024-03-27T10:44:06 Z Trisanu_Das Overtaking (IOI23_overtaking) C++17
100 / 100
 2630 ms 158840 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())
 
ll n, m, x;
ll LL;
ll w[2010];
ll S[2010][2010];
ll spd[2010];
ll siz;
vector<pll> qry;
vector<ll> zip;
ll won[8000010];
 
struct lazysegtree
{
	ll lazy[8000010];
	ll seg[8000010];
	
	void prop(ll no, ll s, ll e)
	{
		if(!lazy[no])
			return;
		
		seg[no] = max(seg[no], lazy[no]);
		
		if(s != e)
		{
			lazy[no << 1] = max(lazy[no << 1], lazy[no]);
			lazy[no << 1 | 1] = max(lazy[no << 1 | 1], lazy[no]);
		}
		
		lazy[no] = 0;
	}
	
	void update(ll no, ll s, ll e, ll l, ll r, ll v)
	{
		prop(no, s, e);
		
		if(e < l || r < s)
			return;
		
		if(l <= s && e <= r)
		{
			seg[no] = max(seg[no], v);
			
			if(s != e)
			{
				lazy[no << 1] = max(lazy[no << 1], v);
				lazy[no << 1 | 1] = max(lazy[no << 1 | 1], v);
			}
			
			return;
		}
		
		update(no << 1, s, (s + e) >> 1, l, r, v);
		update(no << 1 | 1, ((s + e) >> 1) + 1, e, l, r, v);
		
		seg[no] = max(seg[no << 1], seg[no << 1 | 1]);
	}
	
	ll query(ll no, ll s, ll e, ll l, ll r)
	{
		prop(no, s, e);
		
		if(e < l || r < s)
			return -INF;
		
		if(l <= s && e <= r)
			return seg[no];
		
		return max(query(no << 1, s, (s + e) >> 1, l, r), query(no << 1 | 1, ((s + e) >> 1) + 1, e, l, r));
	}
}segt;
 
ll num(ll X)
{
	return lower_bound(zip.begin(), zip.end(), X) - zip.begin() + 1;
}
 
void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> SS)
{
	x = X, LL = L;
	
	for(ll i = 0 ; i < N ; i++)
	{
		if(W[i] <= X)
			continue;
		
		spd[++n] = W[i] - X;
		S[1][n] = T[i];
	}
	
	for(ll i = 0 ; i < M ; i++)
		w[++m] = SS[i];
	
	for(ll i = 1 ; i < m ; i++)
	{
		vector< pair<pll, ll> > vv;
		
		for(ll j = 1 ; j <= n ; j++)
			vv.push_back({{S[i][j], spd[j]}, j});
		
		sort(vv.begin(), vv.end());
		
		ll maxx = 0;
		ll dist = w[i + 1] - w[i];
		
		for(auto &j : vv)
		{
			S[i + 1][j.se] = max(S[i][j.se] + dist * spd[j.se], maxx);
			maxx = max(maxx, S[i + 1][j.se]);
		}
	}
	
	for(ll i = 1 ; i < m ; i++)
	{
		vector<pll> vv;
		
		for(ll j = 1 ; j <= n ; j++)
			vv.push_back({S[i][j], S[i + 1][j]});
		
		sort(vv.begin(), vv.end());
		reverse(vv.begin(), vv.end());
		
		for(ll j = 0 ; j < n ; j++)
			qry.push_back(vv[j]);
	}
	
	for(auto &i : qry)
	{
		zip.push_back(i.fi + 1);
		zip.push_back(i.se);
	}
	
	zip.push_back(0);
	compress(zip);
	
	siz = (ll)zip.size();
	
	for(auto &i : zip)
		segt.update(1, 1, siz, num(i), num(i), i);
	
	for(ll i = (ll)qry.size() - 1 ; i >= 0 ; i--)
	{
		ll gap = segt.query(1, 1, siz, num(qry[i].se), num(qry[i].se));
		segt.update(1, 1, siz, num(qry[i].fi + 1), num(qry[i].se), gap);
	}
}
 
ll arrival_time(ll Y)
{
	ll idx = upper_bound(zip.begin(), zip.end(), Y) - zip.begin();
	ll gap = segt.query(1, 1, siz, idx, idx);
	
	if(gap == zip[idx - 1])
		return Y + x * LL;
	
	return gap + x * LL;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 3 ms 15192 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2632 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 12 ms 5972 KB Output is correct
10 Correct 11 ms 5976 KB Output is correct
11 Correct 11 ms 5972 KB Output is correct
12 Correct 11 ms 5976 KB Output is correct
13 Correct 11 ms 5972 KB Output is correct
14 Correct 12 ms 5976 KB Output is correct
15 Correct 12 ms 5976 KB Output is correct
16 Correct 11 ms 5964 KB Output is correct
17 Correct 12 ms 5976 KB Output is correct
18 Correct 11 ms 5976 KB Output is correct
19 Correct 12 ms 5976 KB Output is correct
20 Correct 12 ms 5976 KB Output is correct
21 Correct 6 ms 5212 KB Output is correct
22 Correct 6 ms 3164 KB Output is correct
23 Correct 4 ms 4956 KB Output is correct
24 Correct 11 ms 5468 KB Output is correct
25 Correct 10 ms 5212 KB Output is correct
26 Correct 9 ms 5468 KB Output is correct
27 Correct 10 ms 5468 KB Output is correct
28 Correct 7 ms 3164 KB Output is correct
29 Correct 7 ms 3164 KB Output is correct
30 Correct 7 ms 3164 KB Output is correct
31 Correct 7 ms 3164 KB Output is correct
32 Correct 10 ms 5044 KB Output is correct
33 Correct 10 ms 5684 KB Output is correct
34 Correct 11 ms 5720 KB Output is correct
35 Correct 11 ms 5720 KB Output is correct
36 Correct 11 ms 5716 KB Output is correct
37 Correct 12 ms 6232 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 7 ms 5204 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 3 ms 15192 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 12 ms 5972 KB Output is correct
17 Correct 11 ms 5976 KB Output is correct
18 Correct 11 ms 5972 KB Output is correct
19 Correct 11 ms 5976 KB Output is correct
20 Correct 11 ms 5972 KB Output is correct
21 Correct 12 ms 5976 KB Output is correct
22 Correct 12 ms 5976 KB Output is correct
23 Correct 11 ms 5964 KB Output is correct
24 Correct 12 ms 5976 KB Output is correct
25 Correct 11 ms 5976 KB Output is correct
26 Correct 12 ms 5976 KB Output is correct
27 Correct 12 ms 5976 KB Output is correct
28 Correct 6 ms 5212 KB Output is correct
29 Correct 6 ms 3164 KB Output is correct
30 Correct 4 ms 4956 KB Output is correct
31 Correct 11 ms 5468 KB Output is correct
32 Correct 10 ms 5212 KB Output is correct
33 Correct 9 ms 5468 KB Output is correct
34 Correct 10 ms 5468 KB Output is correct
35 Correct 7 ms 3164 KB Output is correct
36 Correct 7 ms 3164 KB Output is correct
37 Correct 7 ms 3164 KB Output is correct
38 Correct 7 ms 3164 KB Output is correct
39 Correct 10 ms 5044 KB Output is correct
40 Correct 10 ms 5684 KB Output is correct
41 Correct 11 ms 5720 KB Output is correct
42 Correct 11 ms 5720 KB Output is correct
43 Correct 11 ms 5716 KB Output is correct
44 Correct 12 ms 6232 KB Output is correct
45 Correct 1 ms 2392 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 7 ms 5204 KB Output is correct
48 Correct 1889 ms 116296 KB Output is correct
49 Correct 1776 ms 116416 KB Output is correct
50 Correct 1852 ms 116348 KB Output is correct
51 Correct 1822 ms 116132 KB Output is correct
52 Correct 1791 ms 116188 KB Output is correct
53 Correct 1764 ms 116328 KB Output is correct
54 Correct 1866 ms 116004 KB Output is correct
55 Correct 1446 ms 115920 KB Output is correct
56 Correct 1668 ms 116096 KB Output is correct
57 Correct 1618 ms 116168 KB Output is correct
58 Correct 1727 ms 116064 KB Output is correct
59 Correct 1650 ms 116196 KB Output is correct
60 Correct 1616 ms 116020 KB Output is correct
61 Correct 1643 ms 117152 KB Output is correct
62 Correct 5 ms 19036 KB Output is correct
63 Correct 3 ms 2652 KB Output is correct
64 Correct 921 ms 67572 KB Output is correct
65 Correct 865 ms 60704 KB Output is correct
66 Correct 578 ms 59280 KB Output is correct
67 Correct 2084 ms 116172 KB Output is correct
68 Correct 2056 ms 113560 KB Output is correct
69 Correct 1163 ms 66924 KB Output is correct
70 Correct 1499 ms 96492 KB Output is correct
71 Correct 1569 ms 94536 KB Output is correct
72 Correct 1573 ms 103228 KB Output is correct
73 Correct 1600 ms 93092 KB Output is correct
74 Correct 1541 ms 94300 KB Output is correct
75 Correct 2 ms 2652 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 3 ms 604 KB Output is correct
78 Correct 1012 ms 56048 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 3 ms 15192 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2632 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 12 ms 5972 KB Output is correct
28 Correct 11 ms 5976 KB Output is correct
29 Correct 11 ms 5972 KB Output is correct
30 Correct 11 ms 5976 KB Output is correct
31 Correct 11 ms 5972 KB Output is correct
32 Correct 12 ms 5976 KB Output is correct
33 Correct 12 ms 5976 KB Output is correct
34 Correct 11 ms 5964 KB Output is correct
35 Correct 12 ms 5976 KB Output is correct
36 Correct 11 ms 5976 KB Output is correct
37 Correct 12 ms 5976 KB Output is correct
38 Correct 12 ms 5976 KB Output is correct
39 Correct 6 ms 5212 KB Output is correct
40 Correct 6 ms 3164 KB Output is correct
41 Correct 4 ms 4956 KB Output is correct
42 Correct 11 ms 5468 KB Output is correct
43 Correct 10 ms 5212 KB Output is correct
44 Correct 9 ms 5468 KB Output is correct
45 Correct 10 ms 5468 KB Output is correct
46 Correct 7 ms 3164 KB Output is correct
47 Correct 7 ms 3164 KB Output is correct
48 Correct 7 ms 3164 KB Output is correct
49 Correct 7 ms 3164 KB Output is correct
50 Correct 10 ms 5044 KB Output is correct
51 Correct 10 ms 5684 KB Output is correct
52 Correct 11 ms 5720 KB Output is correct
53 Correct 11 ms 5720 KB Output is correct
54 Correct 11 ms 5716 KB Output is correct
55 Correct 12 ms 6232 KB Output is correct
56 Correct 1 ms 2392 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 7 ms 5204 KB Output is correct
59 Correct 1889 ms 116296 KB Output is correct
60 Correct 1776 ms 116416 KB Output is correct
61 Correct 1852 ms 116348 KB Output is correct
62 Correct 1822 ms 116132 KB Output is correct
63 Correct 1791 ms 116188 KB Output is correct
64 Correct 1764 ms 116328 KB Output is correct
65 Correct 1866 ms 116004 KB Output is correct
66 Correct 1446 ms 115920 KB Output is correct
67 Correct 1668 ms 116096 KB Output is correct
68 Correct 1618 ms 116168 KB Output is correct
69 Correct 1727 ms 116064 KB Output is correct
70 Correct 1650 ms 116196 KB Output is correct
71 Correct 1616 ms 116020 KB Output is correct
72 Correct 1643 ms 117152 KB Output is correct
73 Correct 5 ms 19036 KB Output is correct
74 Correct 3 ms 2652 KB Output is correct
75 Correct 921 ms 67572 KB Output is correct
76 Correct 865 ms 60704 KB Output is correct
77 Correct 578 ms 59280 KB Output is correct
78 Correct 2084 ms 116172 KB Output is correct
79 Correct 2056 ms 113560 KB Output is correct
80 Correct 1163 ms 66924 KB Output is correct
81 Correct 1499 ms 96492 KB Output is correct
82 Correct 1569 ms 94536 KB Output is correct
83 Correct 1573 ms 103228 KB Output is correct
84 Correct 1600 ms 93092 KB Output is correct
85 Correct 1541 ms 94300 KB Output is correct
86 Correct 2 ms 2652 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 3 ms 604 KB Output is correct
89 Correct 1012 ms 56048 KB Output is correct
90 Correct 2097 ms 118856 KB Output is correct
91 Correct 2266 ms 148916 KB Output is correct
92 Correct 2386 ms 143452 KB Output is correct
93 Correct 2326 ms 144156 KB Output is correct
94 Correct 2281 ms 149204 KB Output is correct
95 Correct 2226 ms 148944 KB Output is correct
96 Correct 2220 ms 151288 KB Output is correct
97 Correct 1517 ms 119308 KB Output is correct
98 Correct 2117 ms 150556 KB Output is correct
99 Correct 2048 ms 149652 KB Output is correct
100 Correct 2109 ms 149324 KB Output is correct
101 Correct 2122 ms 148896 KB Output is correct
102 Correct 2086 ms 147888 KB Output is correct
103 Correct 2109 ms 150988 KB Output is correct
104 Correct 1353 ms 100764 KB Output is correct
105 Correct 1509 ms 96636 KB Output is correct
106 Correct 957 ms 91728 KB Output is correct
107 Correct 2488 ms 156756 KB Output is correct
108 Correct 2563 ms 156856 KB Output is correct
109 Correct 2567 ms 158192 KB Output is correct
110 Correct 2630 ms 158840 KB Output is correct
111 Correct 1583 ms 102048 KB Output is correct
112 Correct 1976 ms 134672 KB Output is correct
113 Correct 2153 ms 133020 KB Output is correct
114 Correct 2314 ms 147580 KB Output is correct
115 Correct 2094 ms 133388 KB Output is correct
116 Correct 2003 ms 134676 KB Output is correct
117 Correct 185 ms 41304 KB Output is correct
118 Correct 192 ms 38480 KB Output is correct
119 Correct 175 ms 39516 KB Output is correct
120 Correct 185 ms 41564 KB Output is correct
121 Correct 202 ms 42664 KB Output is correct
122 Correct 1413 ms 92780 KB Output is correct
123 Correct 2459 ms 150780 KB Output is correct
124 Correct 2429 ms 150784 KB Output is correct
125 Correct 2628 ms 150932 KB Output is correct