QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #755188 | #9730. Elevator II | zake# | WA | 46ms | 16072kb | C++17 | 2.2kb | 2024-11-16 16:39:29 | 2024-11-16 16:39:30 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
void solve();
signed main() {
fast
int t = 1;
cin >> t;
while (t--) solve();
}
const int maxn=300010;
struct A{int l,r,id;};
A e[maxn];
vector<int>w[maxn];
A s[maxn];
int id;
int ans[maxn];
bool comp(A p,A q)
{
if(p.l==q.l)return p.r<q.r;
return p.l<q.l;
}
void ch(int x)
{
for(int i=x;i<=id;i++)
{
for(int j=0;j<w[i].size();j++)
{
cout<<w[i][j]<<" ";
}
}
for(int i=x-1;i>=1;i--)
{
for(int j=0;j<w[i].size();j++)
{
cout<<w[i][j]<<" ";
}
}
cout<<"\n";
}
void solve() {
id=0;
int n,a;
cin>>n>>a;
int mx=0;
for(int i=1;i<=n;i++)
{
cin>>e[i].l>>e[i].r;
e[i].id=i;
mx=max(mx,e[i].r);
}
sort(e+1,e+n+1,comp);
for(int i=1;i<=n;i++)
{
if(id==0||e[i].l>s[id].r)
{
s[++id].l=e[i].l;
s[id].r=e[i].r;
w[id].clear();
ans[id]=0;
}
else
{
s[id].r=max(s[id].r,e[i].r);
}
w[id].push_back(e[i].id);
ans[id]+=(e[i].r-e[i].l);
// cout<<id<<"!! "<<ans[id]<<"\n";
}
for(int i=1;i<=id;i++)
{
if(a>=s[i].l&&a<=s[i].r)
{
int ansi=0;
for(int j=1;j<=id;j++)
{
ansi=ansi+ans[j];
if(j>i)
{
ansi+=(s[j].l-s[j-1].r);
}
}
cout<<ansi<<"\n";
ch(i);
return;
}
if(a<s[i].l)
{
int ansi=s[i].l-a;
for(int j=1;j<=id;j++)
{
ansi=ansi+ans[j];
if(j>i)
{
ansi+=(s[j].l-s[j-1].r);
}
}
cout<<ansi<<"\n";
ch(i);
return;
}
}
int ansi=0;
for(int i=1;i<=id;i++)
ansi+=ans[i];
cout<<ansi<<"\n";
ch(id+1);
return ;
}
/*
2 4 2 3 6 1 3 2 7 5 6 2 5 2 4 6 8
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 16012kb
input:
2 4 2 3 6 1 3 2 7 5 6 2 5 2 4 6 8
output:
11 2 3 1 4 5 2 1
result:
ok ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 46ms
memory: 16072kb
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 16 2 10 8 7 15 12 5 3 13 17 9 1 19 18 6 11 14 4 194 5 3 6 1 2 4 397 9 10 15 2 4 16 7 6 12 11 14 8 5 13 1 3 733 2 9 15 18 7 11 3 6 14 13 19 10 12 5 16 8 17 4 1 244 7 13 9 3 15 1 11 10 14 5 6 4 2 12 8 422 17 18 12 3 19 1 14 16 15 9 5 8 20 4 13 2 7 6 10 11 104 3 4 1 2 187 7 10 9 4 6 5 1 3 2 ...
result:
wrong answer Participant declares the cost to be 524, but the plan actually costs 559 (test case 1)