AtCoder Beginner Contest 265 题解 (A~D)

A - Apple

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : $100$ points

Problem Statement

A fruit store sells apples.
You may perform the following operations as many times as you want in any order:

• Buy one apple for $X$ yen (the currency in Japan).
• Buy three apples for $Y$ yen.

How much yen do you need to pay to obtain exactly $N$ apples?

Constraints

• $1\le X\le Y\le 100$

• $1\le N\le 100$

• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$X$ $Y$ $N$

Output

Print the answer as an integer.

题面翻译

你需要买$n$个苹果，有两种购买方式：

• 一个苹果$x$元;
• 三个苹果$y$元。

求最少需要多少元。

Sample Input 1

10 25 10

Sample Output 1

85

Buy three apples for $25$ yen three times and one apple for $10$ yen, and you will obtain exactly $10$ apples for a total of $85$ yen.

You cannot obtain exactly $10$ apples for a lower cost, so the answer is $85$ yen.

Sample Input 2

10 40 10

Sample Output 2

100

It is optimal to buy an apple for $10$ yen $10$ times.

Sample Input 3

100 100 2

Sample Output 3

200

The only way to obtain exactly $2$ apples is to buy an apple for $100$ yen twice.

Sample Input 4

100 100 100

Sample Output 4

3400

题解部分

分情况讨论：

若$3x\le y$，即单个买更优，就输出单个买的情况：$nx$;

否则，三个买更优，则先三个地买，剩余的苹果单个买：$\frac{ny}{3}+(n\mathrm{mod}3)\times x$

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

int x, y, n;

int main () {
   
	scanf ("%d %d %d", &x, &y, &n);
	if (x * 3 <= y) {
   
		printf ("%d", x * n);
	} else {
   
		printf ("%d", n / 3 * y + (n % 3) * x);
	}
	return 0;
}

B - Explore

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : $200$ points

Problem Statement

Takahashi is exploring a cave in a video game.

The cave consists of $N$ rooms arranged in a row. The rooms are numbered Room $1,2,\dots ,N$ from the entrance.

Takahashi is initially in Room $1$, and the time limit is $T$.
For each $1\le i\le N-1$, he may consume a time of $A_i$ to move from Room $i$ to Room $(i+1)$. There is no other way to move between rooms. He cannot make a move that makes the time limit $0$ or less.

There are $M$ bonus rooms in the cave. The $i$-th bonus room is Room $X_i$ ; when he arrives at the room, the time limit increases by $Y_i$.

Can Takahashi reach Room $N$?

Constraints

• $2\le N\le 10^5$

• $0\le M\le N-2$

• $1\le T\le 10^9$

• $1\le A_i\le 10^9$

• $1<X_1<\dots <X_M<N$

• $1\le Y_i\le 10^9$

All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $M$ $T$
$A_1$ $A_2$ $\dots$