QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#317781 | #5593. Food Processor | Li__ | RE | 33ms | 10084kb | C++20 | 783b | 2024-01-29 18:17:24 | 2024-01-29 18:17:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
i64 s,t,n;
cin>>s>>t>>n;
set<array<i64,2>> bl;
for(int i=1;i<=n;i++){
i64 m,h;
cin>>m>>h;
auto hav=bl.upper_bound({m,h});
if(hav!=bl.end()&&(*hav)[1]<=h) continue;
auto it=hav;
while(it!=bl.begin() && (*prev(it))[1]>h){
bl.erase(it,hav);
it--;
}
bl.insert({m,h});
}
auto m=bl.upper_bound({s,0});
if(m==bl.end()){
cout<<"-1\n";
return 0;
}
long double now=t,ans=0;
auto p=bl.upper_bound({t,0});
while(((*p)[0])<s){
ans+=(*p)[1]*log2((*p)[0]/now);
now=(*p)[0];
p++;
}
ans+=(*p)[1]*log2(s/now);
cout<<fixed<<setprecision(10)<<ans<<'\n';
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3860kb
input:
10 1 2 10 10 4 5
output:
23.2192809489
result:
ok found '23.21928', expected '23.21928', error '0.00000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
10000 9999 1 10000 1
output:
0.0001442767
result:
ok found '0.00014', expected '0.00014', error '0.00000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
10 1 2 8 10 4 5
output:
-1
result:
ok found '-1.00000', expected '-1.00000', error '-0.00000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
8 2 1 8 10
output:
20.0000000000
result:
ok found '20.00000', expected '20.00000', error '0.00000'
Test #5:
score: 0
Accepted
time: 33ms
memory: 10084kb
input:
1000000 1 100000 10 10 20 20 30 30 40 40 50 50 60 60 70 70 80 80 90 90 100 100 110 110 120 120 130 130 140 140 150 150 160 160 170 170 180 180 190 190 200 200 210 210 220 220 230 230 240 240 250 250 260 260 270 270 280 280 290 290 300 300 310 310 320 320 330 330 340 340 350 350 360 360 370 370 380 3...
output:
1442798.0508796146
result:
ok found '1442798.05088', expected '1442798.05088', error '0.00000'
Test #6:
score: 0
Accepted
time: 10ms
memory: 4004kb
input:
1000000 1 100000 1000000 10 999990 20 999980 30 999970 40 999960 50 999950 60 999940 70 999930 80 999920 90 999910 100 999900 110 999890 120 999880 130 999870 140 999860 150 999850 160 999840 170 999830 180 999820 190 999810 200 999800 210 999790 220 999780 230 999770 240 999760 250 999750 260 99974...
output:
199.3156856932
result:
ok found '199.31569', expected '199.31569', error '0.00000'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3996kb
input:
1000000 999999 1 1000000 1
output:
0.0000014427
result:
ok found '0.00000', expected '0.00000', error '0.00000'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
1000000 1 1 1000000 999999
output:
19931548.6377556048
result:
ok found '19931548.63776', expected '19931548.63776', error '0.00000'
Test #9:
score: -100
Runtime Error
input:
500000 12345 100000 4783 477451 939177 624790 942796 933658 388835 943838 591586 528454 934640 609727 702473 355566 440638 181750 957421 781586 785155 972417 184923 378838 791637 199851 268779 962854 866409 181893 288522 536245 889062 89973 535331 469534 740453 750376 26154 41835 470536 449187 72774...