| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 106373 | jwvg0425 | 코알라 (JOI13_koala) | C++17 | 2044 ms | 4320 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include <iterator>
#include <chrono>
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
i64 table[100005];
i64 d, a;
i64 b[100005];
i64 pos[100005];
bool memoed[100005];
i64 solve(int idx)
{
	if (idx == 0)
		return 0;
	if (memoed[idx])
		return table[idx];
	memoed[idx] = true;
	auto& res = table[idx];
	res = b[idx] - (pos[idx]  - pos[0] + d - 1) / d * a;
	for (int i = 1; i < idx; i++)
		res = max(res, solve(i) + b[idx] - (pos[idx] - pos[i] + d - 1) / d * a);
	return res;
}
int main()
{
	i64 k, m, n;
	scanf("%lld %lld %lld %lld %lld", &k, &m, &d, &a, &n);
	pos[0] = k;
	pos[n + 1] = m;
	for (int i = 1; i <= n; i++)
		scanf("%lld %lld", &pos[i], &b[i]);
	printf("%lld\n", solve(n + 1));
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
