HDU5813(多校第七场)——Elegant Construction(模拟构造)

Elegant Construction

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 42    Accepted Submission(s): 21
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
  
  

 

题目：构造一张有向图。保证每个点能到达的点得数量恰好等于a[i]。

思路：按照a[i]排序，针对每个点i，对于每个小于i的点j，看是否有a[i]个数满足a[j]<a[i]。

然后连边即可。

因为连通性肯定是向下连通的。

表达的不是很清楚。

看代码吧。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <cmath>
#include <vector>
using namespace std;
#define MAXN 1010
#define INF 10000000007
#define pi cos(-1)

struct node{
    int cnt;
    int ID;
};

node a[MAXN];

int cmp(node x,node y){
    return x.cnt<y.cnt;
}

vector <int> G[MAXN];

int main(){
    int t;
    scanf("%d",&t);
    int cas=1;
    for(int cas=1;cas<=t;cas++){
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            G[i].clear();
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i].cnt);
            a[i].ID=i;
        }
        sort(a+1,a+n+1,cmp);
        printf("Case #%d: ",cas);
        if(a[1].cnt!=0){
            printf("No\n");
            continue;
        }
        int ok=1;
        int num=0;
        for(int i=2;i<=n;i++){
            for(int j=1;j<i;j++){
                if(a[j].cnt<a[i].cnt){
                    G[a[i].ID].push_back(a[j].ID);
                    num++;
                    if(G[a[i].ID].size()==a[i].cnt)
                        break;
                }
            }
            if(G[a[i].ID].size()<a[i].cnt){
                ok=0;
                break;
            }
        }
        if(ok==0){
            printf("No\n");
            continue;
        }
        printf("Yes\n");
        printf("%d\n",num);
        for(int i=1;i<=n;i++){
            for(int j=0;j<G[i].size();j++){
                printf("%d %d\n",i,G[i][j]);
            }
        }
    }
}