upc 8377 Playoff(搜索)

                                                    8377: Playoff

                                                             时间限制: 2 Sec  内存限制: 128 MB
 

题目描述

The Minato Mirai Football Association hosts its annual championship as a single round-robin tournament, in which each team plays a single match against all the others. Unlike many other round-robin tournaments of football, matches never result in a draw in this tournament. When the regular time match is a tie, overtime is played, and, when it is a tie again, a penalty shootout is played to decide the winner.
If two or more teams won the most number of matches in the round-robin, a playoff is conducted among them to decide the champion. However, if the number of teams is an odd number, it is possible that all the teams may have the same number of wins and losses, in which case all the teams participate in the playoff, called a "full playoff" here.
Now, some of the tournament matches have already been played and we know their results. Whether or not a full playoff will be required may depend on the results of the remaining matches. Write a program that computes the number of win/loss combination patterns of the remaining matches that lead to a full playoff.
The first datatset of the Sample Input represents the results of the first three matches in a round-robin tournament of five teams, shown in the following table. In the table, gray cells indicate the matches not played yet.

In this case, all the teams win the same number of matches with only two win/loss combination patterns of the remaining matches, which lead to a full playoff, as shown below. In the two tables, the differences are indicated in light yellow.

 

输入

The input consists of multiple datasets, each in the following format.
n
m
x1 y1 
... 
xm ym 
n is an odd integer, 3, 5, 7, or 9, indicating the number of teams participating in the tournament. m is a positive integer less than n(n−1)/2, which is the number of matches already finished. xi and yi give the result of the i-th match that has already taken place, indicating that team xi defeated team yi. Each of xi and yi is an integer 1 through n which indicates the team number. No team plays against itself, that is, for any i, xi ≠ yi. The match result of the same team pair appears at most once. That is, if i ≠ j, then (xi,yi) ≠ (xj,yj) and (xi,yi) ≠ (yj,xj) hold.

The end of the input is indicated by a line containing a zero. The number of datasets does not exceed 100.

 

输出

For each dataset, output a single line containing one integer which indicates the number of possible future win/loss patterns that a full playoff will be required.

 

样例输入

5
3
3 2
4 1
5 1
3
1
1 2
3
2
1 2
3 2
5
4
4 1
4 2
5 1
5 2
5
3
4 1
4 2
5 1
5
4
3 2
4 1
5 1
5 2
9
11
6 1
6 4
7 2
7 3
7 4
8 2
8 3
8 4
9 1
9 3
9 5
9
10
6 1
6 4
7 2
7 3
7 4
8 2
8 3
8 4
9 1
9 3
5
6
4 3
2 1
5 1
2 4
1 3
2 3
9
1
1 2
0

 

样例输出

2
1
0
0
1
0
0
16
0
1615040

 

 

 

 

题目大意：

n (3， 5， 7， 9) 只队伍进行比赛， 初始给你 m 组获胜情况， 问如果要使每只队伍输赢场数相同， 最终的比赛结果一共有多少种情况

 

 

 

 

分析：

3， 5， 7 直接爆搜就行， 不会超时， n == 9 的时候会超时， 特判几种特殊情况也ok 

 

 

 

 

 

 

AC代码：

 /*************************************************
       Author       :	NIYOUDUOGAO
       Last modified:	2018-08-24 10:00
       Email        :	pjm000@163.com
       Filename     :	tmp.cpp
 *************************************************/
#include <bits/stdc++.h>
#define mset(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int n, m;
int mp[15][15];
int cnt[15];
int res, sum;
void dfs(int x, int y) {
	if (cnt[x] > (n - 1) / 2 || cnt[y] > (n - 1) / 2) {
		return;
	}
	if (sum >= (n * n - n) / 2) {
		res++;
		return;
	}

	if (mp[x][y]) {
		if (y >= n) {
			dfs(x + 1, x + 2);
		} else {
			dfs(x, y + 1);
		}
		return;
	}
	if (cnt[x] < (n - 1) / 2) {
		cnt[x]++; sum++;
		if (y >= n) {
			dfs(x + 1, x + 2);
		} else {
			dfs(x, y + 1);
		}
		cnt[x]--; sum--;
	}
	if (cnt[y] < (n - 1) / 2) {
		cnt[y]++; sum++;
		if (y >= n) {
			dfs(x + 1, x + 2);
		} else {
			dfs(x, y + 1);
		}
		cnt[y]--; sum--;
	}
}
int main() {
    std::ios::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
	//freopen("input","r", stdin);
    while (cin >> n >> m && n) {
		int x, y;
		mset(mp, 0), mset(cnt, 0);
		if (n == 9 && m == 2) {
			int x1, x2, y1, y2;
			cin >> x1 >> y1 >> x2 >> y2;
			if (x1 == x2) {
				cout << 692160  << "\n";
			}
			else {
				cout << 807520 << "\n";
			}
			continue;
		} 
		for (int i = 1; i <= m; i++) {
			cin >> x >> y;
			mp[x][y] = mp[y][x] = 1;
			cnt[x]++;
		}
		if (n == 9) {
			if (m == 0) {
				cout << "32300800\n";
				continue;
			}
			else if (m == 1) {
				cout << "1615040\n"; 
				continue;
			}
		}
		res = 0, sum = m;
		dfs(1, 2);
		cout << res << "\n";
	}
    return 0;
}