hdu 4781 Assignment For Princess 构造

AC_vitasoy

于 2014-10-06 13:31:36 发布

阅读量408

点赞数

分类专栏：基本算法——构造文章标签： hdu 4781

本文链接：https://blog.csdn.net/u011580493/article/details/39827815

版权

基本算法——构造专栏收录该内容

4 篇文章 0 订阅

订阅专栏

参考自：http://blog.csdn.net/dyx404514/article/details/16371295

其实可以不用预处理出点与点的距离的，看完参考的思路直接这样做了。。。

AC代码：

/* **********************************************
Created Time: 2014-10-6 10:34:01
File Name   : hdu4781.cpp
*********************************************** */
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <fstream>
#include <cstring>
#include <climits>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <functional>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 105;
const int MAXM = 1005;
int n, m;
int dis[MAXN][MAXN], flag[MAXN][MAXN];
int res[MAXM][3];
bool M[MAXM];
int main()
{
        int T, cas = 0;
        scanf("%d", &T);
        while(T--)
        {
                scanf("%d%d", &n, &m);
                memset(flag, 0, sizeof(flag));
                memset(dis, 0, sizeof(dis));
                memset(M, false, sizeof(M));
                int cotres = 1, dd = 1;
                //
                for(int i = 1;i < n; i++)
                {
                        dis[i][i+1] = dd++;
                        flag[i][i+1] = flag[i+1][i] = 1, M[dd-1] = true;
                        res[cotres][0] = i, res[cotres][1] = i+1, res[cotres][2] = dis[i][i+1];
                        cotres++;
                }
                if(n%3 == 1)
                {
                        dis[n][1] = n+2, flag[n][1] = flag[1][n] = 1, M[n+2] = true;
                        res[cotres][0] = n, res[cotres][1] = 1, res[cotres][2] = dis[n][1];
                        cotres++;
                }
                else
                {
                        dis[n][1] = n, flag[n][1] = flag[1][n] = 1, M[n] = true;
                        res[cotres][0] = n, res[cotres][1] = 1, res[cotres][2] = dis[n][1];
                        cotres++;
                }
                //预处理出点与点的距离
                for(int i = 1;i <= n; i++)
                {
                        for(int j = i+1, cot = 1;cot <= n-1; cot++,j++)
                        {
                                j = j%(n+1);
                                if(j == 0) j = 1;
                                int t = (j-1);
                                if(t == 0) t = n;
                                dis[i][j] = dis[i][t] + dis[t][j];
                        }
                }
                int i;
                for(i = n;i <= m; i++)
                {
                        if(M[i] == true) continue;
                        bool mark = false;
                        for(int t = 1;t <= n; t++)
                        {
                                for(int p = t, cot = 1;cot <= n-1; cot++)
                                {
                                        p = (p+1)%(n+1);
                                        if(p == 0) p = 1;
                                        if(flag[t][p] == 0 && (i%3 == dis[t][p]%3))
                                        {
                                                mark = true;
                                                flag[t][p] = flag[p][t] = 1;
                                                res[cotres][0] = t, res[cotres][1] = p, res[cotres][2] = i;
                                                cotres++;
                                                M[i] = true;
                                                break;
                                        }
                                }
                                if(mark == true) break;
                        }
                        if(mark == false) break;
                }
                printf("Case #%d:\n", ++cas);
                if(i != m+1)
                {
                        puts("-1");
                        continue;
                }
                for(int i = 1;i <= m; i++)
                        printf("%d %d %d\n", res[i][0], res[i][1], res[i][2]);
        }
        return 0;
}