HDU 5540 Secrete Master Plan（水）

最新推荐文章于 2019-04-18 08:34:01 发布

围巾的ACM

最新推荐文章于 2019-04-18 08:34:01 发布

阅读量573

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/52027013

水题专栏收录该内容

159 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断两组四个角上的士兵部署计划是否相同。通过旋转和平移操作，该算法能快速验证两个部署方案是否一致。

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

思路：水

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>

#define INF 0x3f3f3f3f
#define esp 1e-9
typedef long long LL;
using namespace std;
int T,a[4],b[4],cas=1;
bool slove()
{
	for(int i=0;i<4;i++)
	{
		bool flag=1;
		for(int j=0;j<4;j++) if(a[(j+8)%4]!=b[(i+j+8)%4]) flag=0;
		if(flag) return 1;
		//flag=1;
		//for(int j=0;j<4;j++) if(a[(j+8)%4]!=b[(i-j+8)%4]) flag=0;
		//if(flag) return 1;
	}
	return 0;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d%d%d",a+0,a+1,a+3,a+2);
		scanf("%d%d%d%d",b+0,b+1,b+3,b+2);
		printf("Case #%d: %s\n",cas++,slove()?"POSSIBLE":"IMPOSSIBLE");
	}
    return 0;
}

Description

Master Mind KongMing gave Fei Zhang a secrete master plan stashed in a pocket. The plan instructs how to deploy soldiers on the four corners of the city wall. Unfortunately, when Fei opened the pocket he found there are only four numbers written in dots on a piece of sheet. The numbers form

matrix, but Fei didn't know the correct direction to hold the sheet. What a pity!

Given two secrete master plans. The first one is the master's original plan. The second one is the plan opened by Fei. As KongMing had many pockets to hand out, he might give Fei the wrong pocket. Determine if Fei receives the right pocket.

Input

The first line of the input gives the number of test cases,

test cases follow. Each test case contains 4 lines. Each line contains two integers

and

(

). The first two lines stands for the original plan, the

and

line stands for the plan Fei opened.

Output

For each test case, output one line containing " Case #x: y", where x is the test case number
(starting from 1) and

is either "POSSIBLE" or "IMPOSSIBLE" (quotes for clarity).

Sample Input

Sample Output

Case #1: POSSIBLE
Case #2: POSSIBLE
Case #3: IMPOSSIBLE
Case #4: POSSIBLE