zoukankan      html  css  js  c++  java
  • CF746G New Roads

    G. New Roads
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads.

    That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cities.

    In the construction plan t integers a1, a2, ..., at were stated, where t equals to the distance from the capital to the most distant city, concerning new roads. ai equals the number of cities which should be at the distance i from the capital. The distance between two cities is the number of roads one has to pass on the way from one city to another.

    Also, it was decided that among all the cities except the capital there should be exactly k cities with exactly one road going from each of them. Such cities are dead-ends and can't be economically attractive. In calculation of these cities the capital is not taken into consideration regardless of the number of roads from it.

    Your task is to offer a plan of road's construction which satisfies all the described conditions or to inform that it is impossible.

    Input

    The first line contains three positive numbers nt and k (2 ≤ n ≤ 2·105, 1 ≤ t, k < n) — the distance to the most distant city from the capital and the number of cities which should be dead-ends (the capital in this number is not taken into consideration).

    The second line contains a sequence of t integers a1, a2, ..., at (1 ≤ ai < n), the i-th number is the number of cities which should be at the distance i from the capital. It is guaranteed that the sum of all the values ai equals n - 1.

    Output

    If it is impossible to built roads which satisfy all conditions, print -1.

    Otherwise, in the first line print one integer n — the number of cities in Berland. In the each of the next n - 1 line print two integers — the ids of cities that are connected by a road. Each road should be printed exactly once. You can print the roads and the cities connected by a road in any order.

    If there are multiple answers, print any of them. Remember that the capital has id 1.

    Examples
    input
    Copy
    7 3 3
    2 3 1
    output
    7
    1 3
    2 1
    2 6
    2 4
    7 4
    3 5
    input
    Copy
    14 5 6
    4 4 2 2 1
    output
    14
    3 1
    1 4
    11 6
    1 2
    10 13
    6 10
    10 12
    14 12
    8 4
    5 1
    3 7
    2 6
    5 9
    input
    Copy
    3 1 1
    2
    output
    -1

     【代码】

    #include<cstdio>
    #include<algorithm>
    using namespace std;
    int n,t,k,a[300000],Max=0,Min=0;
    int main() {
        scanf("%d%d%d",&n,&t,&k);
        a[0]=0;
        for(int i=1; i<=t; i++) {
            scanf("%d",&a[i]);
            if(a[i]>a[i-1])Min+=a[i]-a[i-1];
            Max+=a[i]-1;
        }
        Max++;
        if(k<Min||k>Max)puts("-1");
        else{
            printf("%d
    ",n);
            int T=Max-k,tot=a[1]+2;
            for(int i=2;i<=a[1]+1;i++)
                printf("1 %d
    ",i);
            for(int i=2;i<=t;i++){
                int tt=min(a[i-1],a[i])-1,ttt=0;
                while(tt>0&&T>0){
                    if(ttt>0)tt--,T--;
                    printf("%d %d
    ",tot-a[i-1]+ttt,tot+ttt); 
                    ttt++;
                }
                if(tt==0||T==0){
                    while(ttt<a[i]){
                        printf("%d %d
    ",tot-a[i-1],tot+ttt);
                        ttt++;
                    }
                }
                tot+=a[i];
            }
        }
        return 0;
    }
  • 相关阅读:
    DropDownList控件的AutoPostBack属性的问题 选择后,值也跟着刷新 Kenny
    window showModalDialog 在IE6 IE7 高度(height) 问题 Kenny
    discuz初玩之一 未将对象引用设置到对象的实例(Discuz.Forum.HttpModule.ReUrl_BeginRequest) Kenny
    最长公共子串问题 LCS
    HDOJ 1024
    项目一周工作总结
    DartCloud技术难点、问题及经验教训
    中国云项目遇到的问题
    我的计算机书单
    翻转句子中单词的顺序 面试题
  • 原文地址:https://www.cnblogs.com/kcfzyhq/p/8516225.html
Copyright © 2011-2022 走看看