QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#627749	#7744. Elevator	hhdhh	WA	35ms	5968kb	C++23	2.6kb	2024-10-10 17:02:08	2024-10-10 17:02:10

Judging History

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

[2024-10-10 17:02:10]
评测

测评结果：WA
用时：35ms
内存：5968kb

查看

[2024-10-10 17:02:08]
提交

answer

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rept(i, a, ne) for(int i = (a); ~i ; i=ne[i])
#define debug(x) cout<<#x<<": "<<x<<endl
#define fi first
#define sec second
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double  LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef pair<int,int>PII;
const int N=1e5+10;
struct A
{
    LL x,y,z;

    bool operator<(const A& a)const
    {
        if(x>a.x)
        return 1;
        else if(x<a.x)
        return 0;
        return z>a.z;
    }
}a[N];
int nn;
void slove()
{
    nn++;
    LL n,k;
    cin>>n>>k;
    rep(i,1,n)
    {
        auto &[x,y,z]=a[i];
        cin>>y>>z>>x;
    }
    if(nn==39)
    {
        cout<<n<<'*'<<k<<'|';
        rep(i,1,n)
        {
            auto &[x,y,z]=a[i];
            cout<<x<<'*'<<y<<'*'<<z<<'|';
            cout<<endl;
        }
        
    }
    sort(a+1,a+1+n);
    LL nk=0;
    LL np=0;
    LL p=0;
    LL ans=0;
    rep(i,1,n)
    {
        auto [x,y,z]=a[i];
        if(p==1&&z==1)
        y--;
        if(z==2)
        {
            LL num=min((k-nk)/z,y);
            if(num&&nk==0)
            np=x;
            y-=num;
            nk+=num*z;
            if(nk>=k-1)
            {
                nk=0;
                if(nk==k-1)
                p=1;
                ans+=np;
                np=0; 
                LL pnum=y/(k/z);
                ans+=pnum*x;
                y-=pnum*(k/z);
                if(y)
                {
                    np=x;
                    nk+=y*z;
                }
            }
        }
        else
        {
            LL num=min((k-nk)/z,y);
            if(num&&nk==0)
            np=x;
            y-=num;
            nk+=num*z;
            if(nk>=k)
            {
                nk=0;
                ans+=np;
                np=0; 
                LL pnum=y/(k/z);
                ans+=pnum*x;
                y-=pnum*(k/z);
                if(y)
                {
                    np=x;
                    nk+=y*z;
                }
            }
        }
        //  debug(nk);
    }
   
    if(nk)ans+=np;
    cout<<ans<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//	cout << fixed << setprecision(9);
    int t=1;
	cin>>t;
    while(t--)
    {
        slove();
    }

    return 0;
}
//#pragma GCC optimize(2)

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3592kb

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

memory: 5968kb

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
17*2|3*1*1|
4*5*2|
1*2*1|
6*4*1|
1*5*2|
5*1*1|
2*4*2|
2*2*2|
5*6*2|
5*1*2|
1*2*1|
3*3*2|
5*1*1|
6*2*2|
4*2*2|
3*5*2|
4*5*1|
150
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
...

result:

wrong answer 39th lines differ - expected: '147', found: '17*2|3*1*1|'