-
Notifications
You must be signed in to change notification settings - Fork 0
/
1075.cpp
122 lines (109 loc) · 2.16 KB
/
1075.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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
using namespace std;
class Student {
public:
int id;
vector<int> p;
vector<int> done;
int total;
int perfect;
};
bool cmp(const Student &lhs, const Student &rhs) {
if(lhs.total != rhs.total) {
return lhs.total > rhs.total;
}
else {
if(lhs.perfect != rhs.perfect) {
return lhs.perfect > rhs.perfect;
}
else {
return lhs.id < rhs.id;
}
}
}
int main(int argc, char *argv[]) {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int N, K, M;
cin >> N >> K >> M;
vector<int> full(K);
for(int i = 0; i < K; ++i)
cin >> full[i];
vector<Student> v(N);
for(int i = 0; i < N; ++i) {
vector<int> tmp(K, -1);
vector<int> tmp2(K, -2);
v[i].p = tmp;
v[i].done = tmp2;
v[i].total = 0;
v[i].perfect = 0;
}
for(int i = 0; i < M; ++i) {
int sid, pid, score;
cin >> sid >> pid >> score;
sid--;
pid--;
if(score >= 0)
v[sid].done[pid] = 0;
v[sid].p[pid] = max(v[sid].p[pid], score);
v[sid].p[pid] = max(v[sid].p[pid], 0);
//if(score != -1) {
// v[sid].total += score;
// if(full[pid] == score)
// v[sid].perfect += 1;
//}
v[sid].id = sid;
}
for(int i = 0; i < v.size(); ++i) {
v[i].total = 0;
for(int j = 0; j < K; ++j) {
if(v[i].p[j] != -1)
v[i].total += v[i].p[j];
if(full[j] == v[i].p[j])
v[i].perfect += 1;
}
}
sort(v.begin(), v.end(), cmp);
vector<Student> result;
for(int i = 0; i < v.size(); ++i) {
bool allNone = true;
/*if(v[i].total != 0)
allNone = false;*/
for(int j = 0; j < K; ++j) {
if(-2 != v[i].done[j]) {
allNone = false;
break;
}
}
if(allNone)
continue;
result.push_back(v[i]);
}
int pre = result[0].total, curRank = 1, num = 0;
for(int i = 0; i < result.size(); ++i) {
if(result[i].total != pre) {
curRank += num;
num = 1;
pre = result[i].total;
}
else {
++num;
}
printf("%d %05d %d", curRank, result[i].id + 1, result[i].total);
for(int j = 0; j < K; ++j) {
if(result[i].p[j] == -1)
printf(" -");
else
printf(" %d", result[i].p[j]);
}
printf("\n");
}
return 0;
}