oj.uz

답안 #851747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851747 2023-09-20T14:08:48 Z Naser 추월 (IOI23_overtaking) C++17
65 / 100
 3500 ms 25688 KB 
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define vint vector<int>
#define vll vector<ll>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vll>
using namespace std;
const int N = (int)2e5 + 69;
const int mod = (int)1e4 + 7;
const int naser = 3999, tourist = 3816;
int power(int a, int b) { int ans = 1; while (b) { if (b % 2) ans *= a; a *= a; b /= 2; } return ans; }
 
ll n, x, m, l, y, stn;
vll w, s, t;
graph arv, srt,arvsrt;
 
bool cmp(int a, int b) {
	if (arv[stn][a] == arv[stn][b])
		return w[a] < w[b];
	return arv[stn][a] < arv[stn][b];
}
bool cmp2(int a, int b) {
	return arv[stn][a] < b;
}
void init(int L, int N, vll T, vint W, int X, int M, vint S) {
	n = N;
	t = T;
	w.resize(n);
	for (int i = 0; i < n; i++)
		w[i] = W[i];
	x = X;
	m = M;
	s.resize(m);
	for (int i = 0; i < m; i++)
		s[i] = S[i];
	arv.resize(m, vll(n));
	srt.resize(m, vll(n));
	arvsrt.resize(m);
	vector<ll> tmp;
	for (int i = 0; i < n; i++) {
		arv[0][i] = t[i];
		arvsrt[0].pb(t[i]);
		tmp.pb(i);
	}
	sort(all(arvsrt[0]));
 
	for (int i = 0; i < m - 1; i++) {
		stn = i;
		sort(all(tmp), cmp);
		srt[i] = tmp;
 
		arv[i + 1][srt[i][0]] = arvsrt[i][0] + w[srt[i][0]] * (s[i + 1] - s[i]);
		arvsrt[i + 1].pb(arvsrt[i][0] + w[srt[i][0]] * (s[i + 1] - s[i]));
		for (int j = 1; j < n; j++) {
			int bus = srt[i][j];
			int prv = srt[i][j - 1];
			ll ex = arv[i][bus] + (s[i + 1] - s[i]) * w[bus];
			if (ex > arv[i + 1][prv])
				arv[i + 1][bus] = ex;
			else
				arv[i + 1][bus] = arv[i + 1][prv];
			arvsrt[i + 1].pb(arv[i + 1][bus]);
		}
 
	}
}
 
long long arrival_time(long long y) {
	ll ans = y;
	for (int i = 0; i < m - 1; i++) {
		ll ex = ans + (s[i+1] - s[i]) * x;
		if (ans <= arvsrt[i][0])
			ans = ex;
		else {
			int idx = lower_bound(all(arvsrt[i]),ans)-arvsrt[i].begin();
			int prv = srt[i][idx - 1];
			if (ex < arv[i+1][prv])
				ans = arv[i+1][prv];
			else
				ans = ex;
		}
	}
	return ans;
}
//int32_t main() {
//
//	init(6, 4, { 20, 10, 40, 0 }, { 5, 20, 20, 30 }, 10, 4, { 0, 1, 3, 6 });
//	//init(6, 1, { 5 }, { 20 }, 10, 5, { 0,2,4,5 ,6 });
//	while (naser > tourist) {
//		ll Y;
//		cin >> Y;
//		cout << arrival_time(Y) << endl;
//	}
//
//}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 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 856 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 600 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 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 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 1 ms 600 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 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 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 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 856 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 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 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 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 600 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 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 105 ms 24292 KB Output is correct
49 Correct 268 ms 24344 KB Output is correct
50 Correct 269 ms 24356 KB Output is correct
51 Correct 267 ms 24408 KB Output is correct
52 Correct 259 ms 24408 KB Output is correct
53 Correct 272 ms 24552 KB Output is correct
54 Correct 254 ms 24600 KB Output is correct
55 Correct 98 ms 24144 KB Output is correct
56 Correct 261 ms 24400 KB Output is correct
57 Correct 257 ms 24352 KB Output is correct
58 Correct 270 ms 24156 KB Output is correct
59 Correct 286 ms 24352 KB Output is correct
60 Correct 262 ms 24344 KB Output is correct
61 Correct 267 ms 24356 KB Output is correct
62 Correct 12 ms 604 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 240 ms 12444 KB Output is correct
65 Correct 254 ms 12368 KB Output is correct
66 Correct 666 ms 24348 KB Output is correct
67 Correct 741 ms 24404 KB Output is correct
68 Correct 726 ms 24348 KB Output is correct
69 Correct 363 ms 24404 KB Output is correct
70 Correct 365 ms 24148 KB Output is correct
71 Correct 392 ms 24400 KB Output is correct
72 Correct 390 ms 24400 KB Output is correct
73 Correct 379 ms 24352 KB Output is correct
74 Correct 362 ms 24220 KB Output is correct
75 Correct 688 ms 24352 KB Output is correct
76 Correct 654 ms 24400 KB Output is correct
77 Correct 744 ms 24344 KB Output is correct
78 Correct 218 ms 24348 KB Output is correct

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 856 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 856 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 600 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 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 600 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 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 105 ms 24292 KB Output is correct
60 Correct 268 ms 24344 KB Output is correct
61 Correct 269 ms 24356 KB Output is correct
62 Correct 267 ms 24408 KB Output is correct
63 Correct 259 ms 24408 KB Output is correct
64 Correct 272 ms 24552 KB Output is correct
65 Correct 254 ms 24600 KB Output is correct
66 Correct 98 ms 24144 KB Output is correct
67 Correct 261 ms 24400 KB Output is correct
68 Correct 257 ms 24352 KB Output is correct
69 Correct 270 ms 24156 KB Output is correct
70 Correct 286 ms 24352 KB Output is correct
71 Correct 262 ms 24344 KB Output is correct
72 Correct 267 ms 24356 KB Output is correct
73 Correct 12 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 240 ms 12444 KB Output is correct
76 Correct 254 ms 12368 KB Output is correct
77 Correct 666 ms 24348 KB Output is correct
78 Correct 741 ms 24404 KB Output is correct
79 Correct 726 ms 24348 KB Output is correct
80 Correct 363 ms 24404 KB Output is correct
81 Correct 365 ms 24148 KB Output is correct
82 Correct 392 ms 24400 KB Output is correct
83 Correct 390 ms 24400 KB Output is correct
84 Correct 379 ms 24352 KB Output is correct
85 Correct 362 ms 24220 KB Output is correct
86 Correct 688 ms 24352 KB Output is correct
87 Correct 654 ms 24400 KB Output is correct
88 Correct 744 ms 24344 KB Output is correct
89 Correct 218 ms 24348 KB Output is correct
90 Execution timed out 3526 ms 25688 KB Time limit exceeded
91 Halted 0 ms 0 KB -