Submission #210105

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
210105	2020-03-16T14:39:05 Z	hanagasumi	Long Distance Coach (JOI17_coach)	C++17	71 / 100	624 ms	262148 KB

coach

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>

#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;


signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int x, n, m, w, T;
	cin >> x >> n >> m >> w >> T;
	vector<int> s(n + 1);
	vector<pair<int, int>> p(m);
	vector<int> pref(m + 1, 0);
	vector<int> cnt(m + 1, 0);
	vector<int> d(m + 1, 0);
	s[0] = 0;
	for (int i = 1; i <= n; i++) 
		cin >> s[i];	
	s.pb(x);
	n += 2;
	sort(s.begin(), s.end());
	for (int i = 0; i < m; i++) {
		cin >> p[i].ft >> p[i].sc;
	}
	sort(p.begin(), p.end());
	for (int i = 0; i < m; i++) {
		pref[i + 1] = pref[i] + p[i].sc;
		cnt[i] = (x - p[i].ft) / T + 1;
		d[i] = p[i].ft;
	}

	vector<vector<pair<int, int>>> can(m + 1);

	for (int i = 1; i < n; i++) {
		int driver = s[i] / T * T;
		int lstt = -1, lst = -1;
		for (int j = 0; j < m; j++) {
			int time = s[i] / T * T + d[j];
			if(time > s[i]) 
				time -= T;
			if(time < s[i - 1])
				continue;
			if(time < driver) 
				continue;
			if(time > lstt) {
				lstt = time;
				lst = j;
			}
		}
		if(lstt == -1) 
			continue;
		for (int j = m - 1; j >= 0; j--) {
			int time = s[i] / T * T + d[j];
			if(time > s[i]) 
				time -= T;
			if(time < s[i - 1]) 
				continue;
			if(time < driver) 
				continue;
			can[lst].pb({s[i], j});
		}
	}
	vector<int> dp(m + 1, 0);
	for (int i = 0; i < m; i++) {
		dp[i + 1] = dp[i] + cnt[i] * w;
		int add = 0;
		for (auto x : can[i]) {
			if(x.sc == i) 
				add = 0;
			int time = x.ft / T * T + d[x.sc];
			if(time > x.ft) 
				time -= T;
			add += time / T * w + p[x.sc].sc;
			dp[i + 1] = min(dp[i + 1], dp[x.sc] + add);
		}
	}
	cout << dp[m] + ((x / T + 1) * w) << endl;


	return 0;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	504 KB	Output is correct
24	Correct	5 ms	504 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	636 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	5 ms	508 KB	Output is correct
33	Correct	5 ms	504 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	5 ms	504 KB	Output is correct
37	Correct	5 ms	504 KB	Output is correct

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	504 KB	Output is correct
24	Correct	5 ms	504 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	636 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	5 ms	508 KB	Output is correct
33	Correct	5 ms	504 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	5 ms	504 KB	Output is correct
37	Correct	5 ms	504 KB	Output is correct
38	Correct	95 ms	32108 KB	Output is correct
39	Correct	100 ms	34168 KB	Output is correct
40	Correct	126 ms	38648 KB	Output is correct
41	Correct	92 ms	32804 KB	Output is correct
42	Correct	99 ms	35476 KB	Output is correct
43	Correct	81 ms	29236 KB	Output is correct
44	Correct	123 ms	36828 KB	Output is correct
45	Correct	101 ms	35728 KB	Output is correct
46	Correct	103 ms	37676 KB	Output is correct
47	Correct	108 ms	37624 KB	Output is correct
48	Correct	120 ms	37668 KB	Output is correct
49	Correct	30 ms	592 KB	Output is correct
50	Correct	98 ms	33252 KB	Output is correct
51	Correct	98 ms	33000 KB	Output is correct

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	376 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	504 KB	Output is correct
24	Correct	5 ms	504 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	380 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	636 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	5 ms	508 KB	Output is correct
33	Correct	5 ms	504 KB	Output is correct
34	Correct	5 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	5 ms	504 KB	Output is correct
37	Correct	5 ms	504 KB	Output is correct
38	Correct	95 ms	32108 KB	Output is correct
39	Correct	100 ms	34168 KB	Output is correct
40	Correct	126 ms	38648 KB	Output is correct
41	Correct	92 ms	32804 KB	Output is correct
42	Correct	99 ms	35476 KB	Output is correct
43	Correct	81 ms	29236 KB	Output is correct
44	Correct	123 ms	36828 KB	Output is correct
45	Correct	101 ms	35728 KB	Output is correct
46	Correct	103 ms	37676 KB	Output is correct
47	Correct	108 ms	37624 KB	Output is correct
48	Correct	120 ms	37668 KB	Output is correct
49	Correct	30 ms	592 KB	Output is correct
50	Correct	98 ms	33252 KB	Output is correct
51	Correct	98 ms	33000 KB	Output is correct
52	Runtime error	624 ms	262148 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

Submission #210105

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 30.0 / 30.0

Subtask #3 25.0 / 25.0

Subtask #4 0 / 29.0

Subtask #1
16.0 / 16.0

Subtask #2
30.0 / 30.0

Subtask #3
25.0 / 25.0

Subtask #4
0 / 29.0