QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#702967 | #9529. Farm Management | Murphy_ | WA | 23ms | 8376kb | C++11 | 2.5kb | 2024-11-02 16:52:47 | 2024-11-02 16:52:49 |
Judging History
answer
#include <bits/stdc++.h>
#define N 100005
#define ll long long
using namespace std;
struct node {
int w,l,r,t;
}q[N];
bool cmp(node x,node y){return x.w<=y.w;}
ll t_l[N],sum1[N],total,w_t,ans;
ll r_t[N],sum2[N];
signed main() {
int n,m;scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) {
scanf("%d%d%d",&q[i].w,&q[i].l,&q[i].r);
q[i].t=q[i].r;
total+=(ll)q[i].r;
}
sort(q+1,q+1+n,cmp);
ll res=total-m;
for(int i=1;i<=n;++i) {
if(res) {
int x = q[i].t-q[i].l;
int sub = (x<=res)?x:res;
q[i].t-=sub;
res-=sub;
}
}
for(int i=1;i<=n;++i) {
t_l[i]=t_l[i-1]+(ll)(q[i].t-q[i].l);
sum1[i]=sum1[i-1]+q[i].w*(ll)(q[i].t-q[i].l);
r_t[i]=r_t[i-1]+(ll)(q[i].r-q[i].t);
sum2[i]=sum2[i-1]+q[i].w*(ll)(q[i].r-q[i].t);
w_t+=q[i].w*(ll)q[i].t;
}
// cout<<endl;
// for(int i=1;i<=n;++i) cout<<t_l[i]<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<q[i].w<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<q[i].l<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<q[i].r<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<q[i].t<<' ';cout<<endl;cout<<endl;
// for(int i=1;i<=n;++i) cout<<t_l[i]<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<sum1[i]<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<r_t[i]<<' ';cout<<endl;
// for(int i=1;i<=n;++i) cout<<sum2[i]<<' ';cout<<endl;cout<<endl;
ans=w_t;
// cout<<ans<<endl;
for(int i=1;i<=n;++i) {
ll pre = t_l[i-1];
ll sub = sum1[i-1]+q[i].w*(ll)q[i].t;
ll ti = q[i].t + pre;
ll find = r_t[n]-(ll)ti;
int idx = upper_bound(r_t+1+i,r_t+1+n+1,find)-r_t;
idx = (idx > n)?n:idx;
// cout<<i<<": "<<pre<<", "<<sub<<", "<<ti<<" {}"<<find<<", "<<idx<<" ***** ";
ll mor=0;
ll add=0;
// if(idx == n) {
// mor = min(r_t[n]-r_t[n-1],ti);
// add = mor * q[n].w;
// }
if(idx<n) {
mor = r_t[n]-r_t[idx];
add = sum2[n]-sum2[idx];
}
// cout<<" "<<mor<<", "<<add<<" [] ";
if(idx>i+1) {
// mor+=ti-(r_t[n]-r_t[idx+1]);
ll x=min(ti-mor,r_t[idx]-r_t[idx-1]);
add += x*(ll)q[idx].w;
mor+=x;
}
int res = ti-mor;
ans=max(ans,w_t-sub+add+res*(ll)q[i].w);
// cout<<mor<<", "<<add<<", "<<res<<", "<<ans<<endl;
}
printf("%lld",ans);
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5936kb
input:
5 17 2 3 4 6 1 5 8 2 4 4 3 3 7 5 5
output:
109
result:
ok single line: '109'
Test #2:
score: 0
Accepted
time: 0ms
memory: 7900kb
input:
12 62 503792 9 10 607358 1 3 600501 10 10 33249 4 4 774438 6 6 197692 3 6 495807 8 8 790225 5 9 77272 3 8 494819 4 9 894779 3 9 306279 5 6
output:
35204500
result:
ok single line: '35204500'
Test #3:
score: 0
Accepted
time: 1ms
memory: 5924kb
input:
15 32 835418 2 3 178262 1 3 527643 2 2 519710 1 1 774544 3 3 82312 1 1 808199 1 1 809396 1 3 255882 1 3 80467 1 3 874973 1 3 813965 1 2 198275 1 2 152356 1 3 802055 1 1
output:
22000255
result:
ok single line: '22000255'
Test #4:
score: 0
Accepted
time: 0ms
memory: 5924kb
input:
13 20 526447 1 1 807398 2 2 4167 1 2 944031 2 2 830685 2 2 394251 1 2 505011 1 2 968848 1 1 58170 1 3 32504 1 1 792273 3 3 196120 1 2 714507 1 1
output:
12878768
result:
ok single line: '12878768'
Test #5:
score: 0
Accepted
time: 0ms
memory: 5840kb
input:
13 32 582584 1 3 335440 3 3 971984 1 2 864169 1 2 528515 1 1 382399 1 2 459855 1 2 406909 2 3 66780 2 3 885118 3 3 434844 1 2 93331 1 3 502509 1 3
output:
22065034
result:
ok single line: '22065034'
Test #6:
score: 0
Accepted
time: 1ms
memory: 5740kb
input:
12 77 30244 1 7 518214 3 8 486001 8 9 152634 2 3 180255 3 4 791887 1 6 635820 2 9 881171 3 5 337905 3 8 683182 5 5 300786 3 6 339094 7 9
output:
50453764
result:
ok single line: '50453764'
Test #7:
score: 0
Accepted
time: 0ms
memory: 8036kb
input:
10 3923726 826284 215861 638800 471693 146746 886003 140800 532315 684546 673434 604071 814259 170671 299465 525449 104262 689547 855391 215333 591975 803421 795321 31606 984783 103838 361911 601318 145693 450227 686945
output:
1597735409747
result:
ok single line: '1597735409747'
Test #8:
score: -100
Wrong Answer
time: 23ms
memory: 8376kb
input:
100000 16648414311 252800 55607 195981 157144 548469 789695 643048 2 2 907957 3 3 32532 231618 316365 194428 227513 762023 4231 393553 699179 898052 3 5 507551 3 5 747498 1 4 857939 9 9 440056 764429 796585 495571 117772 838593 4059 551203 870687 60877 597981 770178 593237 4 10 438147 218335 370780 ...
output:
4148641231936291
result:
wrong answer 1st lines differ - expected: '4148641232436282', found: '4148641231936291'