codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1559C.md (2344B)


      1 Source: https://codeforces.com/problemset/problem/1559/C
      2 
      3 C. Mocha and Hiking
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 The city where Mocha lives in is called Zhijiang. There are $n+1$ villages and $2n-1$ directed roads in this city.
     22 
     23 There are two kinds of roads:
     24 
     25 * $n-1$ roads are from village $i$ to village $i+1$, for all $1\leq i \leq n-1$.
     26 * $n$ roads can be described by a sequence $a_1,\ldots,a_n$. If $a_i=0$, the $i$-th of these roads goes from village $i$ to village $n+1$, otherwise it goes from village $n+1$ to village $i$, for all $1\leq i\leq n$.
     27 
     28 Mocha plans to go hiking with Taki this weekend. To avoid the trip being boring, they plan to go through every village exactly once. They can start and finish at any villages. Can you help them to draw up a plan?
     29 
     30 Input
     31 
     32 Each test contains multiple test cases.
     33 
     34 The first line contains a single integer $t$ ($1 \le t \le 20$) — the number of test cases. Each test case consists of two lines.
     35 
     36 The first line of each test case contains a single integer $n$ ($1 \le n \le 10^4$) — indicates that the number of villages is $n+1$.
     37 
     38 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \le a_i \le 1$). If $a_i=0$, it means that there is a road from village $i$ to village $n+1$. If $a_i=1$, it means that there is a road from village $n+1$ to village $i$.
     39 
     40 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^4$.
     41 
     42 Output
     43 
     44 For each test case, print a line with $n+1$ integers, where the $i$-th number is the $i$-th village they will go through. If the answer doesn't exist, print $-1$.
     45 
     46 If there are multiple correct answers, you can print any one of them.
     47 
     48 Example
     49 
     50 Input
     51 
     52 ```
     53 2
     54 3
     55 0 1 0
     56 3
     57 1 1 0
     58 ```
     59 
     60 Output
     61 
     62 ```
     63 1 4 2 3 
     64 4 1 2 3
     65 ```
     66 
     67 Note
     68 
     69 In the first test case, the city looks like the following graph:
     70 
     71 ![](https://espresso.codeforces.com/2b531271dcca56d08630a940979d4ca66c211144.png)
     72 
     73 So all possible answers are $(1 \to 4 \to 2 \to 3)$, $(1 \to 2 \to 3 \to 4)$.
     74 
     75 In the second test case, the city looks like the following graph:
     76 
     77 ![](https://espresso.codeforces.com/1ce6ad585930c098bf45211fa8363b7401ba9f29.png)
     78 
     79 So all possible answers are $(4 \to 1 \to 2 \to 3)$, $(1 \to 2 \to 3 \to 4)$, $(3 \to 4 \to 1 \to 2)$, $(2 \to 3 \to 4 \to 1)$.