QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #758977 | #9730. Elevator II | fhq_treap# | WA | 36ms | 3620kb | C++23 | 740b | 2024-11-17 20:51:01 | 2024-11-17 20:51:02 |
Judging History
answer
#include<iostream>
#include<vector>
#include<algorithm>
#include<iterator>
#include<set>
using std::cin,std::cout;
int n,f,l[100010],r[100010],p[100010],book[100010];
void solve(){
cin>>n>>f;
long long res=0;
for(int i=1;i<=n;i++) cin>>l[i]>>r[i],res+=r[i]-l[i],p[i]=i,book[i]=0;
std::vector<int> ans;
std::sort(p+1,p+n+1,[](int x,int y){return l[x]<l[y];});
for(int i=1;i<=n&&l[p[i]]<=f;i++)if(r[p[i]]>f){
ans.push_back(p[i]),book[i]=1,f=r[p[i]];
}
if(l[p[n]]>f) res+=l[p[n]]-f;
for(int i=n;i;i--) if(!book[i]) ans.push_back(p[i]);
cout<<res<<'\n';
for(int i:ans) cout<<i<<' ';
cout<<'\n';
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int T;
cin>>T;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3556kb
input:
2 4 2 3 6 1 3 2 7 5 6 2 5 2 4 6 8
output:
11 2 3 4 1 5 2 1
result:
ok ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 36ms
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 2 10 4 14 11 6 18 19 1 17 9 13 3 5 12 15 7 8 16 194 5 4 2 1 6 3 397 9 10 4 11 1 13 5 8 14 12 6 7 16 15 2 3 733 2 15 7 3 1 4 17 8 16 5 12 10 19 13 14 6 11 18 9 244 3 10 5 6 2 8 12 4 14 11 1 15 9 13 7 422 17 18 11 10 6 7 2 13 20 4 8 5 15 9 16 14 1 19 3 12 104 3 4 1 2 187 4 3 8 2 1 5 6 9 10 ...
result:
wrong answer Participant's cost is 135, which is worse than jury's cost 117 (test case 9)