QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#410445 | #6744. Square | Liberty12619 | AC ✓ | 22ms | 3792kb | C++20 | 855b | 2024-05-14 00:28:37 | 2024-05-14 00:28:37 |
Judging History
answer
#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int,int> PII;
const int N = 1e6+10,mod = 998244353,INF=1e12;
void solve()
{
int x,y;
cin>>x>>y;
if(x>=y)
{
cout<<x-y<<"\n";
return;
}
int tx = sqrt(2*x)+0.5,ty = sqrt(2*y)+0.5;
int ans = ty-tx;
int rx = (1+tx)*tx/2-x,ry=(1+ty)*ty/2-y;
if(rx<=ry) ans+=ry-rx;
else ans+=tx-rx+ry+1;
cout<<ans<<"\n";
}
signed main()
{
int T=1;
cin.tie(0)->sync_with_stdio(false);
cin>>T;
while(T--)
{
solve();
}
// for(int x=1;x<=20;x++)
// for(int y=1;y<=20;y++)
// {
// cout<<x<<" "<<y<<" ";
// solve(x,y);
// }
return 0;
}
/*
7
5 1
1 5
1 2
1 3
1 4
1 6
1 7
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 22ms
memory: 3708kb
input:
100000 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 ...
output:
0 2 1 4 3 2 6 5 4 3 8 7 6 5 4 10 9 8 7 6 5 12 11 10 9 8 7 6 14 13 12 11 10 9 8 7 16 15 14 13 12 11 10 9 8 18 17 16 15 14 13 12 11 10 9 20 19 18 17 16 15 14 13 12 11 10 22 21 20 19 18 17 16 15 14 13 12 11 24 23 22 21 20 19 18 17 16 15 14 13 12 26 25 24 23 22 21 20 19 18 1 0 2 2 1 3 4 3 2 4 6 5 4 3 5 ...
result:
ok 100000 numbers