-
Notifications
You must be signed in to change notification settings - Fork 71
/
Copy path1109_Group Photo (25).cpp
106 lines (89 loc) · 2.42 KB
/
1109_Group Photo (25).cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/* K为排数,开始弄错成每行人数,sigh!*/
/* 参考的简洁写法*/
#include <bits/stdc++.h>
using namespace std;
class Person {
public:
string name;
int height;
};
vector<Person> personArr;
int main() {
string name;
int n, k, height, w;
cin >> n >> k;
if (k > n) k = 1;
w = n / k;
for (int i = 0; i < n; i++) {
cin >> name >> height;
personArr.push_back({name, height});
}
sort(personArr.begin(), personArr.end(), [&](const Person &a, const Person &b) {
if (a.height == b.height) return a.name > b.name;
else return a.height < b.height;
});
string ans, line;
for (int i = 0; i < k; i++) {
int lo = i*w, hi = (i+1)*w;
if (hi + w > n) hi = n;
string line = personArr[hi-1].name;
for (int j = hi-2; j >= lo; j--) {
if (j%2 == hi%2)
line = personArr[j].name + " " + line;
else
line = line + " " + personArr[j].name;
}
ans = line + "\n" + ans;
}
cout << ans;
return 0;
}
/* 最初的冗余版本 */
#include <bits/stdc++.h>
using namespace std;
class Person {
public:
string name;
int height;
};
vector<Person> personArr;
int main() {
string name;
int n, k, height, num;
cin >> n >> k;
if (k > n) k = 1;
num = n / k;
swap(num, k);
for (int i = 0; i < n; i++) {
cin >> name >> height;
personArr.push_back({name, height});
}
sort(personArr.begin(), personArr.end(), [&](const Person &a, const Person &b) {
if (a.height == b.height) return a.name < b.name;
else return a.height > b.height;
});
string ans;
int offset = n % k;
if (offset) {
string line = "";
line += personArr[0].name;
for (int i = 1; i < k+offset; i++) {
if (i % 2) line = personArr[i].name + " " + line;
else line = line + " " + personArr[i].name;
}
ans = ans + line + "\n";
num -= 1;
}
for (int i = 0; i < num; i++) {
string line = "";
line += personArr[(offset ? (i+1)*k+offset : i*k)].name;
for (int j = 1; j < k; j++) {
int pos = (offset ? (i+1)*k+offset : i*k) + j;
if (j % 2) line = personArr[pos].name + " " + line;
else line = line + " " + personArr[pos].name;
}
ans = ans + line + "\n";
}
cout << ans;
return 0;
}