QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#690618#7744. Elevatori_love_qingyuWA 111ms8384kbC++201.7kb2024-10-30 23:51:212024-10-30 23:51:22

Judging History

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

  • [2024-10-30 23:51:22]
  • 评测
  • 测评结果:WA
  • 用时:111ms
  • 内存:8384kb
  • [2024-10-30 23:51:21]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
struct node{
    long long int sum,w,h;
}e[200006];
bool cmp(struct node a,struct node b){
    return a.h>b.h;
}
int main()
{
    int t,o=0;
    cin>>t;
    while(t--){
        o++;
        long long int n,m,cnt=0;
        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>e[i].sum>>e[i].w>>e[i].h;
            if(e[i].w%2==0){
                cnt++;
                e[n+cnt].sum=e[i].sum;
                e[n+cnt].w=1;
                e[n+cnt].h=e[i].h;
            }
        }
        sort(e+1,e+1+n+cnt,cmp);
        e[n+1+cnt].sum=1e18;
        e[n+1+cnt].w=1;
        e[n+1+cnt].h=0;
        long long int now=0,ans=0,last=e[1].h,u=0;
        for(int i=1;i<=n+1+cnt;i++){
            if(e[i].sum==0)continue;
            if(now==0)last=e[i].h;
            if(now+e[i].sum<m){
                now=now+e[i].sum;
                continue;
            }else{
                long long v=m-now;
                
                if(now==0){
                    if(i==n+1)continue;
                    ans+=e[i].sum/m*e[i].h;
                    e[i].sum%=m;
                    if(e[i].sum)
                        i--;
                }else{
                    e[i].sum-=v;
                    ans+=last;
                    last=e[i].h;
                    now=0;
                    if(i!=n+1)
                        i--;
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*
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
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 111ms
memory: 8384kb

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
21
4
5
7
1
3
9
6
1
10
4
9
16
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 3rd lines differ - expected: '23', found: '21'