oj.uz

Submission #440186

# Submission time Handle Problem Language Result Execution time Memory
440186 2021-07-01T17:10:52 Z dxz05 Poi (IOI09_poi) C++14
100 / 100
 838 ms 4404 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2022;

bool sol[MAXN][MAXN];
int cnt[MAXN];

pair<pair<int, int>, int> a[MAXN];

int points[MAXN], solved[MAXN];

int main(){
    int N, M, P;
    cin >> N >> M >> P;

    for (int i = 1; i <= N; i++){
        for (int j = 1; j <= M; j++){
            cin >> sol[i][j];
            cnt[j] += sol[i][j];
        }
    }

    vector<int> v(N);
    for (int i = 1; i <= N; i++){
        v[i - 1] = i;
        for (int j = 1; j <= M; j++){
            if (sol[i][j]){
                points[i] += N - cnt[j];
                solved[i]++;
            }
        }
       // cout << points[i] << ' ' << solved[i] << endl;
    }

    sort(v.begin(), v.end(), [](int i, int j){
        if (points[i] > points[j]) return true;
        if (points[i] == points[j] && solved[i] > solved[j]) return true;
        if (points[i] == points[j] && solved[i] == solved[j]) return i < j;
        return false;
    });

    cout << points[P] << ' ';

    for (int i = 0; i < N; i++){
        if (v[i] == P){
            cout << i + 1 << endl;
            return 0;
        }
    }

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 7 ms 588 KB Output is correct
11 Correct 31 ms 788 KB Output is correct
12 Correct 41 ms 1220 KB Output is correct
13 Correct 121 ms 1684 KB Output is correct
14 Correct 192 ms 2372 KB Output is correct
15 Correct 307 ms 2636 KB Output is correct
16 Correct 327 ms 2804 KB Output is correct
17 Correct 484 ms 3352 KB Output is correct
18 Correct 557 ms 3608 KB Output is correct
19 Correct 739 ms 4320 KB Output is correct
20 Correct 838 ms 4404 KB Output is correct