hdu 5713 Elegant Construction

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.

题意：  n个城镇，修单向路，  要求第i个城镇一定要能到达a[i]城镇。

题解：  将顶点按能到达的点数从小到大排序，排好序之后每个点只能往前面的点连边. 因而如果存在一个排在第i位的点，要求到达的点数大于i-    1，则不可行；否则就可以按照上述方法构造出图. 复杂度O(N^2).

    因为没有最少路的要求，所以直接贪心，把需要连通的城镇多的放最前面，最少的放最后面，依次向后查询。

    然后打出随便一条路径即可

   

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

#define LL long long
#define N 1010
#define mod 1000000007
pair <int,int> a[N];

int main()
{
   int T,n,ca=1,x;
   scanf("%d",&T);
   while(T--)
   {
       int flag=1,ans=0;
       scanf("%d",&n);
       for(int i=1;i<=n;i++)
       {
           scanf("%d",&x);
           a[i]=make_pair(x,i);
       }
       sort(a+1,a+n+1);
       for(int i=1;i<=n;i++)
       {
           if(a[i].first>=i)
           {
               flag=0;break;
           }
           ans+=a[i].first;
       }
       if(flag==0)
       {
           printf("Case #%d: No\n",ca++);
           continue;
       }
       printf("Case #%d: Yes\n%d\n",ca++,ans);
       for(int i=1;i<=n;i++)
           for(int j=1;j<=a[i].first;j++)
               printf("%d %d\n",a[i].second,a[j].second);
   }
   return 0;
}