QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#113179#5505. Great ChaselftroqAC ✓927ms9892kbC++142.2kb2023-06-16 16:43:472023-06-16 16:43:51

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-16 16:43:51]
  • 评测
  • 测评结果:AC
  • 用时:927ms
  • 内存:9892kb
  • [2023-06-16 16:43:47]
  • 提交

answer

/*
                     ,
                ,.  | \
               |: \ ; :\
               :' ;\| ::\
                \ : | `::\
                _)  |   `:`.
              ,' , `.    ;: ;
            ,' ;:  ;"'  ,:: |_
           /,   ` .    ;::: |:`-.__
        _,' _o\  ,::.`:' ;  ;   . '
    _,-'           `:.          ;""\,
 ,-'                     ,:         `-;,
 \,                       ;:           ;--._
  `.______,-,----._     ,' ;:        ,/ ,  ,`
         / /,-';'  \     ; `:      ,'/,::.:::
       ,',;-'-'_,--;    ;   :.   ,',',;::::::
      ( /___,-'     `.     ;::,,'o/  ,:::::::
       `'             )    ;:,'o /  ;"-   -::
                      \__ _,'o ,'         ,::
                         ) `--'       ,..::::
      _lftroq_           ; `.        ,:::::::
                          ;  ``::.    :::::::
*/
#include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MOD 1000000007LL
#define MOD2 998244353LL
#define endl '\n'
#define INFINITE 2147483647LL
#define INFINITE2 9223372036854775807
#define llll pair<ll,ll>
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using namespace std;

ll n,v;
ll a[400005],b[400005];
ld l,r,ma,mi;

bool check(ld k)
{
    //cout << k << ": ";
    ld x=-INFINITE2,y=INFINITE2;
    for(int i=1;i<=n;i++)
    {
        if(a[i]<=0) x=max(x,a[i]+k*b[i]);
        else y=min(y,a[i]-k*b[i]);
    }
    //cout << x << " " << y << endl;
    if(x>y) return false;
    return true;
}

void solve()
{
    ld ans=0;
    l=r=ma=mi=0;
    cin >> n >> v;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i] >> b[i];
        ma=max(ma,(ld)a[i]);
        mi=min(mi,(ld)a[i]);
    }
    l=0,r=ma-mi;
    ll temp=0;
    while(l<=r&&temp<=100)
    {
        ld mid=(l+r)/2.0;
        if(check(mid))
        {
            ans=mid;
            l=mid;
        }
        else r=mid;
        temp++;
    }
    cout << setprecision(15) << fixed << ans*v << endl;
}

int main()
{
    fastIO
    //freopen("hanhhhh.inp","r",stdin);
    //freopen("hanhhhh.out","w",stdout);
    ll t=1;
    cin >> t;
    while(t--)
    solve();
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5784kb

input:

3
4 9
10 2
-7 2
-6 1
7 1
2 8
-1 7
1 6
2 3
-1000000000000 1
1000000000000 1

output:

38.250000000000000
1.230769230769231
3000000000000.000000000000000

result:

ok 3 numbers

Test #2:

score: 0
Accepted
time: 595ms
memory: 5776kb

input:

10000
200 997007
405524182320 754760
686939601648 419804
687047488212 715566
1446157132 4594
-670522037 4673
763634629282 253755
424307411732 275041
1582708381 8473
-667425982 4622
-522841486 1427
702430907988 460271
1405423646 1060
1497754648 6227
883363410675 723547
56899800372 46435
-810216390 64...

output:

145405766328.349110037088394
16414958969.727281190454960
5202715639.835183899849653
321977234.156325868942076
45384199210.221683971583843
183885744.769230769234127
1708925225.230472357943654
89786664971.557942636311054
13924365606.287388794124126
412975327.555555555532919
965508404.512101492495276
4...

result:

ok 10000 numbers

Test #3:

score: 0
Accepted
time: 909ms
memory: 5992kb

input:

93
15435 968117
4196666 184
-5069875 255
-9782648 980
-1978138 176
9333323 764
-4323540 12
-8442049 319
-5371878 137
2881306 10
-4050629 133
-4659099 59
-5189169 320
-2256647 99
-3686648 37
1059255 33
-223142 20
8040933 408
8407764 705
694547 38
-7913614 746
-3573355 132
5919585 189
-3756662 94
-795...

output:

189662921.363636363632395
197971181.333333333328483
997533531.737629592360463
6439673170.665741784498096
993821598110.661077797412872
22727977326.402660986408591
34702455207.518504027277231
677770533.929817498661578
46631726883.969133231788874
5446481867.129032257944345
11336247450.272078594192863
4...

result:

ok 93 numbers

Test #4:

score: 0
Accepted
time: 822ms
memory: 9892kb

input:

5
400000 999972
172811492468 106699
171900177092 102097
194121748377 184014
190302947556 172722
183121572232 149212
196566712700 190884
171376795991 99358
522927044000 159597
-129031052077 34395
189422320931 170012
-275879974024 638546
408864707565 98475
-106703244806 368801
192128798630 178213
2915...

output:

519985220219.811770886182785
511413015796.766475349664688
424240880533.634020358324051
518849481155.503918766975403
1882496988186.443999886512756

result:

ok 5 numbers

Test #5:

score: 0
Accepted
time: 927ms
memory: 8396kb

input:

38
16668 999947
-3844782803 511
-210897941456 464872
618726004990 714384
-954596898686 225256
96675744 1148
-1515974078 11375
-206213840984 706184
306078847 3947
-474818331950 391451
-616022698917 561244
123378707 1540
-640636592655 406006
459201391325 908506
-733249583 5719
496163273 6238
619876911...

output:

89670748252.978608012199402
98630840901.507606953382492
29393530999.894327787682414
50801000770.955985419452190
39668001027.269331343472004
467846478226.411370813846588
30789914370.574311612173915
23151476830.905098432675004
51606123416.625827591866255
151713060001.662588909268379
100944679009.60928...

result:

ok 38 numbers