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.

样例输入

样例输出

题目大意：

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

分析：

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

AC代码：

 /*************************************************Author       :    NIYOUDUOGAOLast modified:   2018-08-24 10:00Email        :  pjm000@163.comFilename     :   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;
}

upc 8377 Playoff(搜索)相关推荐

upc 8377: Playoff（搜索-dfs）
8377: Playoff 题目描述: The Minato Mirai Football Association hosts its annual championship as a single ...
8377: Playoff
8377: Playoff 时间限制: 2 Sec 内存限制: 128 MB 提交: 99 解决: 28 [提交] [状态] [讨论版] [命题人:admin] 题目描述 The Minato M ...
东南亚本地商ERP仓储系统怎么样？
什么是ERP管理系统,说白了ERP管理系统它只是一个辅助工具,只能说可能帮助你更好的运营自己的店铺,那么ERP管理系统到底有哪些作用,今天给大家大致讲解一下管理系统说白了就是一个管理系统,它并不能决 ...
upc组队赛5 Election of Evil【搜索】
Election of Evil 题目描述 Dylan is a corrupt politician trying to steal an election. He has already used ...
【DFS反向建图记忆化搜索】UPC Contest2592 - 2020年秋季组队训练赛第十四场问题 D: Mysterious Treasure
问题 D: Mysterious Treasure 时间限制: 1 Sec 内存限制: 128 MB 题目描述 WNJXYK and DIDIDI is playing a game. DIDIDI ...
【upc】2020年秋季组队训练赛第十四场 Get Strong | 折半搜索、二分
题目描述 WNJXYK and DIDIDI are friends. They are thinking about getting strong all the time. They are pl ...
【搜索】Playoff （dfs暴力枚举+剪枝）
题目描述 The Minato Mirai Football Association hosts its annual championship as a single round-robin tou ...
[搜索]Playoff
题目描述 The Minato Mirai Football Association hosts its annual championship as a single round-robin tou ...
UPC第41场，第42场部分题解
UPC第41场,第42场部分题解第41场 A: LR Constraints We have N cards arranged in a row from left to right. We wil ...

upc 8377 Playoff(搜索)

8377: Playoff

upc 8377 Playoff(搜索)相关推荐

最新文章

热门文章