QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #781212 | #9730. Elevator II | Carucao | WA | 45ms | 3620kb | C++20 | 695b | 2024-11-25 15:15:58 | 2024-11-25 15:15:59 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int N=1e5+10;
struct adc
{
int l,r,id;
}c[N];
int n,f;
bool cmp(adc a,adc b)
{
if(a.r==b.r) return a.l<b.l;
return a.r>b.r;
}
void work()
{
int ans=0;
cin>>n>>f;
for(int i=1;i<=n;++i) cin>>c[i].l>>c[i].r,c[i].id=i;
sort(c+1,c+1+n,cmp);
c[0].r=f;
for(int i=1;i<=n;++i)
ans+=max(0ll,c[i].l-c[i-1].r)+c[i].r-c[i].l;
cout<<ans<<endl;
for(int i=1;i<=n;++i) cout<<c[i].id<<" ";
cout<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int T=1;
cin>>T;
for(;T;--T)
work();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
2 4 2 3 6 1 3 2 7 5 6 2 5 2 4 6 8
output:
11 3 1 4 2 5 2 1
result:
ok ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 45ms
memory: 3620kb
input:
6100 19 52 51 98 2 83 40 58 96 99 39 55 72 94 15 17 4 15 48 99 2 99 77 78 35 77 44 62 79 81 30 31 1 48 48 76 68 99 60 66 6 19 44 53 64 92 17 28 67 98 9 99 40 65 16 27 99 100 15 56 4 6 24 97 84 96 47 49 37 38 77 79 13 40 13 92 71 100 47 93 90 91 72 81 15 48 32 71 19 17 95 99 10 23 18 100 90 93 52 92 ...
output:
524 10 9 18 4 1 6 2 14 11 12 17 19 13 3 5 16 15 7 8 194 5 4 2 6 1 3 441 11 1 4 5 12 10 13 14 8 16 2 6 15 9 7 3 734 3 10 1 6 8 4 5 17 16 13 11 7 15 12 18 14 9 19 2 260 2 8 6 5 12 4 14 10 3 11 9 1 15 13 7 422 18 1 6 11 2 10 7 13 9 12 4 20 14 5 15 19 8 16 3 17 104 4 1 3 2 203 8 3 4 1 2 6 7 5 9 1...
result:
wrong answer Participant's cost is 441, which is worse than jury's cost 397 (test case 3)