Direction Change

题目

Codeforces Round #783 (Div. 2)

题解

#include<iostream>
#include<algorithm>
using namespace std;
long long solve(long long n,long long m){
    long long ans = min(m,n),dx = abs(m-n);
    ans = 2*(ans-1);

    if(dx%2) 
		ans += (dx/2)*4+1;
    else 
		ans += (dx/2)*4;

    return ans;
}
int main(){
    int t; cin >> t;
	while(t--){
        long long n,m; cin >> n >> m;//n行 m列
        if(n>2 && m==1) cout << -1 << endl;
        else if(n==1 && m>2) cout << -1 << endl;
        else if(m==n) cout << 2*(m-1) << endl;
        else if(m!=n) cout << solve(n,m) << endl;
    }
    return 0;
}