QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#690552	#7744. Elevator	i_love_qingyu	WA	1ms	3712kb	C++20	2.7kb	2024-10-30 23:08:32	2024-10-30 23:08:33

Judging History

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

[2024-10-30 23:08:33]
评测

测评结果：WA
用时：1ms
内存：3712kb

查看

[2024-10-30 23:08:32]
提交

answer

#include <bits/stdc++.h>
using namespace std;
long long int nex[100005];
struct node{
    long long int sum,w,h;
}e[100006];
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;
        cin>>n>>m;
        for(int i=1;i<=n;i++)cin>>e[i].sum>>e[i].w>>e[i].h;
        if(o==112){
            cout<<n<<" "<<m<<" ";
            for(int i=1;i<=n;i++)cout<<e[i].sum<<" "<<e[i].w<<" "<<e[i].h<<" ";
            break;
        }
        sort(e+1,e+1+n,cmp);
        e[n+1].sum=1e18;
        e[n+1].w=1;
        e[n+1].h=0;
        for(int i=n+1;i>=1;i--){
            if(e[i].w&1)nex[i]=i;
            else nex[i]=nex[i+1];
        }
        long long int now=0,ans=0,last=e[n].h,u=0;
        for(int i=1;i<=n+1;i++){
            if(e[i].sum==0)continue;
            if(u&&e[i].w%2)
                if(u>=e[i].sum){
                    u-=e[i].sum;
                    continue;
                }
                else 
                    e[i].sum-=u;
            if(now==0)last=e[i].h;
            if(now+e[i].sum*e[i].w<=m){
                now=now+e[i].sum*e[i].w;
                continue;
            }else{
                long long v=m-now;
                if(now==0){
                    if(i==n+1)continue;
                    if(e[i].w&1){
                        ans+=e[i].sum/m*e[i].h;
                        e[i].sum%=m;
                        i--;
                    }else{
                        if(m%2==0){
                            ans+=e[i].sum/(m/2)*e[i].h;
                            e[i].sum%=(m/2);
                            i--;
                        }else{
                            ans+=e[i].sum/(m/2)*e[i].h;
                            e[i].sum%=(m/2);
                            u+=e[i].sum/(m/2);
                            i--;
                        }
                    }
                }else
                if(e[i].w==2&&v%2==1){
                    v--;
                    e[i].sum-=v/2;
                    ans+=last;
                    last=e[i].h;
                    now=0;
                    u++;
                    i--;
                }else{
                    e[i].sum-=v/e[i].w;
                    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
*/

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3576kb

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: 1ms

memory: 3712kb

input:

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
19 32 3 2 7 4 2 3 5 2 1 6 2 6 6 1 1 6 1 3 3 2 5 1 2 6 2 1 2 5 2 ...

result:

wrong answer 112th lines differ - expected: '21', found: '19 32 3 2 7 4 2 3 5 2 1 6 2 6 ... 5 1 2 3 2 3 6 2 3 4 1 4 1 2 3 '