QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #650397 | #7744. Elevator | Dixiky_215 | WA | 33ms | 9932kb | C++20 | 2.9kb | 2024-10-18 14:56:39 | 2024-10-18 14:56:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN=1e6+7;
const ll mod=998244353LL;
int n,t;
ll m;
bool vis[MAXN];
ll ton[MAXN/3][3];
int tot=0,s[MAXN];
int main() {
cin.tie(nullptr) -> sync_with_stdio(false);
cin>>t;
while(t--)
{
cin>>n>>m;
tot=0;
for(int i=1;i<=n;i++)
{
ll v;
int idk,sss;
cin>>v>>idk>>sss;
ton[sss][idk]+=v;
if(!vis[sss]) vis[sss]=1,s[++tot]=sss;
}
sort(s+1,s+1+tot);
ll ans=0LL;
for(int i=1;i<=tot;i++)
{
ll numk=m/2LL;
ans+=(ll) s[i]*(ton[s[i]][2]/numk);
ans+=(ll) s[i]*(ton[s[i]][1]/m);
ton[s[i]][2]%=numk;
ton[s[i]][1]%=m;
}
int now_id=tot;
ll sumk=m,maxl=0;
for(int i=tot;i>=1;i--)
{
ll sk=s[i];
if(sumk==1)
{
bool kkk=0;
for(int j=now_id;j>=1;j--)
{
if(ton[s[j]][1]>0)
{
kkk=1;
now_id=j;
ton[s[j]][1]--;
maxl=max(maxl,(ll) s[j]);
break;
}
}
if(!kkk) now_id=0;
ans+=maxl;
sumk=m;maxl=0LL;
continue;
}
if(sumk>=ton[sk][2]*2LL)
{
sumk-=ton[sk][2]*2LL;
if(ton[sk][2]>0) maxl=max(maxl,sk);
ton[sk][2]=0LL;
}
else
{
if(sumk>0) maxl=max(maxl,sk);
ton[sk][2]-=sumk/2;
if(sumk%2)
{
bool kkk=0;
for(int j=now_id;j>=1;j--)
{
if(ton[s[j]][1]>0)
{
kkk=1;
now_id=j;
ton[s[j]][1]--;
maxl=max(maxl,(ll) s[j]);
break;
}
}
if(!kkk) now_id=0;
}
ans+=maxl;
sumk=m-ton[sk][2]*2;maxl=0LL;
if(ton[sk][2]>0) maxl=max(maxl,sk);
ton[sk][2]=0;
}
if(sumk>=ton[sk][1])
{
sumk-=ton[sk][1];
if(ton[sk][1]>0) maxl=max(maxl,sk);
ton[sk][1]=0LL;
}
else
{
if(sumk>0) maxl=max(maxl,sk);
ton[sk][1]-=sumk;
ans+=maxl;
sumk=m-ton[sk][1];maxl=0;
if(ton[sk][1]>0) maxl=max(maxl,sk);
}
}
if(sumk!=m) ans+=maxl;
cout<<ans<<'\n';
for(int i=1;i<=tot;i++)
{
ton[s[i]][1]=ton[s[i]][2]=0LL;
vis[s[i]]=0;
}
}
return 0;
}
/*
aabbaA
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 7736kb
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: 33ms
memory: 9932kb
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 22 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 3rd lines differ - expected: '23', found: '22'