#PU570. USACO 2015 December Contest, Silver — Problem 1. Switching on the Lights

    ID: 1222 传统题 文件IO:lightson 2000ms 256MiB 尝试: 0 已通过: 0 难度: 提高 上传者: 标签>USACO赛事:dec15来源:usaco.orgscoring:equal_test_cases广搜

USACO 2015 December Contest, Silver — Problem 1. Switching on the Lights

USACO 2015 December Contest, Silver — Problem 1. Switching on the Lights

题目描述

Farmer John has recently built an enormous barn consisting of an N×NN \times N grid of rooms (2≤N≤1002 \leq N \leq 100), numbered from (1,1)(1,1) up to (N,N)(N,N). Being somewhat afraid of the dark, Bessie the cow wants to turn on the lights in as many rooms as possible. Bessie starts in room (1,1)(1,1), the only room that is initially lit. In some rooms, she will find light switches that she can use to toggle the lights in other rooms; for example there might be a switch in room (1,1)(1,1) that toggles the lights in room (1,2)(1,2). Bessie can only travel through lit rooms, and she can only move from a room (x,y)(x,y) to its four adjacent neighbors (x−1,y)(x-1,y), (x+1,y)(x+1,y), (x,y−1)(x,y-1) and (x,y+1)(x,y+1) (or possibly fewer neighbors if this room is on the boundary of the grid). Please determine the maximum number of rooms Bessie can illuminate.

输入格式

The first line of input contains integers NN and MM (1≤M≤20,0001 \leq M \leq 20,000). The next MM lines each describe a single light switch with four integers xx, yy, aa, bb, that a switch in room (x,y)(x,y) can be used to toggle the lights in room (a,b)(a,b). Multiple switches may exist in any room, and multiple switches may toggle the lights of any room.

输出格式

lightson.out): A single line giving the maximum number of rooms Bessie can illuminate.

数据范围

(见题面原文)

样例

样例 1

3 6
1 1 1 2
2 1 2 2
1 1 1 3
2 3 3 1
1 3 1 2
1 3 2 1
5
Here, Bessie can use the switch in $(1,1)$ to turn on 
lights in $(1,2)$ and $(1,3)$. She can then walk to $(1,3)$ and turn on the lights in 
$(2,1)$, from which she can turn on the lights in $(2,2)$.  The switch in 
$(2,3)$ is inaccessible to her, being in an unlit room.  She can therefore 
illuminate at most 5 rooms.
Problem credits: Austin Bannister and Brian Dean