답안 #54203 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
54203	2018-07-02T19:27:44 Z	ksun48	Long Distance Coach (JOI17_coach)	C++14	71 / 100	2000 ms	19792 KB

coach

#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;
	// 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;
		stop.push_back(s);
	}
	stop.push_back(X);
	sort(stop.begin(), stop.end());

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

	LL totalrefundcost = 0;
	for(LL i = 0; i < M; i++){
		LL d, c;
		cin >> d >> c;
		times.push_back({d,c});
		totalrefundcost += 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
	for(int i = 0; i < M; 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
	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);
			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] << '\n';
}

Compilation message

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

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	464 KB	Output is correct
7	Correct	3 ms	464 KB	Output is correct
8	Correct	2 ms	520 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	520 KB	Output is correct
12	Correct	2 ms	520 KB	Output is correct
13	Correct	2 ms	648 KB	Output is correct
14	Correct	2 ms	648 KB	Output is correct
15	Correct	2 ms	648 KB	Output is correct
16	Correct	2 ms	712 KB	Output is correct
17	Correct	2 ms	712 KB	Output is correct
18	Correct	2 ms	712 KB	Output is correct
19	Correct	2 ms	712 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	464 KB	Output is correct
7	Correct	3 ms	464 KB	Output is correct
8	Correct	2 ms	520 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	520 KB	Output is correct
12	Correct	2 ms	520 KB	Output is correct
13	Correct	2 ms	648 KB	Output is correct
14	Correct	2 ms	648 KB	Output is correct
15	Correct	2 ms	648 KB	Output is correct
16	Correct	2 ms	712 KB	Output is correct
17	Correct	2 ms	712 KB	Output is correct
18	Correct	2 ms	712 KB	Output is correct
19	Correct	2 ms	712 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	3 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	3 ms	748 KB	Output is correct
26	Correct	3 ms	748 KB	Output is correct
27	Correct	2 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	3 ms	748 KB	Output is correct
30	Correct	3 ms	748 KB	Output is correct
31	Correct	2 ms	748 KB	Output is correct
32	Correct	2 ms	748 KB	Output is correct
33	Correct	3 ms	748 KB	Output is correct
34	Correct	2 ms	748 KB	Output is correct
35	Correct	2 ms	748 KB	Output is correct
36	Correct	2 ms	748 KB	Output is correct
37	Correct	2 ms	748 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	464 KB	Output is correct
7	Correct	3 ms	464 KB	Output is correct
8	Correct	2 ms	520 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	520 KB	Output is correct
12	Correct	2 ms	520 KB	Output is correct
13	Correct	2 ms	648 KB	Output is correct
14	Correct	2 ms	648 KB	Output is correct
15	Correct	2 ms	648 KB	Output is correct
16	Correct	2 ms	712 KB	Output is correct
17	Correct	2 ms	712 KB	Output is correct
18	Correct	2 ms	712 KB	Output is correct
19	Correct	2 ms	712 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	3 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	3 ms	748 KB	Output is correct
26	Correct	3 ms	748 KB	Output is correct
27	Correct	2 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	3 ms	748 KB	Output is correct
30	Correct	3 ms	748 KB	Output is correct
31	Correct	2 ms	748 KB	Output is correct
32	Correct	2 ms	748 KB	Output is correct
33	Correct	3 ms	748 KB	Output is correct
34	Correct	2 ms	748 KB	Output is correct
35	Correct	2 ms	748 KB	Output is correct
36	Correct	2 ms	748 KB	Output is correct
37	Correct	2 ms	748 KB	Output is correct
38	Correct	116 ms	752 KB	Output is correct
39	Correct	116 ms	832 KB	Output is correct
40	Correct	117 ms	968 KB	Output is correct
41	Correct	115 ms	968 KB	Output is correct
42	Correct	116 ms	1000 KB	Output is correct
43	Correct	117 ms	1040 KB	Output is correct
44	Correct	117 ms	1220 KB	Output is correct
45	Correct	137 ms	1220 KB	Output is correct
46	Correct	126 ms	1224 KB	Output is correct
47	Correct	118 ms	1360 KB	Output is correct
48	Correct	117 ms	1360 KB	Output is correct
49	Correct	148 ms	1372 KB	Output is correct
50	Correct	115 ms	1412 KB	Output is correct
51	Correct	116 ms	1420 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	432 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	464 KB	Output is correct
7	Correct	3 ms	464 KB	Output is correct
8	Correct	2 ms	520 KB	Output is correct
9	Correct	2 ms	520 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	520 KB	Output is correct
12	Correct	2 ms	520 KB	Output is correct
13	Correct	2 ms	648 KB	Output is correct
14	Correct	2 ms	648 KB	Output is correct
15	Correct	2 ms	648 KB	Output is correct
16	Correct	2 ms	712 KB	Output is correct
17	Correct	2 ms	712 KB	Output is correct
18	Correct	2 ms	712 KB	Output is correct
19	Correct	2 ms	712 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	3 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	3 ms	748 KB	Output is correct
26	Correct	3 ms	748 KB	Output is correct
27	Correct	2 ms	748 KB	Output is correct
28	Correct	2 ms	748 KB	Output is correct
29	Correct	3 ms	748 KB	Output is correct
30	Correct	3 ms	748 KB	Output is correct
31	Correct	2 ms	748 KB	Output is correct
32	Correct	2 ms	748 KB	Output is correct
33	Correct	3 ms	748 KB	Output is correct
34	Correct	2 ms	748 KB	Output is correct
35	Correct	2 ms	748 KB	Output is correct
36	Correct	2 ms	748 KB	Output is correct
37	Correct	2 ms	748 KB	Output is correct
38	Correct	116 ms	752 KB	Output is correct
39	Correct	116 ms	832 KB	Output is correct
40	Correct	117 ms	968 KB	Output is correct
41	Correct	115 ms	968 KB	Output is correct
42	Correct	116 ms	1000 KB	Output is correct
43	Correct	117 ms	1040 KB	Output is correct
44	Correct	117 ms	1220 KB	Output is correct
45	Correct	137 ms	1220 KB	Output is correct
46	Correct	126 ms	1224 KB	Output is correct
47	Correct	118 ms	1360 KB	Output is correct
48	Correct	117 ms	1360 KB	Output is correct
49	Correct	148 ms	1372 KB	Output is correct
50	Correct	115 ms	1412 KB	Output is correct
51	Correct	116 ms	1420 KB	Output is correct
52	Execution timed out	2080 ms	19792 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #54203

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