Codeforces Round #624 (Div. 3)题解

写在前面：第一次打cf，只过了两题，C题做了一个半小时没做出来QAQ

A. Add Odd or Subtract Even

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given two positive integers a and b.
In one move, you can change a in the following way:
Choose any positive odd integer x (x>0) and replace a with a+x;
choose any positive even integer y (y>0) and replace a with a−y.
You can perform as many such operations as you want. You can choose the same numbers x and y in different moves.
Your task is to find the minimum number of moves required to obtain b from a. It is guaranteed that you can always obtain b from a.
You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤104) — the number of test cases.
Then t test cases follow. Each test case is given as two space-separated integers a and b (1≤a,b≤109).

Output

For each test case, print the answer — the minimum number of moves required to obtain b from a if you can perform any number of moves described in the problem statement. It is guaranteed that you can always obtain b from a.
Example

输入：

5
2 3
10 10
2 4
7 4
9 3

输出：

1
0
2
2
1

Note：

In the first test case, you can just add 1.
In the second test case, you don’t need to do anything.
In the third test case, you can add 1 two times.
In the fourth test case, you can subtract 4 and add 1.
In the fifth test case, you can just subtract 6.

水题：略，看代码吧

代码：

#include <bits/stdc++.h>
using namespace std; 
typedef long long ll;
int main() {
    int n,m;
    cin>>n;
    for(int i=0;i<n;i++){
        int a,b;
        int sum=0;
        cin>>a>>b;
        if(a==b){
            cout<<0<<endl;
            continue;
        }
        int ans=abs(a-b);
        if(a<b)
            if(ans%2)
                sum=1;
            else
           	sum=2;
  	else
            if(ans%2)
           	sum=2;
       	    else
           	sum=1;
    	cout<<sum<<endl;
    }
    return 0;
}

B. WeirdSort

题目：

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an array a of length n.
You are also given a set of distinct positions p1,p2,…,pm, where 1≤pi<n. The position pi means that you can swap elements a[pi] and a[pi+1]. You can apply this operation any number of times for each of the given positions.
Your task is to determine if it is possible to sort the initial array in non-decreasing order (a1≤a2≤⋯≤an) using only allowed swaps.
For example, if a=[3,2,1] and p=[1,2], then we can first swap elements a[2] and a[3] (because position 2 is contained in the given set p). We get the array a=[3,1,2]. Then we swap a[1] and a[2] (position 1 is also contained in p). We get the array a=[1,3,2]. Finally, we swap a[2] and a[3] again and get the array a=[1,2,3], sorted in non-decreasing order.
You can see that if a=[4,1,2,3] and p=[3,2] then you cannot sort the array.
You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤100) — the number of test cases.
Then t test cases follow. The first line of each test case contains two integers n and m (1≤m<n≤100) — the number of elements in a and the number of elements in p. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤100). The third line of the test case contains m integers p1,p2,…,pm (1≤pi<n, all pi are distinct) — the set of positions described in the problem statement.

Output

For each test case, print the answer — “YES” (without quotes) if you can sort the initial array in non-decreasing order (a1≤a2≤⋯≤an) using only allowed swaps. Otherwise, print “NO”.
Example

输入：

6
3 2
3 2 1
1 2
4 2
4 1 2 3
3 2
5 1
1 2 3 4 5
1
4 2
2 1 4 3
1 3
4 2
4 3 2 1
1 3
5 2
2 1 2 3 3
1 4

输出：

YES
NO
YES
YES
NO
YES

思路：

有点冒泡排序的味道，用一个数组标记可以交换的下标；然后冒泡排序一下，把可以交换的条件加上，最后检查一遍就可以了。

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[110],b[110];
int main() {
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
	int n,m;
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	cin>>n>>m;
	for(int j=1;j<=n;j++)
	    cin>>a[j];
	for(int j=1;j<=m;j++){
	    int x;
	    cin>>x; //输入一个数 
	    b[x]=1; //标记这个数，说明x，和x+1可以互换 
	}
	for(int q=1;q<=n;q++) //冒泡排序的思想 
	    for(int j=1;j<n;j++) 
	        if(a[j]>a[j+1])
	            if(b[j]) //如果j被标记了就可以交换 
	                swap(a[j],a[j+1]); //交换 
	int j;
	for(j=1;j<n;j++) //检查是否为非递减序列 
	    if(a[j]>a[j+1]){
	        cout<<"NO"<<endl; //不符合输出NO 
	        break;
	    }
	if(j==n)
	    cout<<"YES"<<endl; //符合输出YES 
	}
    return 0;
}

小弟有什么不足之处还请指教