oj.uz

Submission #113110

# Submission time Handle Problem Language Result Execution time Memory
113110 2019-05-23T17:53:56 Z Bruteforceman Long Distance Coach (JOI17_coach) C++11
71 / 100
 2000 ms 15328 KB 
#include "bits/stdc++.h"
using namespace std;
long long s[200010];
long long d[200010];
long long c[200010];
int N, M;
long long X, W, T;
typedef pair <long long, int> pii;
vector <pii> v;
long long dp[200010];

long long p[200010];
int cnt[200010];

int main(int argc, char const *argv[])
{
	scanf("%lld %d %d %lld %lld", &X, &N, &M, &W, &T);
	for(int i = 1; i <= N; i++) {
		scanf("%lld", &s[i]);
	}
	s[++N] = X;
	for(int i = 1; i <= N; i++) {
		v.push_back(pii(s[i] % T, i));
	}  
	for(int i = 1; i <= M; i++) {
		scanf("%lld %lld", &d[i], &c[i]);
		v.push_back(pii(d[i], -i));
	}
	sort(v.begin(), v.end());

	long long ans = (X / T) + 1;
	for(int i = 1; i <= M; i++) {
		ans += 1 + ((X - d[i]) / T);
	}
	ans *= W;
	int sz = N + M;
	v.insert(v.begin(), pii(0, 0));


	for(int i = 1; i <= sz; i++) {
		if(v[i].second < 0) {
			int id = -v[i].second;
			p[i] = c[id] - W * (1 + ((X - d[id]) / T));
			cnt[i] = 1;
		}
		p[i] += p[i - 1];
		cnt[i] += cnt[i - 1];
	}

	dp[0] = 0;
	for(int i = 1; i <= sz; i++) {
		if(v[i].second < 0) {
			dp[i] = dp[i - 1];
		} else {
			long long var = W * (s[v[i].second] / T);
			long long cost = 0;
			for(int cur = i; cur >= 1; cur--) {
				long long m = -cnt[cur - 1];
				long long c = dp[cur - 1] - p[cur - 1];
				long long add = p[i] + var * cnt[i];
				dp[i] = min(dp[i], m * var + c + add);
			}
		}
	}
	ans += dp[sz];
	printf("%lld\n", ans);
	return 0;
}

Compilation message

coach.cpp: In function 'int main(int, const char**)':
coach.cpp:56:14: warning: unused variable 'cost' [-Wunused-variable]
    long long cost = 0;
              ^~~~
coach.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %d %d %lld %lld", &X, &N, &M, &W, &T);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
coach.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &s[i]);
   ~~~~~^~~~~~~~~~~~~~~
coach.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &d[i], &c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
0 / 29.0

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