Who‘s the boss?
| Time Limit: 5000MS | Memory Limit: 30000K | |
| Total Submissions: 2773 | Accepted: 1142 |
Description
Several surveys indicate that the taller you are, the higher you can climb the corporate ladder. At TALL Enterprises Inc. this "de facto standard" has been properly formalized: your boss is always at least as tall as you are. Furthermore, you can safely assume
that your boss earns a bit more than you do. In fact, you can be absolutely sure that your immediate boss is the person who earns the least among all the employees that earn more than you and are at least as tall as you are. Furthermore, if you are the immediate
boss of someone, that person is your subordinate, and all his subordinates are your subordinates as well. If you are nobody‘s boss, then you have no subordinates. As simple as these rules are, many people working for TALL are unsure of to whom they should
be turning in their weekly progress report and how many subordinates they have. Write a program that will help in determining for any employee who the immediate boss of that employee is and how many subordinates they have. Quality Assurance at TALL have devised
a series of tests to ensure that your program is correct. These test are described below.
Input
On the first line of the input is a single positive integer n, telling the number of test scenarios to follow. Each scenario begins with a line containing two positive integers m and q, where m (at most 30000) is the number of employees and q (at most 200)
is the number of queries. The following m lines each list an employee by three integers on the same line: employee ID number (six decimal digits, the first one of which is not zero), yearly salary in Euros and finally height in μm (1 μm = 10-6 meters
- accuracy is important at TALL). The chairperson is the employee that earns more than anyone else and is also the tallest person in the company. Then there are q lines listing queries. Each query is a single legal employee ID.
The salary is a positive integer which is at most 10 000 000. No two employees have the same ID,and no two employees have the same salary. The height of an employee is at least 1 000 000 μm and at most 2 500 000 μm.
Output
For each employee ID x in a query output a single line with two integers y k, separated by one space character, where y is the ID of x‘s boss, and k is the number of subordinates of x. If the query is the ID of the chairperson, then you should output 0 as the
ID of his or her boss (since the chairperson has no immediate boss except, possibly, God).
Sample Input
2 3 3 123456 14323 1700000 123458 41412 1900000 123457 15221 1800000 123456 123458 123457 4 4 200002 12234 1832001 200003 15002 1745201 200004 18745 1883410 200001 24834 1921313 200004 200002 200003 200001
Sample Output
123457 0 0 2 123458 1 200001 2 200004 0 200004 0 0 3
Source
ACcode：
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 30010
using namespace std;
int hash[1000000];
int stack[maxn],top=0;
struct woker{
int id;
int wage;
int height;
int boss;
int nsub;
void in(){
scanf("%d%d%d",&id,&wage,&height);
boss=0;
nsub=1;
}
void on(){
printf("id %d wage %d height %d boss %d nsub %d\n",id,wage,height,boss,nsub);
}
}my[maxn];
bool cmp(woker a,woker b){
return a.wage<b.wage;
}
int main(){
int loop,n,m;
scanf("%d",&loop);
while(loop--){
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)my[i].in();
sort(my,my+n,cmp);
for(int i=0;i<n;++i){
hash[my[i].id]=i;
}
top=0;
for(int i=0;i<n;i++){
while(top&&my[stack[top-1]].height<=my[i].height){
my[stack[top-1]].boss=my[i].id;
my[i].nsub+=my[stack[top-1]].nsub;
top--;
}
stack[top++]=i;
}
/**for(int i=0;i<n;++i){
printf("%d",i);
my[i].on();
}**/
int t,k;
for(int i=0;i<m;++i){
scanf("%d",&t);
k=hash[t];
printf("%d %d\n",my[k].boss,my[k].nsub-1);
}
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。
POJ 1634 Who's the boss?