oj.uz

Submission #871937

# Submission time Handle Problem Language Result Execution time Memory
871937 2023-11-12T00:50:45 Z _uros9 Poi (IOI09_poi) C++17
100 / 100
 236 ms 39668 KB 
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;


signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);


    int n,t,p;
    cin >> n >> t >> p;
    vector<vector<int>> matr(n,vector<int>(t));
    for(auto&x:matr){
        for(auto&xx:x)
            cin >> xx;
    }
    vector<int> poeni(t,0);
    for(int j=0; j<t; j++){
        for(int i=0; i<n; i++){
            if(matr[i][j]==0)
                poeni[j]++;
        }
    }
    vector<pair<pair<int,int>,int>> niz(n);
    for(int i=0; i<n; i++){
        int br_poena=0;
        for(int j=0; j<t; j++){
            if(matr[i][j]==1)
                br_poena+=poeni[j];
        }
        niz[i]={{-br_poena,-count(matr[i].begin(),matr[i].end(),1)},i};
    }
    sort(niz.begin(),niz.end());
    for(int i=0; i<n; i++){
        if(niz[i].second==p-1)
            cout << -niz[i].first.first << " " << i+1;
    }

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 7 ms 1628 KB Output is correct
12 Correct 11 ms 2396 KB Output is correct
13 Correct 32 ms 6140 KB Output is correct
14 Correct 46 ms 8796 KB Output is correct
15 Correct 91 ms 15164 KB Output is correct
16 Correct 93 ms 16212 KB Output is correct
17 Correct 129 ms 24012 KB Output is correct
18 Correct 151 ms 27188 KB Output is correct
19 Correct 236 ms 35740 KB Output is correct
20 Correct 222 ms 39668 KB Output is correct