CF1452 A. Robot Program

链接：https://codeforces.com/contest/1452/problem/A

There is an infinite 2-dimensional grid. The robot stands in cell (0,0) and wants to reach cell (x,y). Here is a list of possible commands the robot can execute:

move north from cell (i,j) to (i,j+1);
move east from cell (i,j) to (i+1,j);
move south from cell (i,j) to (i,j−1);
move west from cell (i,j) to (i−1,j);
stay in cell (i,j).
The robot wants to reach cell (x,y) in as few commands as possible. However, he can’t execute the same command two or more times in a row.

What is the minimum number of commands required to reach (x,y) from (0,0)?

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

Each of the next t lines contains two integers x and y (0≤x,y≤104) — the destination coordinates of the robot.

Output
For each testcase print a single integer — the minimum number of commands required for the robot to reach (x,y) from (0,0) if no command is allowed to be executed two or more times in a row.

Example
input
5
5 5
3 4
7 1
0 0
2 0
output
10
7
13
0
3
Note
The explanations for the example test:

We use characters N, E, S, W and 0 to denote going north, going east, going south, going west and staying in the current cell, respectively.

In the first test case, the robot can use the following sequence: NENENENENE.

In the second test case, the robot can use the following sequence: NENENEN.

In the third test case, the robot can use the following sequence: ESENENE0ENESE.

In the fourth test case, the robot doesn’t need to go anywhere at all.

In the fifth test case, the robot can use the following sequence: E0E.

题意
问(0,0)到(x,y)不能走连续的两步，问最少的步数？
简单思维，不难，拼手速。

思路
把问题可以转换为：假设x>y，(x,y) -> (x,x-1) 然后加上 x + x - 1

代码

#include <bits/stdc++.h>
typedef long long ll;

const ll mod =1e9 + 7;

using namespace std;
namespace fastIO {
    inline void input(int& res) {
        char c = getchar();res = 0;int f = 1;
        while (!isdigit(c)) { f ^= c == '-'; c = getchar(); }
        while (isdigit(c)) { res = (res << 3) + (res << 1) + (c ^ 48);c = getchar(); }
        res = f ? res : -res;
    }
    inline ll qpow(ll a, ll b) {
        ll ans = 1, base = a;
        while (b) {
            if (b & 1) ans = (ans * base % mod +mod )%mod;
            base = (base * base % mod + mod)%mod;
            b >>= 1;
        }
        return ans;
    }
}
using namespace fastIO;

const int N = 1e2+5;
int Case,x,y;

void solve(){
	input(x),input(y);
	if(y>x) swap(x,y);
	if(x-y>1)printf("%d\n",x+x-1);
	else printf("%d\n",x+y);
}

int main(){
	Case=1;
	input(Case);
	while(Case--){
		solve();
	}
	return 0;
}
/*
5
5 5
3 4
7 1
0 0
2 0
*/