oj.uz

Submission #54343

# Submission time Handle Problem Language Result Execution time Memory
54343 2018-07-03T07:52:03 Z ksun48 Long Distance Coach (JOI17_coach) C++14
71 / 100
 2000 ms 14296 KB 
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;

int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	LL X, N, M, W, T;
	cin >> X >> N >> M >> W >> T;
	T *= 2;
	X *= 2;
	// X = total duration
	// N = # stops
	// M = # passenges
	vector<LL> stop;
	stop.push_back(0);
	for(LL i = 0; i < N; i++){
		LL s;
		cin >> s;
		s *= 2;
		stop.push_back(s);
	}
	stop.push_back(X);

	// W = cost
	vector<pair<LL,LL> > times;

	LL totalrefundcost = 0;
	for(LL i = 0; i < M; i++){
		LL d, c;
		cin >> d >> c;
		d *= 2;
		totalrefundcost += c;
		if(X < (X/T) * T + d){
			c += W;
			stop.push_back((X/T) * T + d + 1);
		}
		times.push_back({d,c});
	}
	sort(times.begin(), times.end());
	sort(stop.begin(), stop.end());
	X = ((X/T) + 1) * T;

	vector<LL> t;
	vector<LL> refundcost;
	t.push_back(0);
	refundcost.push_back(0); // but you must always feed the driver
	for(int i = 0; i < times.size(); i++){
		t.push_back(times[i].first);
		refundcost.push_back(times[i].second);
	}
	t.push_back(T);
	refundcost.push_back(0); // should not use this result

	LL rounds = W * (X/T);
	vector<LL> mincost(refundcost.size(), rounds);
	for(LL r = 1; r < stop.size(); r++){
		LL R = stop[r] % T;
		LL s = 0;
		LL e = t.size();
		while(s + 1 < e){
			LL m = (s + e) / 2;
			if(t[m] < R) s = m;
			if(t[m] > R) e = m;
		}
		mincost[s] = min(mincost[s], W * (stop[r] / T));
	}
	for(int j = 0; j < refundcost.size(); j++){
		refundcost[j] -= rounds;
	}

	vector<LL> dp(refundcost.size(), W*(X+1));
	dp[0] = 0;
	for(int j = 1; j < refundcost.size(); j++){
		LL cost = 0;
		LL curcost = rounds;
		for(int i = j-1; i >= 0 && i >= j - 10000; i--){
			dp[j] = min(dp[j], dp[i] + cost - refundcost[i]);
			curcost = min(curcost, mincost[i]);
			cost += curcost;
		}
	}
	cout << dp[refundcost.size()-1] + totalrefundcost << '\n';
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < times.size(); i++){
                 ~~^~~~~~~~~~~~~~
coach.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(LL r = 1; r < stop.size(); r++){
                ~~^~~~~~~~~~~~~
coach.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < refundcost.size(); j++){
                 ~~^~~~~~~~~~~~~~~~~~~
coach.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 1; j < refundcost.size(); j++){
                 ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 784 KB Output is correct
11 Correct 2 ms 784 KB Output is correct
12 Correct 2 ms 784 KB Output is correct
13 Correct 2 ms 784 KB Output is correct
14 Correct 3 ms 784 KB Output is correct
15 Correct 2 ms 784 KB Output is correct
16 Correct 2 ms 784 KB Output is correct
17 Correct 2 ms 784 KB Output is correct
18 Correct 3 ms 784 KB Output is correct
19 Correct 2 ms 784 KB Output is correct
20 Correct 2 ms 784 KB Output is correct
21 Correct 2 ms 784 KB Output is correct
22 Correct 2 ms 784 KB Output is correct
23 Correct 2 ms 784 KB Output is correct
24 Correct 2 ms 784 KB Output is correct
25 Correct 2 ms 784 KB Output is correct
26 Correct 2 ms 784 KB Output is correct
27 Correct 2 ms 784 KB Output is correct
28 Correct 2 ms 784 KB Output is correct
29 Correct 2 ms 784 KB Output is correct
30 Correct 2 ms 784 KB Output is correct
31 Correct 2 ms 784 KB Output is correct
32 Correct 2 ms 784 KB Output is correct
33 Correct 2 ms 784 KB Output is correct
34 Correct 2 ms 784 KB Output is correct
35 Correct 2 ms 784 KB Output is correct
36 Correct 3 ms 784 KB Output is correct
37 Correct 2 ms 784 KB Output is correct
38 Correct 10 ms 784 KB Output is correct
39 Correct 10 ms 784 KB Output is correct
40 Correct 10 ms 784 KB Output is correct
41 Correct 9 ms 784 KB Output is correct
42 Correct 10 ms 784 KB Output is correct
43 Correct 10 ms 784 KB Output is correct
44 Correct 10 ms 784 KB Output is correct
45 Correct 10 ms 784 KB Output is correct
46 Correct 10 ms 784 KB Output is correct
47 Correct 10 ms 868 KB Output is correct
48 Correct 10 ms 868 KB Output is correct
49 Correct 11 ms 868 KB Output is correct
50 Correct 10 ms 868 KB Output is correct
51 Correct 9 ms 868 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 784 KB Output is correct
11 Correct 2 ms 784 KB Output is correct
12 Correct 2 ms 784 KB Output is correct
13 Correct 2 ms 784 KB Output is correct
14 Correct 3 ms 784 KB Output is correct
15 Correct 2 ms 784 KB Output is correct
16 Correct 2 ms 784 KB Output is correct
17 Correct 2 ms 784 KB Output is correct
18 Correct 3 ms 784 KB Output is correct
19 Correct 2 ms 784 KB Output is correct
20 Correct 2 ms 784 KB Output is correct
21 Correct 2 ms 784 KB Output is correct
22 Correct 2 ms 784 KB Output is correct
23 Correct 2 ms 784 KB Output is correct
24 Correct 2 ms 784 KB Output is correct
25 Correct 2 ms 784 KB Output is correct
26 Correct 2 ms 784 KB Output is correct
27 Correct 2 ms 784 KB Output is correct
28 Correct 2 ms 784 KB Output is correct
29 Correct 2 ms 784 KB Output is correct
30 Correct 2 ms 784 KB Output is correct
31 Correct 2 ms 784 KB Output is correct
32 Correct 2 ms 784 KB Output is correct
33 Correct 2 ms 784 KB Output is correct
34 Correct 2 ms 784 KB Output is correct
35 Correct 2 ms 784 KB Output is correct
36 Correct 3 ms 784 KB Output is correct
37 Correct 2 ms 784 KB Output is correct
38 Correct 10 ms 784 KB Output is correct
39 Correct 10 ms 784 KB Output is correct
40 Correct 10 ms 784 KB Output is correct
41 Correct 9 ms 784 KB Output is correct
42 Correct 10 ms 784 KB Output is correct
43 Correct 10 ms 784 KB Output is correct
44 Correct 10 ms 784 KB Output is correct
45 Correct 10 ms 784 KB Output is correct
46 Correct 10 ms 784 KB Output is correct
47 Correct 10 ms 868 KB Output is correct
48 Correct 10 ms 868 KB Output is correct
49 Correct 11 ms 868 KB Output is correct
50 Correct 10 ms 868 KB Output is correct
51 Correct 9 ms 868 KB Output is correct
52 Execution timed out 2065 ms 14296 KB Time limit exceeded
53 Halted 0 ms 0 KB -