[Codeforces Round #635 (div2)]1337

1337A - Ichihime and Triangle[思维]
1337B - Kana and Dragon Quest game[思维]
1337C - Linova and Kingdom[$dfs$][贪心]
1337D - Xenia and Colorful Gems[二分][枚举]
1337E - Kaavi and Magic Spell[$dp$]
1337F - Yui and Mahjong Set[ ]

---

---

吐个槽
果然这一场是雀魂场把
每题都带个表情包

---

---

目录

1337A - Ichihime and Triangle[思维]

time limit per test	memory limit per test	input	output
1 seconds	256 megabytes	standard input	standard output

Description:

Ichihime is the current priestess of the Mahjong Soul Temple. She claims to be human, despite her cat ears.

These days the temple is holding a math contest. Usually, Ichihime lacks interest in these things, but this time the prize for the winner is her favorite — cookies. Ichihime decides to attend the contest. Now she is solving the following problem.

You are given four positive integers $a,b,c,d$, such that
$a\le b\le c\le d$.

Your task is to find three integers $x,y,z$, satisfying the following conditions:
$$\begin{gathered} a\le x\le b. \\ b\le y\le c. \\ c\le z\le d \end{gathered}$$.
There exists a triangle with a positive non-zero area and the lengths of its three sides are $x,y,$ and $z$.

Ichihime desires to get the cookie, but the problem seems too hard for her. Can you help her?

Input

The first line contains a single integer $t(1\le t\le 1000)$ — the number of test cases.

The next t lines describe test cases. Each test case is given as four space-separated integers $a,b,c,d(1\le a\le b\le c\le d\le 10^9)$.

Output

For each test case, print three integers $x,y,z$ — the integers you found satisfying the conditions given in the statement.

It is guaranteed that the answer always exists. If there are multiple answers, print any.

Example input

4
1 3 5 7
1 5 5 7
100000 200000 300000 400000
1 1 977539810 977539810

Example output

3 4 5
5 5 5
182690 214748 300999
1 977539810 977539810

Hit

One of the possible solutions to the first test case:

One of the possible solutions to the second test case:

分析：

题意：
求 $x,y,z$，这三个数满足
$$\begin{gathered} a\le x\le b. \\ b\le y\le c. \\ c\le z\le d \end{gathered}$$
且可以组成三角形
做法：
显然只要两条边相等就可以了
$y=z=c,a\le x\le b$即可

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e5 + 5;

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        int a, b, c, d;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        printf("%d %d %d\n", a, c, c);
    }
    return 0;
}

---

---

目录

1337B - Kana and Dragon Quest game[思维]

time limit per test	memory limit per test	input	output
1 seconds	256 megabytes	standard input	standard output

Description:

Kana was just an ordinary high school girl before a talent scout discovered her. Then, she became an idol. But different from the stereotype, she is also a gameholic.

One day Kana gets interested in a new adventure game called Dragon Quest. In this game, her quest is to beat a dragon.
The dragon has a hit point of x initially. When its hit point goes to 0 or under 0, it will be defeated. In order to defeat the dragon, Kana can cast the two following types of spells.

a. $Void$ $Absorption$
Assume that the dragon’s current hit point is h, after casting this spell its hit point will become $\lfloor h2\rfloor +10$. Here $\lfloor h2\rfloor$ denotes $h$ divided by two, rounded down.
b. $Lightning$ $Strike$
This spell will decrease the dragon’s hit point by $10$. Assume that the dragon’s current hit point is h, after casting this spell its hit point will be lowered to $h-10$.

Due to some reasons Kana can only cast no more than $n$ $Void$ $Absorptions$ and $m$ $Lightning$ $Strikes$. She can cast the spells in any order and doesn’t have to cast all the spells. Kana isn’t good at math, so you are going to help her to find out whether it is possible to defeat the dragon.

Input

The first line contains a single integer $t(1\le t\le 1000)$ — the number of test cases.

The next $t$ lines describe test cases. For each test case the only line contains three integers $x,n,m(1\le x\le 10^5,0\le n,m\le 30)$ — the dragon’s intitial hit point, the maximum number of Void Absorptions and Lightning Strikes Kana can cast respectively.

Output

If it is possible to defeat the dragon, print “YES” (without quotes). Otherwise, print “NO” (without quotes).

You can print each letter in any case (upper or lower).

Example input

7
100 3 4
189 3 4
64 2 3
63 2 3
30 27 7
10 9 1
69117 21 2

Example output

YES
NO
NO
YES
YES
YES
YES

Hit

One possible casting sequence of the first test case is shown below:
$Void$ $Absorption$   $\lfloor \frac{100}{2}\rfloor +10=60$.
$Lightning$ $Strike$   $60-10=50$.
$Void$ $Absorption$   $\lfloor \frac{50}{2}\rfloor +10=35$.
$Void$ $Absorption$   $\lfloor \frac{35}{2}\rfloor +10=27$.
$Lightning$ $Strike$   $27-10=17$.
$Lightning$ $Strike$   $17-10=7$.
$Lightning$ $Strike$   $7-10=-3$.

分析：
题意：
怪物血量为 $x$，问是否能使怪物的血量变为 $x\le 0$
有两种操作，
第一种可以使 $x=\lfloor \frac{x}{2}\rfloor +10$
第二种可以使 $x=x-10$
其中 $\lfloor x\rfloor$ 表示向下取整

做法：
只要判断 $\lfloor \frac{x}{2}\rfloor +10\le x-10$ 是否成立，且 $n!=0$
这种情况下就可以使用第一种
否则如果 $m!=0$，使用第二种

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e5 + 5;

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        int x, n, m, ans;
        scanf("%d%d%d", &x, &n, &m);
        while(x > 0 && (m || n)) {
            int ans = x / 2 + 10;
            if(n > 0 && ans < x) 
                x = ans, n -= 1;
            else if(m > 0)
                x = x - 10, m -= 1;
            else 
                break;
        }
        if(x > 0)   puts("NO");
        else        puts("YES");
    }
    return 0;
}

---

---

目录

哇这题我是真的没看懂
查了一下发现题解也很长
有空的时候在来看看
题解传送门 [codeforces 1337F] Yui and Mahjong Set 公式推导+交互式程序的测试