# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
717731 |
2023-04-02T11:44:57 Z |
lukatasev |
Poi (IOI09_poi) |
C++14 |
|
536 ms |
16216 KB |
#include <iostream>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n,t,p;
int num;
cin>>n>>t>>p;
int taskPoint[2001] = {0};
map<int, vector<int> > student;
for(int i=1; i<=n; i++) {
vector<int> temp;
for(int j=1; j<=t; j++) {
cin>>num;
temp.push_back(num);
if(num == 0) {
taskPoint[j] += 1;
}
}
student.insert({i, temp});
}
set<pair<int, int> > studentPoints;
int tempNum;
for(auto x: student) {
tempNum = 0;
for(auto y: x.second) {
tempNum += taskPoint[y];
}
studentPoints.insert({tempNum, x.first});
}
int mesto=0;
for(auto x: studentPoints) {
mesto++;
if(x.second == p) {
cout<<mesto<<" "<<x.first<<endl;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
10 |
Incorrect |
4 ms |
340 KB |
Output isn't correct |
11 |
Incorrect |
18 ms |
724 KB |
Output isn't correct |
12 |
Incorrect |
27 ms |
1116 KB |
Output isn't correct |
13 |
Incorrect |
82 ms |
2624 KB |
Output isn't correct |
14 |
Incorrect |
121 ms |
3740 KB |
Output isn't correct |
15 |
Incorrect |
200 ms |
6308 KB |
Output isn't correct |
16 |
Incorrect |
221 ms |
6764 KB |
Output isn't correct |
17 |
Incorrect |
324 ms |
9884 KB |
Output isn't correct |
18 |
Incorrect |
363 ms |
11164 KB |
Output isn't correct |
19 |
Incorrect |
473 ms |
14644 KB |
Output isn't correct |
20 |
Incorrect |
536 ms |
16216 KB |
Output isn't correct |