CF1612C Chat Ban

最新推荐文章于 2024-09-14 22:25:23 发布

杨小猪猪

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量822

点赞数

分类专栏：二分文章标签：算法 c++ 数学

本文链接：https://blog.csdn.net/qq_45734837/article/details/121641191

版权

二分专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目链接

解法：肉眼可见的二分，分成两个区域二分

#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
ll k, x;
ll ans() {
	ll l = 1, r = k;
	while (l < r) {
		//cout << l << ' ' <<  r << endl;
		ll mid = (l + r +1) / 2;
		ll res = mid * (mid - 1) / 2;
		if (x> res)l=mid;
		else r = mid-1;
	}
	return r;
}
ll ans2() {
	ll l = 1, r = k;
	ll sum = k * (k - 1) / 2;
	while (l < r) {
		//cout << l << ' ' <<  r << endl;
		ll mid = (l + r +1) / 2;
		ll midd = k - mid + 1;
		ll res = sum - midd * (midd + 1) / 2;
		//cout << x << ' '<<res<<endl;
		if (x > res)l = mid;
		else r = mid - 1;
	}
	return r + k - 1;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t, n;
	cin >> t;
	while (t--) {
		cin >> k >> x;
		ll res1 = k * (k - 1) / 2;
		ll res2 = res1 + k;
		if (x <= res1)cout << ans() << endl;
		else if (x <= res2)cout << k << endl;
		else {
			//cout << "wait" << endl;
			x -= res2;
			cout << ans2() << endl;
		}
	}
	return 0;
}