【状压bfs】ctsc 1999 补丁vs错误

最新推荐文章于 2020-08-15 22:42:24 发布

FAreStorm

最新推荐文章于 2020-08-15 22:42:24 发布

阅读量509

点赞数

分类专栏：题解文章标签： bfs ctsc 水题状态压缩

本文链接：https://blog.csdn.net/FAreStorm/article/details/49328609

版权

题解专栏收录该内容

32 篇文章 0 订阅

订阅专栏

水题随便A

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
int dist[2000000];
int js[100];
struct lyd
{
    int s1,s2,c1,c2,time;
}a[200];
queue<int> Q;

int main()
{
    int n,m;
    cin >> n >> m;
    js[1] = 1;
    for(int i = 2;i <= 30;i ++)
        js[i] = (js[i-1] << 1);
    memset(dist,63,sizeof(dist));
    for(int i = 1;i <= m;i ++)
    {
        cin >> a[i].time;
        char ch[100];
        scanf("%s",ch);
        for(int k = 0;k < n;k ++)
        {
            if(ch[k] == '+')
                a[i].s1 += js[k+1];
            if(ch[k] == '-')
                a[i].s2 += js[k+1];
        }
        scanf("%s",ch);
        for(int k = 0;k < n;k ++)
        {
            if(ch[k] == '+')
                a[i].c1 += js[k+1];
            if(ch[k] == '-')
                a[i].c2 += js[k+1];
         }
    }
    dist[js[n+1]-1] = 0;
    Q.push(js[n+1]-1);
    while(!Q.empty())
    {
        int p = Q.front();
        Q.pop();
        for(int i = 1;i <= m;i ++)
        {
            if((p&a[i].s1) == a[i].s1 && ((~p)&a[i].s2) == a[i].s2)
            {
                int k = (p|a[i].c1)^(p&a[i].c2);
                if(dist[k] > dist[p] + a[i].time)
                {
                    dist[k] = dist[p] + a[i].time;
                    Q.push(k);
                }
            }
        }
    }
    if(dist[0] != 1061109567)
        cout << dist[0] << endl;
    else
        cout << 0 << endl;
    return 0;
}