All submissions for this problem are available.You are in charge of organizing a drag racing championship. The competition will be held at a large empty field, which can be modelled as an infinite plane. The most important thing is to take a lot of cool photos for the media, so you've identified $n$ points in the plane with the most beautiful scenery. Each of these points has to be a midpoint of a separate track, and each track has to be aligned with one of cardinal directions (either horizontal or vertical). Of course, no tracks may have a common point due to obvious safety reasons. Finally, all tracks should have equal length $2d$ for some integer $d$ so that all competitors are in equal conditions. You now want to find the largest length of the tracks so that directions can be chosen for each track without any possible collision. ###Input: The first line of input contains $T$, i.e. number of test cases per file. The first line of each test case contains a single integer $n$ $-$ the number of tracks ($1 \leq n \leq 100\,000$). Each of the next $n$ lines contains two integers $x_i$ and $y_i-$ midpoint of the respective track ($0 \leq x_i, y_i \leq 10^9$). All $n$ points are distinct. ###Output: On the first line print a single integer $-$ the largest non-negative number $d$ such that directions of tracks of length $2d$ with given midpoints can be chosen without any collisions, or $-1$ if $d$ can be arbitrarily large. On the following line print a string of $n$ characters `|` and `-`, denoting directions of the tracks in the same order as given in the input. ###Constraints - $1 \leq T \leq 5$ - $1 \leq n \leq 100\,000$ - $0 \leq x_i, y_i \leq 10^9$ - **All $n$ points are distinct.** ###Sample Input: ``` 3 4 0 0 2 0 0 2 2 2 3 0 0 1 0 0 1 3 0 0 1 0 2 2 ``` ###Sample Output: ``` 1 -||- 0 --- -1 ||| ```
|Time Limit:||3 - 10 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.