-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathC.cpp
More file actions
79 lines (70 loc) · 1.18 KB
/
C.cpp
File metadata and controls
79 lines (70 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
//#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
{
int n;
cin>>n;
bool vis[n]={0};
ll a[n];
vector<int> v;
fab(0,n,i)
{cin>>a[i];
a[i]--;
if(a[i]==-1)
v.pb(i);
else
vis[a[i]]=1;
}
// for(auto i:v)
// cout<<i<<" ";
// cout<<endl;
int j=0;
fab(0,n,i)
{
if(vis[i]==0)
{
//cout<<"i:"<<i<<endl;
if(i==v[j])
{
//cout<<"FDGF"<<v[j]<<endl;
if(j==0)
swap(v[j],v[j+1]);
else swap(v[j],v[j-1]);
}
//cout<<"vj:"<<v[j]<<endl;
j++;
}
}
j=0;
fab(0,n,i)
{
if(vis[i]==0)
{
a[v[j]]=i;
j++;
}
}
fab(0,n,i)
cout<<a[i]+1<<" ";
cout<<endl;
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}