# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
890678 |
2023-12-21T18:23:57 Z |
HasanV11010238 |
Poi (IOI09_poi) |
C++17 |
|
471 ms |
24460 KB |
#include <bits/stdc++.h>
using namespace std;
bool comparestudents(vector<int> v1, vector<int> v2){
if (v1[0] < v2[0]){
return true;
}
else if (v1[0] > v2[0]){
return false;
}
if (v1[1] < v2[1]){
return true;
}
else if (v1[1] > v2[1]){
return false;
}
if (v1[2] > v2[2]){
return true;
}
return false;
}
int main(){
int n, t, p, a;
cin>>n>>t>>p;
vector<vector<int>> v(n);
vector<int> co(t, n);
vector<vector<int>> stud;
for (int i = 0; i < n; i++){
for (int j = 0; j < t; j++){
cin>>a;
if (a == 1){
co[j] -= 1;
}
v[i].push_back(a);
}
}
for (int i = 0; i < n; i++){
int coun = 0, points = 0;
for (int j = 0; j < t; j++){
points += v[i][j] * co[j];
coun += v[i][j];
}
stud.push_back({points, coun, i + 1});
}
sort(stud.begin(), stud.end(), comparestudents);
reverse(stud.begin(), stud.end());
for (int i = 0; i < n; i++){
if (stud[i][2] == p){
cout<<stud[i][0]<<" "<<i + 1;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
676 KB |
Output is correct |
11 |
Correct |
14 ms |
1112 KB |
Output is correct |
12 |
Correct |
26 ms |
1876 KB |
Output is correct |
13 |
Correct |
69 ms |
4436 KB |
Output is correct |
14 |
Correct |
100 ms |
5940 KB |
Output is correct |
15 |
Correct |
184 ms |
12880 KB |
Output is correct |
16 |
Correct |
192 ms |
14164 KB |
Output is correct |
17 |
Correct |
278 ms |
17104 KB |
Output is correct |
18 |
Correct |
326 ms |
19540 KB |
Output is correct |
19 |
Correct |
415 ms |
23636 KB |
Output is correct |
20 |
Correct |
471 ms |
24460 KB |
Output is correct |