oj.uz

Submission #717701

# Submission time Handle Problem Language Result Execution time Memory
717701 2023-04-02T11:03:05 Z ZeroCool Poi (IOI09_poi) C++14
100 / 100
 246 ms 16052 KB 
#include <bits/stdc++.h>
#define ll long long
#define inf INT_MAX
#define endl '\n'

using namespace std;

const int mxn = 20;

struct Person{
    int point = 0, num_of_solved = 0, indx = 0;
    
};

bool comp(Person a, Person b){
    if(a.point == b.point && a.num_of_solved == b.num_of_solved)return a.indx < b.indx;
    else if(a.point == b.point)return a.num_of_solved > b.num_of_solved;
    return a.point > b.point;
}



void solve(){
    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(),comp);
    for(int i = 0;i < n;++i){
        if(people[i].indx == p){
            cout << people[i].point << " " << i + 1;
            return;
        }
    }

}
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    //cin>>t;
    while(t--) solve();
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 7 ms 724 KB Output is correct
12 Correct 12 ms 1108 KB Output is correct
13 Correct 36 ms 2680 KB Output is correct
14 Correct 48 ms 3668 KB Output is correct
15 Correct 84 ms 6236 KB Output is correct
16 Correct 92 ms 6704 KB Output is correct
17 Correct 135 ms 9760 KB Output is correct
18 Correct 163 ms 11028 KB Output is correct
19 Correct 244 ms 14512 KB Output is correct
20 Correct 246 ms 16052 KB Output is correct