hdu 4068 枚举 SanguoSHA

最新推荐文章于 2017-11-05 15:48:00 发布

Julyana_Lin

最新推荐文章于 2017-11-05 15:48:00 发布

阅读量609

点赞数

CC 4.0 BY-SA版权

分类专栏：纯暴力文章标签： permutation string date

本文链接：https://blog.youkuaiyun.com/Julyana_Lin/article/details/7931192

纯暴力专栏收录该内容

9 篇文章

订阅专栏

本文通过一个具体的编程实例，详细介绍了暴力枚举算法的应用过程。文章重点讲解了如何使用C++实现暴力枚举，并通过一系列的输入输出示例来验证算法的正确性和有效性。

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

暴力枚举。代码能力有待提高，比赛的时候老是敲错，多敲题。我要！加油！！！Lin！！！

/*
Pro: 0

Sol:

date:
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
using namespace std;
int t,n;
string people[10];
map <string , int> mp;
int a[10],b[10];
bool grid[10][10];
int main(){
    scanf("%d",&t);
    for(int ca = 1; ca <= t; ca ++){
        scanf("%d",&n);
        mp.clear();
        memset(grid,false,sizeof(grid));

        for(int i = 1; i <= n;i ++)
            cin >> people[i];
        sort(people + 1, people + 1 + n);
        for(int i = 1; i <= n; i ++)
            mp[people[i]] = i;
        for(int i = 1; i <= n; i ++){
            int k;  char name[20];
            scanf("%d",&k);
            while(k --){
                scanf("%s",name);
                grid[i][mp[name]] = true;// a can defeat b
            }
        }
        for(int i = 1; i <= n; i ++)    a[i] = i;

        bool flag ;
        do{
            //for every a sequence
            for(int j = 1; j <= n; j ++)
                b[j] = j;
            flag = true;
            do{
                int pa = 1; int pb = 1;

                while(pa <= n && pb <= n){
                    if(grid[b[pb]][a[pa]]) // b can defeat a
                        pa ++;
                    else
                        pb ++;
                }
                if(pa > n) flag = false;// i lose once, then this sequence is not the answer

            }while(next_permutation(b + 1, b + 1 + n));
            if(flag) break;//represents that a all wins

        }while(next_permutation(a + 1, a + 1 + n));

//        for(int i = n; i > 1; i --)
//            printf("%d ",a[i]); printf("%d\n",a[1]);

        printf("Case %d: ",ca);
        if(flag) {
            printf("Yes\n");
            for(int i = 1; i < n; i++)
                printf("%s ",people[a[i]].c_str());    printf("%s\n",people[a[n]].c_str());
        }else
            printf("No\n");
    }
	return 0;
}