Codeforces Round #739 (Div. 3) B. Who‘s Opposite?

最新推荐文章于 2024-11-10 21:43:58 发布

Evil_boy__

最新推荐文章于 2024-11-10 21:43:58 发布

阅读量174

点赞数

文章标签：算法动态规划 c++

本文链接：https://blog.csdn.net/m0_55682843/article/details/120658531

版权

该问题描述了一种圆圈排列情况，其中偶数人数围绕圆圈均匀站立，每个人看向对面的人。给定两个人的编号a和b，以及另一个人的编号c，任务是找出c正对面的人的编号。若不存在符合条件的圆圈，则输出-1。提供的代码通过计算圆圈的最大人数，并判断c是否在范围内来解决问题。对于每个测试用例，代码会根据条件输出c正对面的编号或-1。

摘要由CSDN通过智能技术生成

题目链接：Problem - B - Codeforces

Some number of people (this number is even) have stood in a circle. The people stand in the circle evenly. They are numbered clockwise starting from a person with the number 11. Each person is looking through the circle's center at the opposite person.

A sample of a circle of 66 persons. The orange arrows indicate who is looking at whom.

You don't know the exact number of people standing in the circle (but this number is even, no doubt). It is known that the person with the number aa is looking at the person with the number bb (and vice versa, of course). What is the number associated with a person being looked at by the person with the number cc? If, for the specified aa, bb, and cc, no such circle exists, output -1.

Input

The first line contains one integer tt (1≤t≤1041≤t≤104) — the number of test cases. Then tt test cases follow.

Each test case consists of one line containing three distinct integers aa, bb, cc (1≤a,b,c≤1081≤a,b,c≤108).

Output

For each test case output in a separate line a single integer dd — the number of the person being looked at by the person with the number cc in a circle such that the person with the number aa is looking at the person with the number bb. If there are multiple solutions, print any of them. Output −1−1 if there's no circle meeting the given conditions.

Example

input

Copy

output

Copy

8
-1
-1
-1
4
1
-1

Note

In the first test case, there's a desired circle of 88 people. The person with the number 66 will look at the person with the number 22 and the person with the number 88 will look at the person with the number 44.

In the second test case, there's no circle meeting the conditions. If the person with the number 22 is looking at the person with the number 33, the circle consists of 22 people because these persons are neighbors. But, in this case, they must have the numbers 11 and 22, but it doesn't meet the problem's conditions.

In the third test case, the only circle with the persons with the numbers 22 and 44 looking at each other consists of 44 people. Therefore, the person with the number 1010 doesn't occur in the circle.

思路：可以根据a， b来确定这个圆的最大数量，如果a， b， c的值小于最大数量就输出-1，然后根据最大数量来确定1所看的值，然后比较c和中间值来确定

#include<bits/stdc++.h>
using namespace std;


int main(){
	int t;
	cin >> t;
	int a, b, c;
	while(t--){
		cin >> a >> b >> c;
		if(a > b){
			swap(a, b);
		}
		int num = b - (a - 1);
		num = (num - 1) * 2;
		if(c > num || a > num || b > num){
			cout << "-1" << endl;
			continue;
		} 
		num = num / 2 + 1;
		if(c > num){
			cout << num - (num - 1 - (c - num)) << endl;
		}else if(c == num){
			cout << 1 << endl;
		}else{
			cout << num + (c - 1) << endl;
		}
		
	}
	return 0;
}