oj.uz

답안 #550380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550380 2022-04-18T01:57:37 Z LucaDantas Long Distance Coach (JOI17_coach) C++17
100 / 100
 275 ms 11228 KB 
#include <bits/stdc++.h>
using namespace std;

struct Line {
	long long a, b;
	Line(long long _a, long long _b) : a(_a), b(_b) {}
	bool operator <(const Line& o) const { return a > o.a; }
	long long eval(long long x) const { return a*x + b; }
};

// queries are decreasing so we can always query the last value
struct CHT : multiset<Line> {
	bool hasNext(iterator it) { return next(it) != end(); }
	bool hasPrev(iterator it) { return it != begin(); }
	long double intersect(Line x, Line y) { return ((long double)(y.b-x.b)) / (x.a-y.a); }
	bool bad(Line a, Line b, Line c) { return intersect(a, c) <= intersect(a, b); }
	
	void add(Line l) {
		auto it = lower_bound(l);
		if(it != end() && it->a == l.a) {
			if(it->b < l.b) return;
			erase(it);
		}

		it = insert(l);
		
		if(hasNext(it) && hasPrev(it) && bad(*prev(it), *it, *next(it)))
			return (void)(erase(it));
		
		while(hasNext(it) && hasNext(next(it)) && bad(*it, *next(it), *next(next(it))))
			erase(next(it));

		while(hasPrev(it) && hasPrev(prev(it)) && bad(*prev(prev(it)), *prev(it), *it))
			erase(prev(it));
	}

	long long query(long long x) {
		if((size()) == 0) return 0x3f3f3f3f3f3f3f3f;

		// while(size() >= 2 && prev(end())->eval(x) >= prev( prev(end()) )->eval(x))
		while(size() >= 2 && intersect(*prev(end()), *prev(prev(end()))) >= x)
			erase(prev(end()));
		return prev(end())->eval(x);
	}
} cht;

constexpr int maxn = 2e5+10;

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;

	sort(refill+1, refill+1+N, [&](long long x1, long long x2) { return x1%T > x2%T; });

	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); };

	dp[M+1] = W * (X/T + 1);
	for(int i = M, j = 1; i >= 1; i--) {
		// cht
		// val[j] + pref[i-1] = {dp[nxt[j]] + pref[nxt[j]-1] + (refill[j]/T) * W * (r+1)} + l * {- (refill[j] / T) * W}

		for(; j <= N && refill[j] % T >= time_person[i]; j++)
			cht.add(Line(-1 * (refill[j] / T) * W, dp[nxt[j]] + kill_person[nxt[j]-1] + (refill[j]/T)*W*((nxt[j]-1)+1) ));

		// opção 1: fico vivo até o final
		// opção 2: uso alguem pra me matar
		dp[i] = min(dp[i+1] + W * qtd(time_person[i]), cht.query(i) - kill_person[i-1]);
	}

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

Compilation message

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

Subtask #1
16.0 / 16.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 308 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 308 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 2 ms 448 KB Output is correct
39 Correct 2 ms 448 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 496 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 448 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 512 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 189 ms 11092 KB Output is correct
53 Correct 215 ms 11112 KB Output is correct
54 Correct 195 ms 11156 KB Output is correct
55 Correct 207 ms 11096 KB Output is correct
56 Correct 193 ms 11048 KB Output is correct
57 Correct 200 ms 11096 KB Output is correct
58 Correct 186 ms 11116 KB Output is correct
59 Correct 200 ms 11212 KB Output is correct
60 Correct 194 ms 11160 KB Output is correct
61 Correct 193 ms 11136 KB Output is correct
62 Correct 200 ms 11084 KB Output is correct
63 Correct 187 ms 11224 KB Output is correct
64 Correct 127 ms 11064 KB Output is correct
65 Correct 275 ms 11128 KB Output is correct
66 Correct 262 ms 11092 KB Output is correct
67 Correct 265 ms 11064 KB Output is correct
68 Correct 252 ms 11172 KB Output is correct
69 Correct 207 ms 11036 KB Output is correct
70 Correct 176 ms 11108 KB Output is correct
71 Correct 191 ms 11108 KB Output is correct
72 Correct 192 ms 11176 KB Output is correct
73 Correct 188 ms 11164 KB Output is correct
74 Correct 202 ms 11080 KB Output is correct
75 Correct 193 ms 11228 KB Output is correct
76 Correct 199 ms 11048 KB Output is correct
77 Correct 170 ms 11056 KB Output is correct
78 Correct 177 ms 11176 KB Output is correct
79 Correct 187 ms 11120 KB Output is correct
80 Correct 173 ms 11052 KB Output is correct