Codeforces 141C Queue 【构造】

题目链接：Codeforces 141C Queue

C. Queue
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
In the Main Berland Bank n people stand in a queue at the cashier, everyone knows his/her height hi, and the heights of the other people in the queue. Each of them keeps in mind number ai — how many people who are taller than him/her and stand in queue in front of him.

After a while the cashier has a lunch break and the people in the queue seat on the chairs in the waiting room in a random order.

When the lunch break was over, it turned out that nobody can remember the exact order of the people in the queue, but everyone remembers his number ai.

Your task is to restore the order in which the people stood in the queue if it is possible. There may be several acceptable orders, but you need to find any of them. Also, you need to print a possible set of numbers hi — the heights of people in the queue, so that the numbers ai are correct.

Input
The first input line contains integer n — the number of people in the queue (1 ≤ n ≤ 3000). Then n lines contain descriptions of the people as “namei ai” (one description on one line), where namei is a non-empty string consisting of lowercase Latin letters whose length does not exceed 10 characters (the i-th person’s name), ai is an integer (0 ≤ ai ≤ n - 1), that represents the number of people who are higher and stand in the queue in front of person i. It is guaranteed that all names are different.

Output
If there’s no acceptable order of the people in the queue, print the single line containing “-1” without the quotes. Otherwise, print in n lines the people as “namei hi”, where hi is the integer from 1 to 109 (inclusive), the possible height of a man whose name is namei. Print the people in the order in which they stand in the queue, starting from the head of the queue and moving to its tail. Numbers hi are not necessarily unique.

Examples
input
4
a 0
b 2
c 0
d 0
output
a 150
c 170
d 180
b 160
input
4
vasya 0
petya 1
manya 3
dunay 3
output
-1

题意：给定n个人以及每个人前面比他高的人数h[i]。让你还原这个队列及每个人的高度。

思路：首先我认为构造的高度需要唯一，虽然题目没有说必须唯一，但是不唯一的话会有trick (ˇˍˇ) 想～。
先按人数升序sort下，这样对于第i个人的h[i]，我们可以贪心的构造值ans[i] = i - h[i] + 1，但是这样是不够的，因为可能导致两个人的高度相等，为了避免这种情况当ans[j] == ans[i](1 <= j < i)时，需要将ans[j]++，但这样又会影响到ans[j] > ans[i](1 <= j < i)，那么直接将所有(1 <= j < i)ans[j] >= ans[i] 全加一就好了。

时间复杂度O(n*n)
AC代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
#define PI acos(-1.0)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
struct Node {
    char name[20]; int h, ans;
};
Node num[3010];
bool cmp(Node a, Node b) {
    return a.h < b.h;
}
int main()
{
    int n;
    while(scanf("%d", &n) != EOF) {
        for(int i = 1; i <= n; i++) {
            scanf("%s%d", num[i].name, &num[i].h);
        }
        sort(num+1, num+n+1, cmp);
        bool flag = true;
        for(int i = 1; i <= n; i++) {
            if(num[i].h > i - 1) {
                flag = false; break;
            }
            num[i].ans = i - num[i].h + 1;
            for(int j = 1; j < i; j++) {
                if(num[j].ans >= num[i].ans) {
                    num[j].ans++;
                }
            }
        }
        if(!flag) {
            printf("-1\n");
        }
        else {
            for(int i = 1; i <= n; i++) {
                printf("%s %d\n", num[i].name, num[i].ans);
            }
        }
    }
    return 0;
}