C - Mocha and Hiking（模拟）

缺乏、安全感 2022-09-05 15:44 100阅读 0赞

第一次错误：没有考虑到走到中间的位置d，然后直接走到n+1，接着走d+1一直走到n，这样的情况就是判断是否 满足：**第i个位置为0**，**第i+1个位置为1**

第二次错误：处理边界的时候大意了，把受到：**原题目中n没有路到n+1**的影响，直接i < n ，实际上是i <= n;

// Problem: C. Mocha and Hiking
    // Contest: Codeforces - Codeforces Round #738 (Div. 2)
    // URL: https://codeforces.com/contest/1559/problem/C
    // Memory Limit: 256 MB
    // Time Limit: 1000 ms
    // 
    // Powered by CP Editor (https://cpeditor.org)
    
    #include<iostream>
    #include<cstdio>
    #include<string>
    #include<ctime>
    #include<cmath>
    #include<cstring>
    #include<algorithm>
    #include<stack>
    #include<climits>
    #include<queue>
    #include<map>
    #include<set>
    #include<sstream>
    #include<cassert>
    #include<bitset>
    #include<list>
    #include<unordered_map>
    using namespace std;
    #define lowbit(x) (x&-x)
    #define pf(a) printf("%d\n",a)
    #define mem(x,y) memset(x,y,sizeof(x))
    #define dbg(x) cout << #x << " = " << x << endl
    #define rep(i,l,r) for(int i = l; i <= r; i++)
    #define fep(i,a,b) for(int i=b;i>=a;--i)
    typedef long long ll;
    typedef unsigned long long ull;
    
    const int inf=0x3f3f3f3f;
    const int N=1e5+100;
    int n;
    int arr[N];
    
    void solve()
    { 
    	cin >> n;
    	bool f = false;
    	int d = -1;
    	rep(i,1,n)
    	{ 
    		cin >> arr[i];
    		if(i<=n && i > 1 && arr[i]==1 && arr[i-1]==0)
    		{ 
    			d = i - 1;
    			f = true;
    		}
    	}
    
    	if(f)
    	{ 
    		rep(i,1,d) cout << i << " ";
    		cout << n + 1 << " ";
    		rep(i,d+1,n) cout << i << " ";
    		cout << endl;
    		return;
    	}
    	if(arr[1]==1) 
    	{ 
    		cout << n + 1 << " ";
    		rep(i,1,n) cout << i <<" ";
    		cout << endl;
    		return ;
    	}
    	if(arr[n]==0)
    	{ 
    		rep(i,1,n+1) cout << i << " ";
    		cout << endl;
    		return ;
    	}
    	cout << -1 << endl;
    	
    }
    
    int main()
    { 
    
    	ios::sync_with_stdio(false);cin.tie(0);
    	int Case;cin >> Case;
    	while(Case--)
    		solve();
    	return 0;
    }