POJ 3279 Fliptile 【棋盘翻转问题】【状态压缩】

Emiya丶

于 2018-09-17 20:50:06 发布

阅读量988

点赞数

分类专栏： POJ题解

本文链接：https://blog.youkuaiyun.com/qq_37405320/article/details/82748186

版权

本文介绍了POJ 3279 Fliptile问题，这是一个关于棋盘翻转的智力挑战。任务是帮助奶牛确定翻转黑白方格以使所有方格变白所需的最小翻转次数。翻转会同时影响相邻的方格。如果可能，输出字典序最小的翻转方案；若不可能，则输出"IMPOSSIBLE"。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fliptile

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 16922		Accepted: 6194

Description

Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is colored black on one side and white on the other side.

As one would guess, when a single white tile is flipped, it changes to black; when a single black tile is flipped, it changes to white. The cows are rewarded when they flip the tiles so that each tile has the white side face up. However, the cows have rather large hooves and when they try to flip a certain tile, they also flip all the adjacent tiles (tiles that share a full edge with the flipped tile). Since the flips are tiring, the cows want to minimize the number of flips they have to make.

Help the cows determine the minimum number of flips required, and the locations to flip to achieve that minimum. If there are multiple ways to achieve the task with the minimum amount of flips, return th

最低0.47元/天解锁文章