QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#579890 | #9381. 502 Bad Gateway | Qingyu | AC ✓ | 480ms | 3640kb | C++ | 1.4kb | 2024-09-21 18:58:29 | 2024-09-24 14:55:42 |
This submission is the standard solution.
Judging History
answer
#include <bits/stdc++.h>
typedef long long int64;
struct frac{
int64 x,y;
frac():x(0),y(1){}
frac(int64 n):x(n),y(1){}
frac(int64 _x,int64 _y){
if (!_y)
assert(0);
if (!_x){
x=0;y=1;
}else{
bool neg=0;
if ((_x<0)!=(_y<0)) neg=1;
if (_x<0) _x=-_x;
if (_y<0) _y=-_y;
int64 _g=std::gcd(_x,_y);
x=_x/_g;
y=_y/_g;
if (neg) x=-x;
}
}
friend frac operator+(const frac &a,const frac &b){
return frac(a.x*b.y+b.x*a.y,a.y*b.y);
}
friend frac operator-(const frac &a,const frac &b){
return frac(a.x*b.y-b.x*a.y,a.y*b.y);
}
friend frac operator*(const frac &a,const frac &b){
return frac(a.x*b.x,a.y*b.y);
}
friend frac operator/(const frac &a,const frac &b){
return frac(a.x*b.y,a.y*b.x);
}
friend bool operator<(const frac &a,const frac &b){
return (__int128)a.x*b.y<(__int128)a.y*b.x;
}
friend bool operator>(const frac &a,const frac &b){
return (__int128)a.x*b.y>(__int128)a.y*b.x;
}
};
void work(){
int64 t;
std::cin>>t;
auto calc=[&](int64 c){
return frac(c-1,2)+frac(t,c);
};
int64 c=(int64)sqrt(2*t);
frac ans=calc(c);
if (c<t) ans=std::min(ans,calc(c+1));
std::cout<<ans.x<<' '<<ans.y<<'\n';
}
int main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0);
int T=1;
std::cin>>T;
for (;T--;) work();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
3 1 2 3
output:
1 1 3 2 2 1
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 187ms
memory: 3628kb
input:
1000000 1 1000000000 1 1 1000000000 1 1000000000 1 1 1 1000000000 1 1 1000000000 1 1000000000 1000000000 1 1000000000 1 1 1000000000 1 1000000000 1000000000 1 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1 1 1000000000 1 1000000000 1000000000 1000000000 1000000000 1 1 1 10000000...
output:
1 1 1999961560 44721 1 1 1 1 1999961560 44721 1 1 1999961560 44721 1 1 1 1 1 1 1999961560 44721 1 1 1 1 1999961560 44721 1 1 1999961560 44721 1999961560 44721 1 1 1999961560 44721 1 1 1 1 1999961560 44721 1 1 1999961560 44721 1999961560 44721 1 1 1999961560 44721 1999961560 44721 1999961560 44721 19...
result:
ok 1000000 lines
Test #3:
score: 0
Accepted
time: 480ms
memory: 3640kb
input:
1000000 158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 628894325 731963982 822804784 450968417 430302156 982631932 161735902 880895728 923078537 707723857 189330739 910286918 802329211 404539679 303238506 317063340 492686568 773361868 125...
output:
316511467 17791 1755824328 41903 1204845831 34711 49954223 7068 1723292600 41513 623676492 17659 867864517 29460 952375859 30861 262700539 11461 422085442 20545 1942776701 44077 251551941 7093 1463896912 38261 1645584679 40566 901913913 30032 107573492 3667 1965228547 44331 323457022 17985 176178307...
result:
ok 1000000 lines
Extra Test:
score: 0
Extra Test Passed