QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#690045 | #9529. Farm Management | manba_out | WA | 0ms | 3716kb | C++20 | 1.3kb | 2024-10-30 19:59:06 | 2024-10-30 19:59:07 |
Judging History
answer
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 1e5+3;
int n;ll m;
ll ans,sum[N],sumw[N];
struct node{
int w,l,r;
bool operator < (const node& a){
return w>a.w;
}
}a[N];
ll fastPow(ll a, ll n, ll mod){
ll ans = 1;
a %= mod;
while(n) {
if(n & 1) ans = (ans*a) % mod;
a = (a*a) % mod;
n >>= 1;
}
return ans;
}
ll solve(int x){
ll res = 0,tm = m+a[x].l;
res -= a[x].w*a[x].l;
int id = lower_bound(sum+1,sum+n+1,tm)-(sum+1);
if(id<x){
res+=sumw[id];
tm-=sum[id];
res+=a[id+1].w*tm;
}
else{
res+=sumw[x-1];
tm-=sum[x-1];
res+=a[x].w*tm;
}
return res;
}
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n>>m;
ans = 0;
rep(i,1,n)cin>>a[i].w>>a[i].l>>a[i].r;
sort(a+1,a+n+1);
rep(i,1,n){
sum[i] = sum[i-1]+(a[i].r-a[i].l);
m-=a[i].l;
sumw[i] = sumw[i-1]+1ll*a[i].w*(a[i].r-a[i].l);
ans += a[i].w*a[i].l;
}
ll tmp = 0;
rep(i,1,n){
tmp = max(tmp,solve(i));
}
cout<<ans+tmp;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3668kb
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: 0ms
memory: 3624kb
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: 3648kb
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: 3656kb
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: 0ms
memory: 3716kb
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: -100
Wrong Answer
time: 0ms
memory: 3636kb
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:
558353324115
result:
wrong answer 1st lines differ - expected: '1597735409747', found: '558353324115'