Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1)
1 problems from Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1) (contest 948), difficulty 900-900. 0/1 solutions verified against sample I/O.
Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1)
Div. 2 | 1 problems | 0/1 verified | Difficulty 900-900 | 1m 20s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Protect Sheep | 900 | brute-force, dfs-and-similar, graphs | 15,314 | 1m 20s |
Practice
›
Codeforces Solutions
›
Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1)
›
CF 948A - Protect Sheep
The grid can be viewed as a rectangular graph where each cell is a node connected to its four orthogonal neighbors. Some nodes contain sheep, some contain wolves, and the rest are empty.