zoukankan      html  css  js  c++  java
  • hdu 5813 Elegant Construction (构造)

    Elegant Construction

    Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 1022    Accepted Submission(s): 535
    Special Judge

    Problem Description
    Being an ACMer requires knowledge in many fields, because problems in this contest may use physics, biology, and even musicology as background. And now in this problem, you are being a city architect!
    A city with N towns (numbered 1 through N) is under construction. You, the architect, are being responsible for designing how these towns are connected by one-way roads. Each road connects two towns, and passengers can travel through in one direction.

    For business purpose, the connectivity between towns has some requirements. You are given N non-negative integers a1 .. aN. For 1 <= i <= N, passenger start from town i, should be able to reach exactly ai towns (directly or indirectly, not include i itself). To prevent confusion on the trip, every road should be different, and cycles (one can travel through several roads and back to the starting point) should not exist.

    Your task is constructing such a city. Now it's your showtime!
     
    Input
    The first line is an integer T (T <= 10), indicating the number of test case. Each test case begins with an integer N (1 <= N <= 1000), indicating the number of towns. Then N numbers in a line, the ith number ai (0 <= ai < N) has been described above.
    Output
    For each test case, output "Case #X: Y" in a line (without quotes), where X is the case number starting from 1, and Y is "Yes" if you can construct successfully or "No" if it's impossible to reach the requirements.

    If Y is "Yes", output an integer M in a line, indicating the number of roads. Then M lines follow, each line contains two integers u and v (1 <= u, v <= N), separated with one single space, indicating a road direct from town u to town v. If there are multiple possible solutions, print any of them.
     
    Sample Input
    3 3 2 1 0 2 1 1 4 3 1 1 0
     
    Sample Output
    Case #1: Yes 2 1 2 2 3 Case #2: No Case #3: Yes 4 1 2 1 3 2 4 3 4
    Author
    SYSU
     
    Source
    Recommend
    wange2014
     
    题目:从底层强行构造
    #include <iostream>
    #include<cstdio>
    #include<vector>
    #include<cstring>
    #include<string>
    #include<queue>
    #include<algorithm>
    
    using namespace std;
    int n,m,T;
    bool vis[1005];
    vector<int> mp[1005];
    struct node
    {
        int k,id;
    }a[1005];
    
    bool cmp(node a,node b)
    {
        return a.k<b.k;
    }
    
    int main()
    {
        scanf("%d",&T);
        for(int cas=1;cas<=T;cas++)
        {
            scanf("%d",&n);
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a[i].k);
                a[i].id=i;
                mp[i].clear();
            }
            sort(a+1,a+1+n,cmp);
    
            printf("Case #%d: ",cas);
    
            bool flag=1;
            for(int i=1;i<=n;i++)
            if (a[i].k>i-1) {flag=0; break;}
            if (flag) printf("Yes
    ");
               else {printf("No
    ");continue;}
    
            int way=0;
            for(int i=1;i<=n;i++)
            {
               way+=a[i].k;
               for(int j=1;j<=a[i].k;j++)
               mp[a[i].id].push_back(a[j].id);
            }
            printf("%d
    ",way);
            for(int i=1;i<=n;i++)
            {
                for(int j=0;j<mp[i].size();j++)
                    printf("%d %d
    ",i,mp[i][j]);
            }
        }
        return 0;
    }
  • 相关阅读:
    解决The current branch is not configured for pull No value for key branch.master.merge found in confi
    使用Eclipse构建Maven项目 (step-by-step)
    ecpilise引入Maven项目目录不正常,无JRE,无Maven Dependencies
    解决Eclipse建立Maven项目后无法建立src/main/java资源文件夹的办法
    Could not resolve archetype org.apache.maven.archetypes:maven-archetype-webapp:RELEASE from any of the configured repositories.
    (转) launch failed.Binary not found in Linux/Ubuntu解决方案
    .c_str()/atoi()/
    (转)Should I use char** argv or char* argv[]
    (转) int argc, char* argv[] 的用法
    (转) 制作 Clonezilla live 启动盘
  • 原文地址:https://www.cnblogs.com/stepping/p/7169076.html
Copyright © 2011-2022 走看看