oj.uz

Submission #848415

# Submission time Handle Problem Language Result Execution time Memory
848415 2023-09-12T14:53:13 Z Muaath_5 Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 15520 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double

using namespace std;

const ll N = 1005, INF = 7e15;

ll n, m, l, x;
ll pos[N][N];
ll full[N][N];
vector<int> srt[N];
vector<int> spd;
vector<ll> st;
vector<int> len;



ll tmp;
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, spd = W, st = T, len = S;
	for (int j = 0; j < n; j++) {
		pos[0][j] = T[j];
		//full[0][j] = T[j];
		srt[0].push_back(j);
	}
	sort(srt[0].begin(), srt[0].end(), [](int x, int y) {
		return st[x] == st[y] ? spd[x] < spd[y] : st[x] < st[y];
	});
	for (int i = 0; i < m-1; i++) {
		//cerr << "Station " << i + 1 << '\n';
		pos[i + 1][srt[i][0]] = 1ll * spd[srt[i][0]] * (len[i + 1] - len[i]) + pos[i][srt[i][0]];
		//full[i + 1][srt[i][0]] = 1ll * spd[srt[i][0]] * (len[i + 1] - len[i]) + full[i][srt[i][0]];
        srt[i + 1].push_back(0);
		//cerr << "Bus " << srt[i][0] << " Arrives " << pos[i+1][srt[i][0]] << '\n';
		for (int j = 1; j < n; j++) {
            srt[i + 1].push_back(j);
			//full[i + 1][srt[i][j]] = 1ll * spd[srt[i][j]] * (len[i + 1] - len[i]) + full[i][srt[i][j]];
            const ll exp = 1ll * spd[srt[i][j]] * (len[i + 1] - len[i]) + pos[i][srt[i][j]];
            if (exp < pos[i + 1][srt[i][j - 1]]) {
				pos[i + 1][srt[i][j]] = pos[i + 1][srt[i][j - 1]];
				//cerr << "Intersects: ";
			}
			else {
				pos[i + 1][srt[i][j]] = exp;
			}
			//cerr << "Bus " << srt[i][j] << " Arrives " << pos[i + 1][srt[i][j]] << '\n';
		}
        tmp = i+1;
		sort(srt[i+1].begin(), srt[i+1].end(), [](int x, int y) {
			return pos[tmp][x] == pos[tmp][y] ? spd[x] < spd[y] : pos[tmp][x] < pos[tmp][y];
		});
	}
}

