oj.uz

Submission #440174

# Submission time Handle Problem Language Result Execution time Memory
440174 2021-07-01T16:55:50 Z dxz05 Poi (IOI09_poi) C++14
0 / 100
 814 ms 11992 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2022;

bool solved[MAXN][MAXN];
int cnt[MAXN];

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

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

    fill(cnt, cnt + M, N);

    for (int i = 0; i < N; i++){
        for (int j = 0; j < M; j++){
            cin >> solved[i][j];
            cnt[j] -= solved[i][j];
        }
    }

    for (int i = 0; i < N; i++){
        for (int j = 0; j < M; j++){
            if (solved[i][j]){
                a[i].first.first += cnt[j];
                a[i].first.second++;
            }
        }
        a[i].second = i + 1;
    }

    sort(a, a + N);

    for (int i = 0; i < N; i++){
        if (a[i].second == P){
            cout << a[i].first.first << ' ' << i + 1 << endl;
            return 0;
        }
    }

    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Incorrect 1 ms 292 KB Output isn't correct
5 Incorrect 1 ms 332 KB Output isn't correct
6 Incorrect 1 ms 332 KB Output isn't correct
7 Incorrect 2 ms 460 KB Output isn't correct
8 Incorrect 2 ms 460 KB Output isn't correct
9 Incorrect 4 ms 460 KB Output isn't correct
10 Incorrect 7 ms 716 KB Output isn't correct
11 Incorrect 31 ms 1092 KB Output isn't correct
12 Incorrect 42 ms 1624 KB Output isn't correct
13 Incorrect 120 ms 2748 KB Output isn't correct
14 Incorrect 181 ms 3836 KB Output isn't correct
15 Incorrect 298 ms 5700 KB Output isn't correct
16 Incorrect 325 ms 5968 KB Output isn't correct
17 Incorrect 481 ms 7976 KB Output isn't correct
18 Incorrect 551 ms 9044 KB Output isn't correct
19 Incorrect 728 ms 11616 KB Output isn't correct
20 Incorrect 814 ms 11992 KB Output isn't correct