1109. Group Photo (25) 排序、模拟
2016-04-06 15:14
435 查看
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:
The number of people in each row must be N/K (round down to the nearest integer), with all the extra people (if any) standing in the last row;
All the people in the rear row must be no shorter than anyone standing in the front rows;
In each row, the tallest one stands at the central position (which is defined to be the position (m/2+1), where m is the total number of people in that row, and the division result must be rounded down to the nearest integer);
In each row, other people must enter the row in non-increasing order of their heights, alternately taking their positions first to the right and then to the left of the tallest one (For example, given five people with their heights 190, 188, 186, 175, and 170, the final formation would be 175, 188, 190, 186, and 170. Here we assume that you are facing the group so your left-hand side is the right-hand side of the one at the central position.);
When there are many people having the same height, they must be ordered in alphabetical (increasing) order of their names, and it is guaranteed that there is no duplication of names.
Now given the information of a group of people, you are supposed to write a program to output their formation.
Input Specification:
Each input file contains one test case. For each test case, the first line contains two positive integers N (<=10000), the total number of people, and K (<=10), the total number of rows. Then N lines follow, each gives the name of a person (no more than 8 English letters without space) and his/her height (an integer in [30, 300]).
Output Specification:
For each case, print the formation – that is, print the names of people in K lines. The names must be separated by exactly one space, but there must be no extra space at the end of each line. Note: since you are facing the group, people in the rear rows must be printed above the people in the front rows.
Sample Input:
10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159
Sample Output:
Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John
建一个结构体储存每个人的姓名、身高。
按身高从大到小、姓名字典序排序。
从后往前按排处理每一排:
确定该行的数据范围,注意如果有多出来的人该怎么办。
用两个vector来记录站到中间的人左右的人。
输出时注意特殊情况下的格式。
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Formation is very important when taking a group photo. Given the rules of forming K rows with N people as the following:
The number of people in each row must be N/K (round down to the nearest integer), with all the extra people (if any) standing in the last row;
All the people in the rear row must be no shorter than anyone standing in the front rows;
In each row, the tallest one stands at the central position (which is defined to be the position (m/2+1), where m is the total number of people in that row, and the division result must be rounded down to the nearest integer);
In each row, other people must enter the row in non-increasing order of their heights, alternately taking their positions first to the right and then to the left of the tallest one (For example, given five people with their heights 190, 188, 186, 175, and 170, the final formation would be 175, 188, 190, 186, and 170. Here we assume that you are facing the group so your left-hand side is the right-hand side of the one at the central position.);
When there are many people having the same height, they must be ordered in alphabetical (increasing) order of their names, and it is guaranteed that there is no duplication of names.
Now given the information of a group of people, you are supposed to write a program to output their formation.
Input Specification:
Each input file contains one test case. For each test case, the first line contains two positive integers N (<=10000), the total number of people, and K (<=10), the total number of rows. Then N lines follow, each gives the name of a person (no more than 8 English letters without space) and his/her height (an integer in [30, 300]).
Output Specification:
For each case, print the formation – that is, print the names of people in K lines. The names must be separated by exactly one space, but there must be no extra space at the end of each line. Note: since you are facing the group, people in the rear rows must be printed above the people in the front rows.
Sample Input:
10 3
Tom 188
Mike 170
Eva 168
Tim 160
Joe 190
Ann 168
Bob 175
Nick 186
Amy 160
John 159
Sample Output:
Bob Tom Joe Nick
Ann Mike Eva
Tim Amy John
建一个结构体储存每个人的姓名、身高。
按身高从大到小、姓名字典序排序。
从后往前按排处理每一排:
确定该行的数据范围,注意如果有多出来的人该怎么办。
用两个vector来记录站到中间的人左右的人。
输出时注意特殊情况下的格式。
#include<iostream> #include<vector> #include<algorithm> #include<string> using namespace std; const int maxn = 10001; struct Stu{ string id; int height; }stu[maxn]; bool cmp(Stu a,Stu b){ if(a.height != b.height) return a.height > b.height; else return a.id < b.id; } void print(vector<int> &vi,bool judge){ for(int i = 0;i < vi.size();i++){ if(judge) cout << stu[vi[vi.size()-i-1]].id; else cout << stu[vi[i]].id; if(i < vi.size()-1) cout << ' '; } } int main(){ int n,k; cin >> n >> k; for(int i = 0;i < n;i++){ cin >> stu[i].id >> stu[i].height; } sort(stu,stu+n,cmp); int start = 0; for(int i = 0;i < k;i++){ int End = start+n/k; vector<int> L,R; if(i==0 && n%k) End += n%k; for(int j = start+1;j < End;j++){ if((j-start)%2) L.push_back(j); else R.push_back(j); } print(L,1); if(L.size()) cout << ' '; cout << stu[start].id; if(R.size()) cout << ' '; print(R,0); cout << endl; start = End; //next row } return 0; }
相关文章推荐
- 服务器日志的目录
- Java中ArrayList和LinkedList区别
- 结对编程项目——四则运算vs版
- Java的MyBatis框架中对数据库进行动态SQL查询的教程
- 四元树
- Navicat连接Oracle
- 网站建设(附加1)——域名的(DNS)解析设置
- Knight Moves
- Knight Moves
- V-Play入门手册1-如何在5分钟内把你游戏或应用程序带到你的移动设备上?
- XUtils===XUtils3框架的基本使用方法(二)
- mbps
- RtlPrefixUnicodeString routine
- list 转 set 排序问题
- 返回一个二维整数数组中最大联通子数组的和
- (LinkedList)Intersection of Two Linked Lists
- Hololens 开发环境配置
- Python运算符
- HDU1754 线段树 单点修改 最大值(基础题)
- iOS 定位