QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #559114 | #8835. Goodman | AChievedreaM# | WA | 1ms | 7728kb | C++17 | 807b | 2024-09-11 20:17:50 | 2024-09-11 20:17:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using db=double;
const ll N=1e6+5;
typedef pair<ll,ll>PLL;
#define fi first
#define se second
ll a[N],ans[N],vis[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll t,n;
t=1;
cin>>t;
while(t--)
{
cin>>n;
ll cnt=0;
for(ll i=1;i<=n;i++)
{
vis[i]=0;
cin>>a[i];
if(a[i]==i)
ans[++cnt]=i,vis[i]=1;
}
ll l=1,r=n;
while(l<=r)
{
if(l==r)
{
if(!vis[l])
ans[++cnt]=a[l],vis[l]=1;
l++,r--;
}
else
{
if(!vis[r])
{
ans[++cnt]=a[r],vis[r]=1;
}
if(!vis[l])
{
ans[++cnt]=a[l],vis[l]=1;
}
l++,r--;
}
}
cout<<ans[1];
for(ll i=2;i<=cnt;i++)
cout<<' '<<ans[i];
cout<<'\n';
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 7708kb
input:
2 4 1 2 3 4 6 6 5 4 3 2 1
output:
1 2 3 4 1 6 2 5 3 4
result:
ok Correct (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 7728kb
input:
873 6 1 5 2 4 6 3 6 5 1 6 4 3 2 4 1 4 3 2 6 2 1 6 5 4 3 6 4 5 1 3 6 2 6 6 2 1 5 4 3 5 1 5 4 3 2 6 1 2 6 3 5 4 4 2 1 3 4 6 1 6 4 2 3 5 6 6 1 3 5 2 4 6 2 1 4 5 3 6 6 3 4 1 5 2 6 6 4 1 5 2 6 3 6 5 2 1 4 6 3 6 4 1 6 2 3 5 6 5 1 3 4 6 2 6 6 2 5 4 1 3 6 6 2 5 1 4 3 6 5 2 3 6 4 1 6 6 1 2 5 4 3 6 2 3 4 6 1 ...
output:
1 4 3 6 5 2 4 2 5 3 1 6 1 3 2 4 3 2 4 1 5 6 2 4 6 5 3 1 2 3 6 4 5 1 1 2 3 5 4 1 2 5 4 3 6 3 4 2 1 1 5 3 6 2 4 3 4 6 2 1 5 6 2 3 1 5 4 6 3 2 4 5 1 3 4 6 1 2 5 2 4 3 5 6 1 5 4 3 1 2 6 3 4 2 5 6 1 2 4 3 6 1 5 2 3 6 4 1 5 2 3 1 5 4 6 3 6 4 1 5 2 5 2 1 3 6 4 4 3 5 1 6 2 2 5 4 3 1 6 6 4 1 3 2 5 2 5 3 4 6 ...
result:
wrong answer Jury found better answer than participant (test case 2)