hdu 5813 暴力

链接：戳这里

Elegant Construction

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

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

题意：

长度为n的整数序列表示第i个节点可以到达ai个节点(有向边) ，问是否存在这样一棵树满足条件

思路：

没有要求是最少的边，所以直接暴力连边就可以了

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<iomanip>
#include<cmath>
#include<bitset>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
#define INF (1ll<<60)-1
#define Max 1e9
using namespace std;
int T;
struct node{
    int a,id;
    bool operator < (const node &t)const{
        return a<t.a;
    }
}s[1010];
vector<pair<int,int> > V;
int n;
int main(){
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++){
        V.clear();
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&s[i].a);
            s[i].id=i;
        }
        sort(s+1,s+n+1);
        int f=0;
        for(int i=1;i<=n;i++){
            if(s[i].a>i-1){
                f=1;
                break;
            }
            for(int j=1;j<=s[i].a;j++){
                V.push_back(make_pair(s[i].id,s[j].id));
            }
        }
        printf("Case #%d: ",cas);
        if(f) printf("No\n");
        else {
            printf("Yes\n");
            printf("%d\n",V.size());
            for(int i=0;i<V.size();i++){
                auto t=V[i];
                printf("%d %d\n",t.first,t.second);
            }
        }
    }
    return 0;
}