[Codeforces] Round #286 (Div. 2) A、B

505A - Mr. Kitayuta's Gift

题意：给定由小写字母构成的字符串，可以在任意位置插入一个小写字符，问能否构成回文串？

由于数据范围小，直接三层for循环暴力即可。

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <assert.h>
#include <time.h>
typedef long long LL;
const int INF = 500000001;
const double EPS = 1e-9;
const double PI = acos(-1.0);
using namespace std;
int main()
{
    #ifdef _Test
        freopen("test0.in", "r", stdin);
        freopen("test0.out", "w", stdout);
        srand(time(NULL));
    #endif
    char ch[100];
    char tmp[100];
    int flag;
    while(~scanf("%s", ch))
    {
        flag = 0;
        int len = strlen(ch);
        int cnt;
        for(int i = 0; i <= len; i++)
        {
            for(int k = 0; k < 26; k++)
            {
                cnt = 0;
                for(int j = 0; j <= len; j++)
                {
                    if(i == j)
                    {
                        tmp[cnt++] = k+'a';
                    }
                    tmp[cnt++] = ch[j];
                }
                int flg = 1;
                for(int j = 0; j < (len + 1) / 2; j++)
                {
                    if(tmp[j] != tmp[len-j])
                    {
                        flg = 0;
                        break;
                    }
                }
                tmp[cnt] = '\0';
                if(flg)
                {
                    flag = 1;
                    puts(tmp);
                    break;
                }
            }
            if(flag)
            {
                break;
            }
        }
        if(!flag) puts("NA");
    }
    return 0;
}

505B - Mr. Kitayuta's Colorful Graph

题意：在无向图中，给定很多个结点，有很多条边，每条边有不同的颜色，询问两个点之间，直接或间接连通的路径上颜色相同的种数。

直接用vector建图，DFS即可。用set存储颜色。

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <assert.h>
#include <time.h>
typedef long long LL;
const int INF = 500000001;
const double EPS = 1e-9;
const double PI = acos(-1.0);
using namespace std;
pair<int, int> node;
vector<pair<int, int> > v[101];
int vis[105], uu, vv, ans;
set<int> s;
void dfs(int u, int color)
{
    if(u == vv)
    {
        if(s.find(color) == s.end()) ++ans;
        s.insert(color);
        return ;
    }
    int len = v[u].size();
    for(int i = 0; i < len; i++)
    {
        if(vis[v[u][i].first] == -1 &&  (color == -1 || color == v[u][i].second))
        {
            vis[v[u][i].first] = 1;
            dfs(v[u][i].first, v[u][i].second);
            vis[v[u][i].first] = -1;
        }
    }
}
int main()
{
    #ifdef _Test
        freopen("test0.in", "r", stdin);
        freopen("test0.out", "w", stdout);
        srand(time(NULL));
    #endif
    int n, m, q;
    while(~scanf("%d %d", &n, &m))
    {
        for(int i = 0; i < m; i++)
        {
            int a, b, c;
            scanf("%d %d %d", &a, &b, &c);
            node.first = b;
            node.second = c;
            v[a].push_back(node);
            node.first = a;
            v[b].push_back(node);
        }
        scanf("%d", &q);
        for(int i = 0; i < q; i++)
        {
            ans = 0;
            scanf("%d %d", &uu, &vv);
            memset(vis, -1, sizeof(vis));
            vis[uu] = 1;
            dfs(uu, -1);
            printf("%d\n", ans);
            s.clear();
        }
        for(int i = 0; i <= n; i++)
        {
            v[i].clear();
        }
    }
    return 0;
}