QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#125397 | #6744. Square | lengli | AC ✓ | 41ms | 3568kb | C++14 | 891b | 2023-07-16 17:18:03 | 2023-07-16 17:18:06 |
Judging History
answer
#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
#define int long long
using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
const int N=100010;
int x,y;
PII get(int x){
int l=0,r=2e9;
while(l<r){
int mid=(l+r+1)/2;
if(mid*(mid+1)/2>=x) r=mid-1;
else l=mid;
}
return {l+1,x-(l+1)*l/2};
}
void solve(){
cin>>x>>y;
if(x>=y){
cout<<x-y<<endl;
return;
}
PII l=get(x),r=get(y);
int res=0;
int dl=l.first-l.second;
int dr=r.first-r.second;
if(dl>dr){
res+=l.first-dl+dr;
l.first--;
res+=r.first-l.first;
}else{
if(l.first<=dr){
res+=dr-l.first;
l.first=dr;
}
res+=dr-dl;
res+=r.first-l.first;
}
cout<<res<<endl;
}
signed main(){
fastio;
int T;
cin>>T;
while(T--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
input:
2 5 1 1 5
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: 0
Accepted
time: 41ms
memory: 3568kb
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