Codeforces Round #335 (Div. 2) D. Lazy Student

D. Lazy Student

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Student Vladislav came to his programming exam completely unprepared as usual. He got a question about some strange algorithm on a graph — something that will definitely never be useful in real life. He asked a girl sitting next to him to lend him some cheat papers for this questions and found there the following definition:

The minimum spanning tree T of graph G is such a tree that it contains all the vertices of the original graph G, and the sum of the weights of its edges is the minimum possible among all such trees.

Vladislav drew a graph with n vertices and m edges containing no loops and multiple edges. He found one of its minimum spanning trees and then wrote for each edge its weight and whether it is included in the found tree or not. Unfortunately, the piece of paper where the graph was painted is gone and the teacher is getting very angry and demands to see the original graph. Help Vladislav come up with a graph so that the information about the minimum spanning tree remains correct.

Input

The first line of the input contains two integers n and m () — the number of vertices and the number of edges in the graph.

Each of the next m lines describes an edge of the graph and consists of two integers a_j and b_j (1 ≤ a_j ≤ 10⁹, b_j = {0, 1}). The first of these numbers is the weight of the edge and the second number is equal to 1 if this edge was included in the minimum spanning tree found by Vladislav, or 0 if it was not.

It is guaranteed that exactly n - 1 number {b_j} are equal to one and exactly m - n + 1 of them are equal to zero.

Output

If Vladislav has made a mistake and such graph doesn't exist, print  - 1.

Otherwise print m lines. On the j-th line print a pair of vertices (u_j, v_j) (1 ≤ u_j, v_j ≤ n, u_j ≠ v_j), that should be connected by the j-th edge. The edges are numbered in the same order as in the input. The graph, determined by these edges, must be connected, contain no loops or multiple edges and its edges with b_j = 1 must define the minimum spanning tree. In case there are multiple possible solutions, print any of them.

Sample test(s)

Input

4 5
2 1
3 1
4 0
1 1
5 0

Output

2 4
1 4
3 4
3 1
3 2

Input

3 3
1 0
2 1
3 1

Output
-1

题意：有一个 n 个点、m 条边的无环无重边图，现在告诉你这m 条边的权值，并且指出了该图的最小生成树上的 n-1 条边(标号为1)，现在要你还原整个图。当然有多组解，只要输出一种可行解就行，若不能还原则输出 -1。

分析：我的想法是，指定最小生成树上的边都是与 点1 直接连接的边，即 1 与 2、3、4、……、n 相连；根据kruskal算法，首先对所有的边按照升序排序，对于标号为 1 的点，按照顺序构成与 1 相连的边，并且沿途存好新增的点，这里我用队列存；对于标号为 0 的边，它只可能由之前得到的除去 1 以外的点所构成，所以当碰到标号为 0 的点，判断一下之前的点是否已经用完，如果用完了则不能构成，直接输出 -1；否则用之前的点构成这条边。

题目链接： http://codeforces.com/contest/606/problem/D

代码清单：

/*******************************************************************************
 *** problem ID  : D.LazyStudent.cpp
 *** create time : Thu Dec 10 19:40:23 2015
 *** author name : nndxy
 *** author blog : http://blog.csdn.net/jhgkjhg_ugtdk77
 *** author motto: never loose enthusiasm for life, life is to keep on fighting!
 *******************************************************************************/

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <vector>
#include <cctype>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

#define exit() return 0
#define setIn(name) freopen(name".in", "r", stdin)
#define setOut(name) freopen(name".out", "w", stdout)
#define debug(x) cout << #x << " = " << x << endl

typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;

const int maxn = 100000 + 5;

struct Edge {
	int dis;
	int mark;
	int idx;
	Edge() {}
	Edge(int _dis, int _mark, int _idx) : dis(_dis), mark(_mark), idx(_idx) {}
};

struct Graph { 
	int u, v;
	Graph() {}
	Graph(int _u, int _v) : u(_u), v(_v) {} 
};

struct Queue {
	int po;     //新增点的标号
	int nu;     //当前可与新增点相连的点最小标号
	Queue() {}
	Queue(int _po, int _nu) : po(_po), nu(_nu) {}
};

int n, m;
Edge edge[maxn];
Graph graph[maxn];

void input() {
	scanf("%d%d", &n ,&m);
	for(int i = 1; i <= m; i++) {
		scanf("%d%d",&edge[i].dis, &edge[i].mark);
		edge[i].idx = i;
	}
}

bool cmp(Edge a, Edge b) {
	if(a.dis == b.dis) return a.mark > b.mark;
	else return a.dis < b.dis;
}

void solve() {
	sort(edge+1, edge+1+m, cmp);
	int num = 1;
	queue <Queue> q;
	for(int i = 1; i <= m; i++) {
		if(edge[i].mark == 1) {
			graph[edge[i].idx] = Graph(1, ++num);
			q.push(Queue(num, num+1));
		}
		else {
			int cnt = 0;
			bool check = false;
			while(!q.empty()) {
				if(q.front().nu  <= num) {
					graph[edge[i].idx] = Graph(q.front().po, q.front().nu);
					q.front().nu++;
					check = true;
					break;
				}
				else {
					q.push(q.front());
					q.pop();
				}
				cnt++;
				if(cnt == q.size()) break;
			}
			if(!check) {
				puts("-1");
				return;
			}
		}
	}

	for(int i = 1; i <= m; i++) {
		printf("%d %d\n", graph[i].u, graph[i].v);
	}	
}

int main() {
	//setIn("in");
	input();
	solve();
	exit();
}