AtCoder Beginner Contest 299——A-E题讲解

蒟蒻来讲题，还望大家喜。若哪有问题，大家尽可提！

Hello, 大家好哇！本初中生蒟蒻讲解一下AtCoder Beginner Contest 299这场比赛的A-E题！

===========================================================================================

A - Treasure Chest

原题

Problem Statement

You are given a string $S$ of length $N$ consisting of three kinds of characters: ., |, and .
$S$ contains exactly two | and exactly one .
Determine whether the is between the two |, and if so, print in; otherwise, print out.
More formally, determine whether one of the characters before the is | and one of the characters after the * is |.

Constraints

$3\le N\le 100$
$N$ is an integer.
$S$ is a string of length $N$ consisting of ., |, and .
$S$ contains exactly two |.
$S$ contains exactly one .

Input

The input is given from Standard Input in the following format:
$N$
$S$

Output

Print a single line containing in if the * is between the two |, and out otherwise.

Sample Input 1

10
.|..*...|.

Sample Output 1

in

Between the two |, we have |……|, which contains , so you should print in.

Sample Input 2

10
.|..|.*...

Sample Output 2

out

Between the two |, we have |…|, which does not contain *, so you should print out.

Sample Input 3

3
|*|

Sample Output 3

in

题目大意

给定一个字符串$S$，如果*在两个|之间，输出in，反之输出out

思路

可以依次枚举，枚举的同时记录出现|的次数，当出现*时，若|出现的次数为1，则输出in，反之输出out。

代码

#include <iostream>
#include <cstring>
#include <algorithm>
#define endl '\n'
#define psb(i) push_back(i)
#define ppb() pop_back()
#define psf(i) push_front(i)
#define ppf() pop_front()
#define ps(i) push(i)

using namespace std;

typedef pair<int, int> PII;

inline int read()
{
   
   
    int w = 1, s = 0;
    char c = getchar();
    while (c < '0' || c > '9')
    {
   
   
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
    
    return w * s;
}

int main()
{
   
   
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    
    int n;
    string s;
	
	cin >> n >> s;
	
	int shu = 0;
	for (auto c : s)
		if (c == '|') shu ++; //记录|出现的次数
		else if (c == '*') //出现了*
		{
   
   
			if (shu == 1) cout << "in" << endl; //说明在两个|之间
			else cout <<"out" << endl; //反之，就是外面
			return 0;
		}
    
    return 0;
}

B - Trick Taking

原题

Problem Statement

$N$ players with ID numbers $1,2,\dots ,N$ are playing a card game.

Each player plays one card.
Each card has two parameters: color and rank, both of which are represented by positive integers.

For $i=1,2,\dots ,N$, the card played by player $i$ has a color $C_i$ and a rank $R_i$.
All of $R_1,R_2,\dots ,R_N$ are different.
Among the $N$ players, one winner is decided as follows.

• If one or more cards with the color $T$ are played, the player who has played the card with the greatest rank among those cards is the winner.
• If no card with the color $T$ is played, the player who has played the card with the greatest rank among the cards with the color of the card played by player $1$ is the winner. (Note that player $1$ may win.)

Print the ID number of the winner.

Constraints

$2\le N\le 2\times 10^5$
$1\le T\le 10^9$
$1\le C_i\le 10^9$
$1\le R_i\le 10^9$
$i\ne j⟹R_i\ne R_j$
All values in the input are integers.

Input

The input is given from Standard Input in the following format:
$N$ $T$
$C_1$ $C_2$ $\dots$ $C_N$
$R_1$ $R_2$ $\dots$ $R_N$