codeforces-scrape

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

687A.md (2524B)


      1 Source: https://codeforces.com/problemset/problem/687/A
      2 
      3 A. NP-Hard Problem
      4 
      5 time limit per test
      6 
      7 2 seconds
      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 Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
     22 
     23 Suppose the graph *G* is given. Subset *A* of its vertices is called a vertex cover of this graph, if for each edge *uv* there is at least one endpoint of it in this set, i.e. ![](https://espresso.codeforces.com/01df7772bf62e4ead52b462423b3d53890cdd820.png) or ![](https://espresso.codeforces.com/4a270f9b8acd044f93b92f335e44798f6c60929d.png) (or both).
     24 
     25 Pari and Arya have won a great undirected graph as an award in a team contest. Now they have to split it in two parts, but both of them want their parts of the graph to be a vertex cover.
     26 
     27 They have agreed to give you their graph and you need to find two disjoint subsets of its vertices *A* and *B*, such that both *A* and *B* are vertex cover or claim it's impossible. Each vertex should be given to no more than one of the friends (or you can even keep it for yourself).
     28 
     29 Input
     30 
     31 The first line of the input contains two integers *n* and *m* (2 ≤ *n* ≤ 100 000, 1 ≤ *m* ≤ 100 000) — the number of vertices and the number of edges in the prize graph, respectively.
     32 
     33 Each of the next *m* lines contains a pair of integers *u**i* and *v**i* (1  ≤  *u**i*,  *v**i*  ≤  *n*), denoting an undirected edge between *u**i* and *v**i*. It's guaranteed the graph won't contain any self-loops or multiple edges.
     34 
     35 Output
     36 
     37 If it's impossible to split the graph between Pari and Arya as they expect, print "-1" (without quotes).
     38 
     39 If there are two disjoint sets of vertices, such that both sets are vertex cover, print their descriptions. Each description must contain two lines. The first line contains a single integer *k* denoting the number of vertices in that vertex cover, and the second line contains *k* integers — the indices of vertices. Note that because of *m* ≥ 1, vertex cover cannot be empty.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 4 2  
     47 1 2  
     48 2 3
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 1  
     55 2   
     56 2  
     57 1 3
     58 ```
     59 
     60 Input
     61 
     62 ```
     63 3 3  
     64 1 2  
     65 2 3  
     66 1 3
     67 ```
     68 
     69 Output
     70 
     71 ```
     72 -1
     73 ```
     74 
     75 Note
     76 
     77 In the first sample, you can give the vertex number 2 to Arya and vertices numbered 1 and 3 to Pari and keep vertex number 4 for yourself (or give it someone, if you wish).
     78 
     79 In the second sample, there is no way to satisfy both Pari and Arya.