QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#687054#9529. Farm ManagementNujWA 1ms5764kbC++201021b2024-10-29 16:55:102024-10-29 16:55:12

Judging History

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

  • [2024-10-29 16:55:12]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:5764kb
  • [2024-10-29 16:55:10]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define ub upper_bound
#define dbg(x) cerr<<"In Line "<<__LINE__<<' '<<#x<<" = "<<(x)<<endl
struct node{
	int w,l,r,now;
}a[100005];
bool cmp(node x,node y){
	return x.w<y.w;
}
ll b[100005],c[100005];
int d[100005];
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;ll m;cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i].w>>a[i].l>>a[i].r;
	sort(a+1,a+n+1,cmp);
	ll now=m,sum=0,ans=0;
	for(int i=1;i<=n;i++) now-=a[i].l,sum+=(ll)a[i].l*a[i].w;
	int cnt=0;
	for(int i=n;i;i--){
		if(now>a[i].r-a[i].l){
			a[i].now=a[i].r-a[i].l,sum+=(ll)a[i].w*a[i].now,now-=a[i].now;
			ans=max(ans,sum+now*a[i].w);
		}
		else{
			a[i].now=now,now=0,sum+=(ll)a[i].w*a[i].now;
			int p=ub(b+1,b+cnt+1,a[i].l+a[i].now)-b-1;
			d[++cnt]=a[i].w;
			ans=max(ans,sum-(ll)(a[i].l+a[i].now)*a[i].w+c[p]+(a[i].l+a[i].now-b[p])*d[p+1]);
			b[cnt]=a[i].r-a[i].l-now;
			c[cnt]=b[cnt]*a[i].w;
			b[cnt]+=b[cnt-1],c[cnt]+=c[cnt-1];
		}
	}
	cout<<ans;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 1ms
memory: 5676kb

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: 5764kb

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: 1ms
memory: 3724kb

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: 1ms
memory: 3644kb

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: 5700kb

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: 5676kb

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:

1597735471673

result:

wrong answer 1st lines differ - expected: '1597735409747', found: '1597735471673'