QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #801293 | #9730. Elevator II | Proaes | WA | 43ms | 3980kb | C++11 | 642b | 2024-12-06 21:00:14 | 2024-12-06 21:00:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define wln putchar('\n')
#define ll long long
const int N=100005;
int n,f,a[N],b[N],p[N];
void Main()
{
scanf("%d%d",&n,&f);
For(i,1,n)scanf("%d%d",a+i,b+i);
For(i,1,n)p[i]=i;
sort(p+1,p+n+1,[&](int x,int y){return b[x]>b[y];});
b[0]=f;
ll ans=0;
For(i,1,n)ans+=b[i]-a[i];
For(i,1,n)ans+=max(a[p[i]]-b[p[i-1]],0);
printf("%lld\n",ans);
For(i,1,n)printf("%d ",p[i]); wln;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)Main();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3980kb
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: 43ms
memory: 3956kb
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:
540 18 4 10 9 1 6 2 14 11 12 17 19 13 3 5 16 15 7 8 194 5 4 2 6 1 3 469 1 11 4 5 12 10 13 14 8 16 2 6 15 9 7 3 734 3 1 10 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 4 12 20 14 5 15 8 19 16 3 17 104 4 1 3 2 203 8 3 1 4 2 6 7 5 9 1...
result:
wrong answer Participant's cost is 540, which is worse than jury's cost 524 (test case 1)