QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #717580 | #1873. Array | juan_123 | WA | 251ms | 25588kb | C++14 | 2.4kb | 2024-11-06 18:22:48 | 2024-11-06 18:22:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
priority_queue<pair<int,int> ,vector<pair<int,int> >,greater<pair<int,int> > >q,del;
int a[500005],b[500005],pre[500005],to[500005];
int n;
int c[500005];
bool check(){
int tot = 0,cnt =0 ;
for(int i = 0;i<=n;i++)c[i] = 0;
for(int i = 1;i<=n;i++)if(!c[a[i]])++tot,c[a[i]] = 1;
for(int i =0;i<=n;i++)c[i] = 0;
int l = 0;
for(int i = 1;i<=n;i++){
// cout << " " << i << endl;
if(i!=1){if(--c[a[i-1]]==0)--cnt;}
while(l<min(b[i],n)){
// cout << " " << l << endl;
++l;++c[a[l]];
if(c[a[l]] == 1)++cnt;
// cout << " " << l << " " << b[i] << " " << cnt << endl;
if(l!=b[i] and cnt == tot)return 0;
}
// cout << i << endl;
if(cnt!=tot and b[i]!=n+1)return 0;
}
// cout << 111 << endl;
return 1;
}
void solve(){
while(q.size())q.pop();while(del.size())del.pop();
cin >> n;
for(int i = 1;i<=n;i++)pre[i] = 0,to[i] = 0;
for(int i = 1;i<=n;i++)cin >> b[i];
int mx =n;
for(int i = 1;i<=n;i++)if(b[i]!=n+1)mx = min(mx,b[i]-i+1);
// for(int i = 1;i<=n;i++)cout << b[i]-i+1 << endl;
//cout <<" " << mx << endl;
if(b[1] == n+1 or mx <= 0){cout << "-1" << '\n';return;}
if(mx == 1){
int ok = 1;
for(int i = 1;i<=n;i++)if(a[i]!=i)ok=0;
if(!ok){cout << "-1" << '\n';return;}
else {
for(int i = 1;i<=n;i++)cout << a[i] << " ";cout << '\n';
}
return;
}
for(int i = 1;i<n;i++){
if(b[i]>b[i+1]){cout << "-1" << '\n';return;}
if(b[i+1]!=b[i]){
pre[b[i+1]] = i;
to[i] = b[i+1];
}
}
for(int i = 1;i<mx;i++)q.push({0,i});
for(int i = 1;i<=n;i++){
if(pre[i] or i == b[1]){
if(pre[i])a[i] = a[pre[i]];
else a[i] = mx;
}else{
if(q.empty()){
cout << -1 << '\n';return;
}
assert(q.size());
a[i] = q.top().second;q.pop();
}
if(!to[i])q.push({i,a[i]});
}
//for(int i = 1;i<=n;i++)cout << a[i] << " ";cout << endl;
if(!check()){cout << -1 << '\n';}
else{
// cout << 1111 << endl;
for(int i = 1;i<=n;i++)cout << a[i] << " ";
cout << '\n';
}
return;
}
signed main(){
// freopen("sing2.in","r",stdin);
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;cin >> t;
while(t--)solve();
return 0;
}/*
1
4
2 4 4 5
10
4
2 4 4 5
10
3 3 3 5 7 7 9 10 10 11
8
3 4 5 6 7 7 8 9
10
7 2 3 11 9 3 10 5 9 1
1
2
4
2 4 5 5
9
3 4 4 5 5 6 7 7 9
8
1 3 4 4 5 6 6 9
4
1 1 1 5
7
2 2 3 4 6 7 8
3
1 2 4
7
1 4 5 5 5 7 8
9
9 6 8 4 6 5 9 5 10
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 11748kb
input:
3 4 3 3 5 5 7 4 6 6 7 8 8 8 5 2 3 4 4 6
output:
1 1 2 2 1 2 3 4 2 1 3 -1
result:
ok 233
Test #2:
score: -100
Wrong Answer
time: 251ms
memory: 25588kb
input:
23198 7 1 2 3 4 5 6 7 7 1 2 3 4 5 6 8 7 1 2 3 4 5 7 7 7 1 2 3 4 5 7 8 7 1 2 3 4 5 8 8 7 1 2 3 4 6 6 7 7 1 2 3 4 6 6 8 7 1 2 3 4 6 7 7 7 1 2 3 4 6 7 8 7 1 2 3 4 6 8 8 7 1 2 3 4 7 7 7 7 1 2 3 4 7 7 8 7 1 2 3 4 7 8 8 7 1 2 3 4 8 8 8 7 1 2 3 5 5 6 7 7 1 2 3 5 5 6 8 7 1 2 3 5 5 7 7 7 1 2 3 5 5 7 8 7 1 2 ...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...
result:
wrong answer oh no! -1