forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathE.cpp
More file actions
58 lines (46 loc) · 1.76 KB
/
E.cpp
File metadata and controls
58 lines (46 loc) · 1.76 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
int n, x, a, b, c;
int next_rand() {
int y = (x * a + b) % c;
x = y;
return x;
}
pair<int,string> teams[111];
int main() {
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
while (cin >> n) {
cin >> x >> a >> b >> c;
FOR(i,1,n) cin >> teams[i].second >> teams[i].first;
sort(teams+1, teams+n+1);
reverse(teams+1, teams+n+1);
vector<string> bask[4];
int m = n / 4;
FOR(i,1,n) {
bask[(i - 1) / m].push_back(teams[i].second);
}
// REP(t,4) PR0(bask[t], bask[t].size());
REP(turn,m) {
cout << "Group " << (char) ('A' + turn) << ":\n";
int s = bask[0].size();
int u = next_rand() % s;
int v = next_rand() % s;
int w = next_rand() % s;
int z = next_rand() % s;
cout << bask[0][u] << endl << bask[1][v] << endl << bask[2][w] << endl << bask[3][z] << endl;
bask[0].erase(bask[0].begin() + u);
bask[1].erase(bask[1].begin() + v);
bask[2].erase(bask[2].begin() + w);
bask[3].erase(bask[3].begin() + z);
}
}
return 0;
}