C - Restore Graph CodeForces - 404C BFS+小trick

Valera had an undirected connected graph without self-loops and multiple edges consisting of nvertices. The graph had an interesting property: there were at most k edges adjacent to each of its vertices. For convenience, we will assume that the graph vertices were indexed by integers from 1 to n.

One day Valera counted the shortest distances from one of the graph vertices to all other ones and wrote them out in array d. Thus, element d[i] of the array shows the shortest distance from the vertex Valera chose to vertex number i.

Then something irreparable terrible happened. Valera lost the initial graph. However, he still has the array d. Help him restore the lost graph.

Input

The first line contains two space-separated integers n and k (1 ≤ k < n ≤ 10⁵). Number n shows the number of vertices in the original graph. Number k shows that at most k edges were adjacent to each vertex in the original graph.

The second line contains space-separated integers d[1], d[2], ..., d[n] (0 ≤ d[i] < n). Number d[i] shows the shortest distance from the vertex Valera chose to the vertex number i.

Output

If Valera made a mistake in his notes and the required graph doesn't exist, print in the first line number -1. Otherwise, in the first line print integer m (0 ≤ m ≤ 10⁶) — the number of edges in the found graph.

In each of the next m lines print two space-separated integers a_i and b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i), denoting the edge that connects vertices with numbers a_i and b_i. The graph shouldn't contain self-loops and multiple edges. If there are multiple possible answers, print any of them.

Example

Input

3 2
0 1 1

Output

3
1 2
1 3
3 2

Input

4 2
2 0 1 3

Output

3
1 3
1 4
2 3

Input

3 1
0 0 0

Output

-1

首先判断是否满足条件,然后BFS先连1而后2.3.4.5.6.....n

每个变量都要考虑溢出的情况

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
const int inf_int = 1e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1

using namespace std;
typedef  vector<int> vi;
typedef  long long ll;
typedef  unsigned long long  ull;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;
while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')
fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,
rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
//int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//const int maxn=1e6+10;
const double eps = 1e-9;
//const int inf = 1e5+5;
const int N = 1e5+5;

queue<int> a[N];
vector<pair<int,int>> ans;
int n,k,t;


int bfs()
{
    queue<pair<int,int>> q;
    q.push( make_pair(a[0].front(),0) );
    while(!q.empty())
    {
        int cur = q.front().first;
        int step = q.front().second;
        q.pop();
        int num ;
        if(step==0)
        {
            num = k;
        }
        else
        {
            num = k-1;
        }

        while(!a[step+1].empty()&&num)
        {
            int tt = a[step+1].front();
            a[step+1].pop();
            ans.push_back( make_pair( cur, tt) );
            q.push( make_pair(tt,step+1) );
            num--;
        }
    }
    return 0;
}


int main()
{
//    freopen("data.txt","r",stdin);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        a[t].push(i);
    }

    if(a[0].size()!=1)
    {
        printf("-1\n");
        return 0;
    }

    if(a[1].size()>k)
    {
        printf("-1\n");
        return 0;
    }

    for(int i=1;i<n-1;i++)
    {
        if((ll)a[i+1].size() > (ll)a[i].size()*(k-1) )//need to use long long
        {
            printf("-1\n");
            return 0;
        }
    }

    bfs();
    int ansl =ans.size();
    printf("%d\n",ansl);
    for(int i=0;i<ansl;i++)
    {
        printf("%d %d\n",ans[i].first,ans[i].second);
    }
    return 0;
}