PAT Advanced 1148 Werewolf - Simple Version （20）

题目描述

Input Specification:

Output Specification:

Sample Input:

Sample Output:

解题思路

大概是被现实狼人杀搞得晕头转向。。9月考的时候拿到这题懵了。。不知道怎么判断真假。。最后也没写出来，痛定思痛，看了大佬们的代码，发现。。逻辑题基本就是按题干说的来判断。。好好反省

Code

• AC代码

#include<bits/stdc++.h>
using namespace std;
int N, wolves;
int vis[110], id[110];
vector<int> v;
void dfs(vector<int> res) {
	if(res.size() == wolves) {
		vector<int> liers;
		for(int i = 1; i<=N; i++) {
			if(id[abs(v[i])] * v[i] < 0) {
				liers.push_back(i);
			}
		}
		if(liers.size() == 2 && id[liers[0]] + id[liers[1]] == 0) {
			cout << res[0] << " " << res[1] << '\n';
			exit(0);
		}
		return;
	}
	for(int i = 1; i<=N; i++) {
		if(!vis[i]) {
			vis[i] = 1;
			id[i] = -1;
			res.push_back(i);
			dfs(res);
			res.pop_back();
			id[i] = 1;
			vis[i] = 0;
		}
	}
}
int main() {
	//freopen("in.txt", "r", stdin);
	cin >> N;
	v.resize(N+1, 0);
	for(int i = 1; i<=N; i++) {
		cin >> v[i];
		id[i] = 1;
	}
	vector<int> res;
	wolves = 2;
	dfs(res);
	cout << "No Solution\n";
	return 0;
}

总结

top版链接