QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#357619#7744. ElevatorBaiyu0123WA 37ms6324kbC++141.6kb2024-03-19 03:29:102024-03-19 03:29:10

Judging History

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

  • [2024-03-19 03:29:10]
  • 评测
  • 测评结果:WA
  • 用时:37ms
  • 内存:6324kb
  • [2024-03-19 03:29:10]
  • 提交

answer

#include<bits/stdc++.h>
#define fi first
#define se second
#define mkp make_pair
#define pii pair<int,int>
#define ll long long
using namespace std;
const int maxn=2e5+100;
int n,n1,n2;ll k;
pii p1[maxn],p2[maxn];
ll ans=0;
bool cmp(const pii &x,const pii &y) {
	return x.se>y.se;
}
int main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);	
	int T;cin>>T;
	while (T--) {
		cin>>n>>k;n1=n2=0;ans=0;
		for (int i=1;i<=n;i++) {
			int x,opt,y;cin>>x>>opt>>y;
			if (opt==1) p1[++n1]=mkp(x,y);
			else p2[++n2]=mkp(x,y);
		}
		sort(p1+1,p1+n1+1,cmp);
		sort(p2+1,p2+n2+1,cmp);
		ll lk=0;int cnt=0;
		for (int i1=1,i2=1;i1<=n1||i2<=n2;) {
			if (i2>n2||p1[i1].se>p2[i2].se) {
				if (p1[i1].fi==0) {
					i1++;
					continue;
				}
				if (cnt!=0) {
					int x=min(cnt,p1[i1].fi);
					cnt-=x;p1[i1].fi-=x;
					continue;
				}
				if (lk!=0) {
					ll x=min(lk,(ll)p1[i1].fi);
					lk-=x;p1[i1].fi-=x;
					continue;
				}
				if (p1[i1].fi/k) {
					ans+=1ll*p1[i1].se*(p1[i1].fi/k);
					p1[i1].fi%=k;
					continue;
				}
				ans+=p1[i1].se;
				lk=k-p1[i1].fi;
				i1++;
			} else {
				if (p2[i2].fi==0) {
					i2++;
					continue;
				}
				if (lk==1) {
					cnt++;
					lk=0;
					continue;
				}
				if (lk!=0) {
					ll x=min(lk/2,(ll)p2[i2].fi);
					lk-=x*2;p2[i2].fi-=x;
					continue;
				}
				if (p2[i2].fi*2/k) {
					ans+=1ll*p2[i2].se*(p2[i2].fi*2/k);
					p2[i2].fi%=k/2;
					continue;
				}
				ans+=p2[i2].se;
				lk=k-2*p2[i2].fi;
				i2++;
			}
		}
		cout<<ans<<endl;
	}
}
/*
1
4 200
238 2 1867
968 2 1272
1132 2 969
745 1 725
1806 2 395

*/

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3680kb

input:

2
4 6
1 1 8
7 2 5
1 1 7
3 2 6
8 1200000
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345

output:

24
100000

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 37ms
memory: 6324kb

input:

5501
8 104
5 2 3
6 2 4
5 2 3
6 2 9
8 2 4
2 1 3
7 2 4
8 2 8
1 290
3 1 1
12 12
6 1 2
1 2 2
1 1 2
1 2 4
6 1 1
1 2 5
6 1 4
4 1 4
6 2 4
6 2 5
4 2 5
4 1 4
5 334
1 1 4
1 2 3
4 2 1
5 1 1
2 1 2
13 218
5 2 3
5 1 4
1 2 1
1 2 5
3 2 2
1 1 3
4 2 2
1 2 5
2 2 1
2 1 5
3 2 1
5 2 1
1 1 4
10 260
7 2 1
5 1 1
5 2 4
6 1 6...

output:

9
1
23
4
5
7
1
3
9
6
1
10
4
9
17
6
4
1
8
5
5
7
1
3
23
6
3
3
2
2
2
3
8
1
5
6
9
11
147
7
10
2
7
7
8
6
5
5
1
7
3
5
10
7
7
10
8
1
4
2
3
9
1
5
2
9
1
6
7
7
6
10
18
8
10
4
10
9
2
8
3
5
9
3
6
5
3
2
6
1
3
2
2
1
6
9
6
3
4
8
9
9
2
6
1
2
6
7
5
2
5
21
8
1
2
3
4
9
3
4
6
5
9
6
1
7
3
7
3
2
2
8
7
3
5
9
7
10
7
3
2
4
...

result:

wrong answer 213th lines differ - expected: '2', found: '4'