Educational Codeforces Round 117 (Rated for Div. 2)C. Chat Ban

最新推荐文章于 2024-10-01 05:07:35 发布

Buyc

最新推荐文章于 2024-10-01 05:07:35 发布

阅读量649

点赞数 1

分类专栏： CF题解

本文链接：https://blog.csdn.net/linglingnana/article/details/121482824

版权

c++ 算法

CF题解专栏收录该内容

18 篇文章 1 订阅

订阅专栏

You are a usual chat user on the most famous streaming platform. Of course, there are some moments when you just want to chill and spam something.

More precisely, you want to spam the emote triangle of size k. It consists of 2k−1 messages. The first message consists of one emote, the second one — of two emotes, …, the k-th one — of k emotes, the k+1-th one — of k−1 emotes, …, and the last one — of one emote.

For example, the emote triangle for k=3 consists of 5 messages:
在这里插入图片描述

Of course, most of the channels have auto moderation. Auto moderator of the current chat will ban you right after you spam at least x emotes in succession (you can assume you are the only user in the chat). Now you are interested — how many messages will you write before getting banned? Or maybe you will not get banned at all (i.e. will write all 2k−1 messages and complete your emote triangle successfully)? Note that if you get banned as a result of writing a message, this message is also counted.

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. The next t lines describe test cases.

The only line of the test case contains integers k and x (1≤k≤109;1≤x≤1018).

Output
For each test case, print the number of messages you will write before getting banned for the corresponding values k and x.
二分查找
首先根据等差数列前n项和，求最多能发几条短信，然后利用二分找信息数

#include <bits/stdc++.h>
#define ll long long
//dfs 大法师
using namespace std;
const int mod=20100403;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
ll k,x;
ll s(ll xx)
{
    if(xx<=k)return xx*(xx+1)/2;
    else return k*(k+1)/2+(xx-k)*(2*k-(xx-k)-1)/2;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        cin>>k>>x;
        ll l=1,r=2*k-1;
        while(l<r)
        {
            ll mid=(l+r)/2;
            if(s(mid)<x)
            {
                l=mid+1;
            }
            else r=mid;
        }
        cout<<r<<endl;

    }
    return 0;
}