oj.uz

답안 #927593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927593 2024-02-15T06:53:17 Z IBory 코알라 (JOI13_koala) C++17
30 / 100
 2000 ms 6108 KB 
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int MAX = 100007;
ll P[MAX], B[MAX], dp[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	ll SP, EP, D, A, N;
	cin >> SP >> EP >> D >> A >> N;
	for (int i = 1; i <= N; ++i) cin >> P[i] >> B[i];
	P[0] = SP, P[N + 1] = EP;

	map<ll, ll> pv;
	memset(dp, 0xf3, sizeof(dp));
	pv[P[0] % D] = 0; dp[0] = 0;

	for (int i = 1; i <= N + 1; ++i) {
		for (auto [_, p] : pv) dp[i] = max(dp[i], dp[p] - (P[i] - P[p] + D - 1) / D * A);
		dp[i] += B[i];
		pv[P[i] % D] = i;
	}

	cout << dp[N + 1] << '\n';
	return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2528 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2524 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Incorrect 1 ms 2652 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 4720 KB Output is correct
2 Correct 66 ms 4436 KB Output is correct
3 Correct 11 ms 3676 KB Output is correct
4 Correct 48 ms 4696 KB Output is correct
5 Correct 27 ms 3768 KB Output is correct
6 Correct 17 ms 3160 KB Output is correct
7 Correct 13 ms 3536 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 6108 KB Time limit exceeded
2 Halted 0 ms 0 KB -