Educational Codeforces Round 89 (Rated for Div. 2)

A---------------Shovels and Swords

Polycarp plays a well-known computer game (we won’t mention its name). In this game, he can craft tools of two types — shovels and swords. To craft a shovel, Polycarp spends two sticks and one diamond; to craft a sword, Polycarp spends two diamonds and one stick.

Each tool can be sold for exactly one emerald. How many emeralds can Polycarp earn, if he has a sticks and b diamonds?

Input
The first line contains one integer t (1≤t≤1000) — the number of test cases.

The only line of each test case contains two integers a and b (0≤a,b≤109) — the number of sticks and the number of diamonds, respectively.

Output
For each test case print one integer — the maximum number of emeralds Polycarp can earn.

Example
input
4
4 4
1000000000 0
7 15
8 7
output
2
0
7
5
Note
In the first test case Polycarp can earn two emeralds as follows: craft one sword and one shovel.

In the second test case Polycarp does not have any diamonds, so he cannot craft anything.
题意：给你一定数量的a，b。两个a+1个b或者1个a+2个b 都可以合成一个宝石，问你 最多合成多少个宝石
思路：https://blog.csdn.net/jziwjxjd/article/details/106700986

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<iomanip>
#include<vector>
#include<fstream>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
int main()
{
	int t; cin >> t;
	while (t--)
	{
		ll a, b; cin >> a >> b;
		ll x = max(a, b);
		ll y = min(a, b);
			if (x < y * 2)
			{
				cout << (x+y)/3<< endl;
			}
			else
			{
				cout << y << endl;
			}
	}
}

B-----Shuffle

You are given an array consisting of n integers a1, a2, …, an. Initially ax=1, all other elements are equal to 0.

You have to perform m operations. During the i-th operation, you choose two indices c and d such that li≤c,d≤ri, and swap ac and ad.

Calculate the number of indices k such that it is possible to choose the operations so that ak=1 in the end.

Input
The first line contains a single integer t (1≤t≤100) — the number of test cases. Then the description of t testcases follow.

The first line of each test case contains three integers n, x and m (1≤n≤109; 1≤m≤100; 1≤x≤n).

Each of next m lines contains the descriptions of the operations; the i-th line contains two integers li and ri (1≤li≤ri≤n).

Output
For each test case print one integer — the number of indices k such that it is possible to choose the operations so that ak=1 in the end.

Example
inputCopy
3
6 4 3
1 6
2 3
5 5
4 1 2
2 4
1 2
3 3 2
2 3
1 2
outputCopy
6
2
3
Note
In the first test case, it is possible to achieve ak=1 for every k. To do so, you may use the following operations:

swap ak and a4;
swap a2 and a2;
swap a5 and a5.
In the second test case, only k=1 and k=2 are possible answers. To achieve a1=1, you have to swap a1 and a1 during the second operation. To achieve a2=1, you have to swap a1 and a2 during the second operation.
思路：区间思想就行了啊，先确定最原始的一个区间，然后每次都去判断，如果新的区间跟你的区间有交集，那么你的区间大小就要变了

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<iomanip>
#include<vector>
#include<fstream>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n, x, m;
		cin >> n >> x >> m;
		int s = 0;
		int p = 0;
		int z=0, y=0;
		for (int i = 1; i <= m; i++)
		{
			int l, r; cin >> l >> r;
			if (x <= r && x >= l && p != 1)
			{
				s += r - l + 1;
				p = 1;
				z = l; y = r;

			}
			else if (p == 1)
			{
				if (r<z || l>y)
					continue;
				else
				{
					y = max(y, r);
					z = min(z, l);
				}
				
			}

		}
		if (z == 0 && y == 0)
		{
			cout << 1 << endl;
		}
		else
		{
			cout << y - z + 1 << endl;
		}
	}
}

C. Palindromic Paths

You are given a matrix with n rows (numbered from 1 to n) and m columns (numbered from 1 to m). A number ai,j is written in the cell belonging to the i-th row and the j-th column, each number is either 0 or 1.

A chip is initially in the cell (1,1), and it will be moved to the cell (n,m). During each move, it either moves to the next cell in the current row, or in the current column (if the current cell is (x,y), then after the move it can be either (x+1,y) or (x,y+1)). The chip cannot leave the matrix.

Consider each path of the chip from (1,1) to (n,m). A path is called palindromic if the number in the first cell is equal to the number in the last cell, the number in the second cell is equal to the number in the second-to-last cell, and so on.

Your goal is to change the values in the minimum number of cells so that every path is palindromic.

Input
The first line contains one integer t (1≤t≤200) — the number of test cases.

The first line of each test case contains two integers n and m (2≤n,m≤30) — the dimensions of the matrix.

Then n lines follow, the i-th line contains m integers ai,1, ai,2, …, ai,m (0≤ai,j≤1).

Output
For each test case, print one integer — the minimum number of cells you have to change so that every path in the matrix is palindromic.

Example
input
4
2 2
1 1
0 1
2 3
1 1 0
1 0 0
3 7
1 0 1 1 1 1 1
0 0 0 0 0 0 0
1 1 1 1 1 0 1
3 5
1 0 1 0 0
1 1 1 1 0
0 0 1 0 0
output
0
3
4
4
题意：给你矩阵 由0 1 组成，现在 从起点开始
移动每次移动只能向右或者向下，然后你移动到这里可以修改这里的值 ，你想办法修改尽可能少的数。从而达到回文矩阵

就像我的图中标的 只要斜线上的数字一样就行啦
点(i,j)是由(1,1)走i+j−2步到达的
思路：用b数组来计算b[步数][a[i][j]的值] ++；这样就可以判断 到底是修改1还是0；

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<iomanip>
#include<vector>
#include<fstream>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
int a[100][100];
int b[200][200];
int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		for(int i=1;i<=n;i++)
			for (int j = 1; j <= m; j++)
			{
				cin >> a[i][j];
				int num = i + j - 2;
				b[num][a[i][j]]++;
			}
		int s = 0;
		for (int i = 0, j = n - m + 2; j > i; i++, j--)
		{
			s += min(b[i][0] + b[j][0], b[i][1] + b[j][1]);
		}
		cout << s << endl;
	}
}