ll arrival_time(ll Y) {
	ll tm = Y;
	for (int i = 0; i < m-1; i++) {
		const ll exp = 1ll * x * (len[i + 1] - len[i]) + tm;
		if (pos[i][srt[i][0]] >= tm) {
			tm = exp;
		}
		else {
			int l = 0, r = n - 1;
			while (l < r) {
				const int md = (l + r + 1) / 2;
				if (pos[i][srt[i][md]] < tm || (pos[i][srt[i][md]] == tm && spd[srt[i][md]] < x))
					l = md;
				else
					r = md - 1;
			}
			int prv = srt[i][l];
			if (exp < pos[i + 1][prv]) {
				tm = pos[i + 1][prv];
			}
			else {
				tm = exp;
			}
		}
	}
	return tm;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 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 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 4 ms 9460 KB Output is correct
9 Correct 5 ms 9308 KB Output is correct
10 Correct 4 ms 9308 KB Output is correct
11 Correct 4 ms 9304 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 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 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 1 ms 2396 KB Output is correct
10 Correct 1 ms 2560 KB Output is correct
11 Correct 1 ms 2396 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 2392 KB Output is correct

Subtask #3
20.0 / 20.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 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 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 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4708 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4696 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 2 ms 4444 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct

Subtask #4
26.0 / 26.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 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 9460 KB Output is correct
10 Correct 5 ms 9308 KB Output is correct
11 Correct 4 ms 9308 KB Output is correct
12 Correct 4 ms 9304 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 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4708 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4440 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4696 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 2 ms 4444 KB Output is correct
47 Correct 1 ms 4440 KB Output is correct
48 Correct 78 ms 13908 KB Output is correct
49 Correct 204 ms 14060 KB Output is correct
50 Correct 193 ms 14172 KB Output is correct
51 Correct 192 ms 14060 KB Output is correct
52 Correct 200 ms 14244 KB Output is correct
53 Correct 204 ms 14160 KB Output is correct
54 Correct 197 ms 13908 KB Output is correct
55 Correct 89 ms 13816 KB Output is correct
56 Correct 204 ms 13900 KB Output is correct
57 Correct 204 ms 13972 KB Output is correct
58 Correct 199 ms 14064 KB Output is correct
59 Correct 185 ms 13856 KB Output is correct
60 Correct 196 ms 14056 KB Output is correct
61 Correct 189 ms 14208 KB Output is correct
62 Correct 12 ms 9304 KB Output is correct
63 Correct 2 ms 2648 KB Output is correct
64 Correct 250 ms 11868 KB Output is correct
65 Correct 213 ms 8728 KB Output is correct
66 Correct 389 ms 13912 KB Output is correct
67 Correct 419 ms 14060 KB Output is correct
68 Correct 391 ms 14084 KB Output is correct
69 Correct 228 ms 14164 KB Output is correct
70 Correct 244 ms 14056 KB Output is correct
71 Correct 219 ms 13908 KB Output is correct
72 Correct 233 ms 14056 KB Output is correct
73 Correct 243 ms 13904 KB Output is correct
74 Correct 214 ms 13908 KB Output is correct
75 Correct 431 ms 14060 KB Output is correct
76 Correct 433 ms 13984 KB Output is correct
77 Correct 454 ms 13904 KB Output is correct
78 Correct 183 ms 14056 KB Output is correct

Subtask #5
0.0 / 35.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 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 9460 KB Output is correct
10 Correct 5 ms 9308 KB Output is correct
11 Correct 4 ms 9308 KB Output is correct
12 Correct 4 ms 9304 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 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2560 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 2 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4708 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 2 ms 4440 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 1 ms 4444 KB Output is correct
54 Correct 1 ms 4696 KB Output is correct
55 Correct 2 ms 4444 KB Output is correct
56 Correct 1 ms 4444 KB Output is correct
57 Correct 2 ms 4444 KB Output is correct
58 Correct 1 ms 4440 KB Output is correct
59 Correct 78 ms 13908 KB Output is correct
60 Correct 204 ms 14060 KB Output is correct
61 Correct 193 ms 14172 KB Output is correct
62 Correct 192 ms 14060 KB Output is correct
63 Correct 200 ms 14244 KB Output is correct
64 Correct 204 ms 14160 KB Output is correct
65 Correct 197 ms 13908 KB Output is correct
66 Correct 89 ms 13816 KB Output is correct
67 Correct 204 ms 13900 KB Output is correct
68 Correct 204 ms 13972 KB Output is correct
69 Correct 199 ms 14064 KB Output is correct
70 Correct 185 ms 13856 KB Output is correct
71 Correct 196 ms 14056 KB Output is correct
72 Correct 189 ms 14208 KB Output is correct
73 Correct 12 ms 9304 KB Output is correct
74 Correct 2 ms 2648 KB Output is correct
75 Correct 250 ms 11868 KB Output is correct
76 Correct 213 ms 8728 KB Output is correct
77 Correct 389 ms 13912 KB Output is correct
78 Correct 419 ms 14060 KB Output is correct
79 Correct 391 ms 14084 KB Output is correct
80 Correct 228 ms 14164 KB Output is correct
81 Correct 244 ms 14056 KB Output is correct
82 Correct 219 ms 13908 KB Output is correct
83 Correct 233 ms 14056 KB Output is correct
84 Correct 243 ms 13904 KB Output is correct
85 Correct 214 ms 13908 KB Output is correct
86 Correct 431 ms 14060 KB Output is correct
87 Correct 433 ms 13984 KB Output is correct
88 Correct 454 ms 13904 KB Output is correct
89 Correct 183 ms 14056 KB Output is correct
90 Execution timed out 3599 ms 15520 KB Time limit exceeded
91 Halted 0 ms 0 KB -