oj.uz

Submission #54285

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

LL cnt(LL m, LL a, LL b, LL T){
	a -= m;
	b -= m;
	if(b < 0) return 0;
	a = max(a, 0LL);
	b = max(b, 0LL);
	LL f = (a+T-1)/T;
	LL g = (b)/T;
	return max(g-f+1, 0LL);
}

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);
	sort(stop.begin(), stop.end());

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

	for(LL i = 0; i < M; i++){
		LL d, c;
		cin >> d >> c;
		d *= 2;
		times.push_back({d,c});
	}
	sort(times.begin(), times.end());

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



	vector<LL> dp(refundcost.size(), W*(X+1));
	dp[0] = 0;
	vector<LL> minstopindex(refundcost.size(), stop.size());
	for(LL r = 1; r < stop.size(); r++){
		LL R = stop[r];
		for(int i = 0; i < t.size(); i++){
			if(t[i] < (R % T) && (R % T) < t[i+1]){
				minstopindex[i] = min(minstopindex[i], r);
				break;
			}
		}
	}
	for(int j = 1; j < refundcost.size(); j++){
		LL cost = 0;
		LL idx = stop.size();
		for(int i = j-1; i >= 0; i--){
			dp[j] = min(dp[j], dp[i] + W * cnt(t[i], 0, X, T) + cost - refundcost[i]);
			idx = min(idx, minstopindex[i]);
			if(idx == stop.size()){
				cost += W * cnt(t[i], 0, X, T);
			} else {
				cost += W * (cnt(t[i], 0, stop[idx], T) - 1);
			}
		}
	}
	// T = time delay
	cout << dp[refundcost.size()-1] + totalrefundcost << '\n';
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:52:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < times.size(); i++){
                 ~~^~~~~~~~~~~~~~
coach.cpp:65:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(LL r = 1; r < stop.size(); r++){
                ~~^~~~~~~~~~~~~
coach.cpp:67:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < t.size(); i++){
                  ~~^~~~~~~~~~
coach.cpp:74:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 1; j < refundcost.size(); j++){
                 ~~^~~~~~~~~~~~~~~~~~~
coach.cpp:80:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(idx == stop.size()){
       ~~~~^~~~~~~~~~~~~~

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 3 ms 488 KB Output is correct
6 Correct 3 ms 516 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 680 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 824 KB Output is correct
20 Correct 2 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 2 ms 828 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 3 ms 488 KB Output is correct
6 Correct 3 ms 516 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 680 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 824 KB Output is correct
20 Correct 2 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 2 ms 828 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 2 ms 828 KB Output is correct
25 Correct 2 ms 828 KB Output is correct
26 Correct 2 ms 828 KB Output is correct
27 Correct 2 ms 828 KB Output is correct
28 Correct 3 ms 828 KB Output is correct
29 Correct 3 ms 828 KB Output is correct
30 Correct 2 ms 828 KB Output is correct
31 Correct 2 ms 828 KB Output is correct
32 Correct 2 ms 828 KB Output is correct
33 Correct 2 ms 828 KB Output is correct
34 Correct 3 ms 828 KB Output is correct
35 Correct 2 ms 828 KB Output is correct
36 Correct 3 ms 828 KB Output is correct
37 Correct 2 ms 828 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 3 ms 488 KB Output is correct
6 Correct 3 ms 516 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 680 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 824 KB Output is correct
20 Correct 2 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 2 ms 828 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 2 ms 828 KB Output is correct
25 Correct 2 ms 828 KB Output is correct
26 Correct 2 ms 828 KB Output is correct
27 Correct 2 ms 828 KB Output is correct
28 Correct 3 ms 828 KB Output is correct
29 Correct 3 ms 828 KB Output is correct
30 Correct 2 ms 828 KB Output is correct
31 Correct 2 ms 828 KB Output is correct
32 Correct 2 ms 828 KB Output is correct
33 Correct 2 ms 828 KB Output is correct
34 Correct 3 ms 828 KB Output is correct
35 Correct 2 ms 828 KB Output is correct
36 Correct 3 ms 828 KB Output is correct
37 Correct 2 ms 828 KB Output is correct
38 Correct 124 ms 888 KB Output is correct
39 Correct 117 ms 888 KB Output is correct
40 Correct 119 ms 936 KB Output is correct
41 Correct 131 ms 936 KB Output is correct
42 Correct 133 ms 936 KB Output is correct
43 Correct 125 ms 944 KB Output is correct
44 Correct 123 ms 944 KB Output is correct
45 Correct 125 ms 944 KB Output is correct
46 Correct 119 ms 944 KB Output is correct
47 Correct 130 ms 944 KB Output is correct
48 Correct 126 ms 948 KB Output is correct
49 Correct 124 ms 960 KB Output is correct
50 Correct 128 ms 960 KB Output is correct
51 Correct 117 ms 960 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 3 ms 488 KB Output is correct
6 Correct 3 ms 516 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 680 KB Output is correct
14 Correct 2 ms 684 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 696 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 824 KB Output is correct
20 Correct 2 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 2 ms 828 KB Output is correct
23 Correct 2 ms 828 KB Output is correct
24 Correct 2 ms 828 KB Output is correct
25 Correct 2 ms 828 KB Output is correct
26 Correct 2 ms 828 KB Output is correct
27 Correct 2 ms 828 KB Output is correct
28 Correct 3 ms 828 KB Output is correct
29 Correct 3 ms 828 KB Output is correct
30 Correct 2 ms 828 KB Output is correct
31 Correct 2 ms 828 KB Output is correct
32 Correct 2 ms 828 KB Output is correct
33 Correct 2 ms 828 KB Output is correct
34 Correct 3 ms 828 KB Output is correct
35 Correct 2 ms 828 KB Output is correct
36 Correct 3 ms 828 KB Output is correct
37 Correct 2 ms 828 KB Output is correct
38 Correct 124 ms 888 KB Output is correct
39 Correct 117 ms 888 KB Output is correct
40 Correct 119 ms 936 KB Output is correct
41 Correct 131 ms 936 KB Output is correct
42 Correct 133 ms 936 KB Output is correct
43 Correct 125 ms 944 KB Output is correct
44 Correct 123 ms 944 KB Output is correct
45 Correct 125 ms 944 KB Output is correct
46 Correct 119 ms 944 KB Output is correct
47 Correct 130 ms 944 KB Output is correct
48 Correct 126 ms 948 KB Output is correct
49 Correct 124 ms 960 KB Output is correct
50 Correct 128 ms 960 KB Output is correct
51 Correct 117 ms 960 KB Output is correct
52 Execution timed out 2062 ms 13592 KB Time limit exceeded
53 Halted 0 ms 0 KB -