답안 #550366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550366	2022-04-17T23:51:49 Z	LucaDantas	Long Distance Coach (JOI17_coach)	C++17	71 / 100	46 ms	596 KB

coach

#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 2010;

int nxt[maxn]; // next living guy after a water refill

long long X, N, M, W, T;

long long refill[maxn], time_person[maxn], kill_person[maxn], dp[maxn];

int main() {
	scanf("%lld %lld %lld %lld %lld", &X, &N, &M, &W, &T);
	for(int i = 1; i <= N; i++)
		scanf("%lld", &refill[i]);
	refill[++N] = X;

	for(int i = 1; i <= M; i++)
		scanf("%lld %lld", &time_person[i], &kill_person[i]);

	vector<pair<long long, long long>> tempos; // o tempo T é o fim
	for(int i = 1; i <= M; i++)
		tempos.push_back({time_person[i], kill_person[i]});
	sort(tempos.begin(), tempos.end());
	for(int i = 0; i < M; i++)
		time_person[i+1] = tempos[i].first, kill_person[i+1] = tempos[i].second;
	time_person[M+1] = T; // setto o valor do piloto

	for(int i = 1; i <= N; i++)
		nxt[i] = lower_bound(time_person+1, time_person+1+M, refill[i] % T) - time_person; // ID do proximo cara vivo dps de mim

	for(int i = 2; i <= M; i++)
		kill_person[i] += kill_person[i-1];

	auto qtd = [&](long long tempo) { return X / T + (tempo < X%T); };

	auto itv_kill = [&](int l, int r) { return kill_person[r] - kill_person[l-1]; };

	auto cost = [&](int l, int r, long long tempo) { return itv_kill(l, r) + (tempo / T) * W * (r-l+1); };

	dp[M+1] = W * (X/T + 1);
	for(int i = M; i >= 1; i--) {
		long long aq = 0x3f3f3f3f3f3f3f3f;

		// opção 1: uso alguem pra me matar
		for(int j = 1; j <= N; j++) {
			if(refill[j] % T < time_person[i]) continue;
			aq = min(aq, dp[nxt[j]] + cost(i, nxt[j]-1, refill[j]));
		}

		// opção 2: fico vivo até o final
		aq = min(aq, dp[i+1] + W * qtd(time_person[i]));

		dp[i] = aq;
	}

	printf("%lld\n", dp[1]);
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%lld %lld %lld %lld %lld", &X, &N, &M, &W, &T);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
coach.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |   scanf("%lld", &refill[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~
coach.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   scanf("%lld %lld", &time_person[i], &kill_person[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	0 ms	304 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	308 KB	Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	0 ms	304 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	308 KB	Output is correct
23	Correct	1 ms	308 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	308 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	304 KB	Output is correct
31	Correct	1 ms	304 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	304 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	304 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	308 KB	Output is correct
38	Correct	34 ms	368 KB	Output is correct
39	Correct	28 ms	340 KB	Output is correct
40	Correct	39 ms	484 KB	Output is correct
41	Correct	31 ms	340 KB	Output is correct
42	Correct	31 ms	444 KB	Output is correct
43	Correct	23 ms	340 KB	Output is correct
44	Correct	46 ms	476 KB	Output is correct
45	Correct	34 ms	448 KB	Output is correct
46	Correct	28 ms	468 KB	Output is correct
47	Correct	29 ms	468 KB	Output is correct
48	Correct	40 ms	480 KB	Output is correct
49	Correct	34 ms	460 KB	Output is correct
50	Correct	33 ms	468 KB	Output is correct
51	Correct	33 ms	444 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	0 ms	304 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	308 KB	Output is correct
23	Correct	1 ms	308 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	308 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	304 KB	Output is correct
31	Correct	1 ms	304 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	304 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	304 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	308 KB	Output is correct
38	Correct	34 ms	368 KB	Output is correct
39	Correct	28 ms	340 KB	Output is correct
40	Correct	39 ms	484 KB	Output is correct
41	Correct	31 ms	340 KB	Output is correct
42	Correct	31 ms	444 KB	Output is correct
43	Correct	23 ms	340 KB	Output is correct
44	Correct	46 ms	476 KB	Output is correct
45	Correct	34 ms	448 KB	Output is correct
46	Correct	28 ms	468 KB	Output is correct
47	Correct	29 ms	468 KB	Output is correct
48	Correct	40 ms	480 KB	Output is correct
49	Correct	34 ms	460 KB	Output is correct
50	Correct	33 ms	468 KB	Output is correct
51	Correct	33 ms	444 KB	Output is correct
52	Runtime error	2 ms	596 KB	Execution killed with signal 11
53	Halted	0 ms	0 KB	-

답안 #550366

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