AtCoder Beginner Contest 369（ABCDEFG题）视频讲解

A - 369

Problem Statement

You are given two integers $A$ and $B$.
How many integers $x$ satisfy the following condition?
Condition: It is possible to arrange the three integers $A$, $B$, and $x$ in some order to form an arithmetic sequence.
A sequence of three integers $p$, $q$, and $r$ in this order is an arithmetic sequence if and only if $q-p$ is equal to $r-q$.

Constraints

$1\le A,B\le 100$
All input values are integers.

Input

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

$A$ $B$

Output

Print the number of integers $x$ that satisfy the condition in the problem statement.
It can be proved that the answer is finite.

Sample Input 1

5 7

Sample Output 1

3

The integers $x=3,6,9$ all satisfy the condition as follows:
When $x=3$, for example, arranging $x,A,B$ forms the arithmetic sequence $3,5,7$.
When $x=6$, for example, arranging $B,x,A$ forms the arithmetic sequence $7,6,5$.
When $x=9$, for example, arranging $A,B,x$ forms the arithmetic sequence $5,7,9$.
Conversely, there are no other values of $x$ that satisfy the condition.
Therefore, the answer is $3$.

Sample Input 2

6 1

Sample Output 2

2

Only $x=-4$ and $11$ satisfy the condition.

Sample Input 3

3 3

Sample Output 3

1

Only $x=3$ satisfies the condition.

Solution

具体见文末视频。

---

Code

#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

signed main() {
   
   
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);

	int a, b;
	cin >> a >> b;
	if (a > b) swap(a, b);

	set<int> S;
	if ((a + b) % 2 == 0) S.insert(a + b >> 1);
	S.insert(b + b - a), S.insert(a - (b - a));

	cout << S.size() << endl;

	return 0;
}

B - Piano 3

Problem Statement

Takahashi has a piano with $100$ keys arranged in a row.
The $i$-th key from the left is called key $i$.
He will play music by pressing $N$ keys one by one.
For the $i$-th press, he will press key $A_i$, using his left hand if $S_i=$ L, and his right hand if $S_i=$ R.
Before starting to play, he can place both of his hands on any keys he likes, and his fatigue level at this point is 0.
During the performance, if he moves one hand from key $x$ to key $y$, the fatigue level increases by $|y-x|$ (conversely, the fatigue level does not increase for any reason other than moving hands).
To press a certain key with a hand, that hand must be placed on that key.
Find the minimum possible fatigue level at the end of the performance.

Constraints

$1\le N\le 100$
$1\le A_i\le 100$
$N$ and $A_i$ are integers.
$S_i$ is L or R.

Input

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

$N$
$A_1$ $S_1$
$A_2$ $S_2$
$⋮$
$A_N$ $S_N$

Output

Print the minimum fatigue level at the end of the performance.

Sample Input 1

4
3 L
6 R
9 L
1 R

Sample Output 1

11

For example, the performance can be done as follows:
Initially, place the left hand on key $3$ and the right hand on key $6$.
Press key $3$ with the left hand.
Press key $6$ with the right hand.
Move the left hand from key $3$ to key $9$. The fatigue level increases by $|9-3|=6$.
Move the right hand from key $6$ to key $1$. The fatigue level increases by $|1-6|=5$.
Press key $9$ with the left hand.
Press key $1$ with the right hand.
In this case, the fatigue level at the end of the performance is $6+5=11$, which is the minimum possible.

Sample Input 2

3
2 L
2 L
100 L

Sample Output 2

98

Sample Input 3

8
22 L
75 L
26 R
45 R
72 R
81 R
47 L
29 R

Sample Output 3

188

Solution

具体见文末视频。

Code

#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

signed main() {
   
   
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);

	int n;
	cin >> n;

	std::vector<int> a(n);
	std::vector<char> s(n);
	for (int i = 0; i < n; i ++)
		cin >> a[i] >> s[i];

	int res = 1e18;
	for (int i = 1; i <= 100; i ++)
		for (int j = 1; j <= 100; j ++) {
   
   
			int lo = i, ro = j, ans = 0;
			for (int k = 0; k < n; k ++) {
   
   
				if (s[k] == 'L') ans += abs(a[k] - lo), lo = a[k];
				else ans += abs(a[k] - ro), ro = a[k];
			}
			res = min(res, ans);
		}

	cout << res << endl;

	return 0;
}

C - Count Arithmetic Subarrays

Problem Statement

You are given a sequence of $N$ positive integers $A=(A_1,A_2,\dots ,A_N)$.
Find the number of pairs of integers $(l,r)$ satisfying $1\le l\le r\le N$ such that the subsequence $(A_l,A_{l+1},\dots ,A_r)$ forms an arithmetic progression.
A sequence $(x_1,x_2,\dots ,x$