oj.uz

Submission #715359

# Submission time Handle Problem Language Result Execution time Memory
715359 2023-03-26T14:39:27 Z Toxtaq Poi (IOI09_poi) C++17
85 / 100
 584 ms 16028 KB 
#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;
        }
    }
}

Subtask #1
85.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 19 ms 724 KB Output is correct
12 Incorrect 29 ms 1100 KB Output isn't correct
13 Correct 84 ms 2652 KB Output is correct
14 Correct 124 ms 3660 KB Output is correct
15 Correct 244 ms 6228 KB Output is correct
16 Correct 221 ms 6708 KB Output is correct
17 Incorrect 351 ms 9740 KB Output isn't correct
18 Correct 406 ms 11012 KB Output is correct
19 Incorrect 526 ms 14460 KB Output isn't correct
20 Correct 584 ms 16028 KB Output is correct