# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715359 | Toxtaq | Poi (IOI09_poi) | C++17 | 584 ms | 16028 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
struct Person{
long long point = 0, num_of_solved = 0, indx = 1;
friend bool operator<(Person &a, Person &b){
if(a.point == b.point)return a.num_of_solved > b.num_of_solved;
return a.point > b.point;
}
};
int main()
{
int n, t, p;
cin >> n >> t >> p;
vector<vector<int>>v(n + 1, vector<int>(t + 1));
for(int i = 1;i <= n;++i){
for(int j = 1;j <= t;++j){
cin >> v[i][j];
}
}
vector<int>point_for_each_task(t + 1);
for(int i = 1;i <= t;++i){
for(int j = 1;j <= n;++j){
point_for_each_task[i] += (v[j][i] == 0);
}
}
vector<Person>people(n);
for(int i = 1;i <= n;++i){
for(int j = 1;j <= t;++j){
if(v[i][j])people[i - 1].point += point_for_each_task[j];
people[i - 1].num_of_solved += (v[i][j] == 1);
}
people[i - 1].indx = i;
}
sort(people.begin(), people.end());
for(int i = 0;i < n;++i){
if(people[i].indx == p){
cout << people[i].point << " " << i + 1;
return 0;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |