Description: AC source of uvalive 4849. Algorithms: 2-sat. Meaning of the questions: to n (n <= 3000) coordinates a black box, to ensure that there is no common edge black squares. For each black box to choose a corner as nodes, such that the selected nodes meet a directed graph with no input. Where the distance is the Manhattan distance. Output is solvable. possible or impossible.
To Search:
File list (Check if you may need any files):
UVALive4849.cpp
Download