oj.uz

답안 #532898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532898 2022-03-04T07:53:52 Z alextodoran Poi (IOI09_poi) C++17
100 / 100
 275 ms 11996 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;



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

    int n, m, k;
    cin >> n >> m >> k; k--;
    bool solved[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> solved[i][j];
        }
    }
    int points[m];
    for (int j = 0; j < m; j++) {
        points[j] = 0;
        for (int i = 0; i < n; i++) {
            points[j] += !solved[i][j];
        }
    }
    ll score[n];
    int cnt[n];
    for (int i = 0; i < n; i++) {
        score[i] = 0;
        cnt[i] = 0;
        for (int j = 0; j < m; j++) {
            if (solved[i][j]) {
                cnt[i]++;
                score[i] += points[j];
            }
        }
    }
    int better = 0;
    for (int i = 0; i < n; i++) {
        if (i != k) {
            if (score[i] != score[k]) {
                better += (score[i] > score[k]);
            } else if (cnt[i] != cnt[k]) {
                better += (cnt[i] > cnt[k]);
            } else {
                better += (i < k);
            }
        }
    }
    cout << score[k] << " " << 1 + better << "\n";

    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 2 ms 352 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 9 ms 668 KB Output is correct
12 Correct 15 ms 844 KB Output is correct
13 Correct 41 ms 2012 KB Output is correct
14 Correct 57 ms 2756 KB Output is correct
15 Correct 109 ms 4688 KB Output is correct
16 Correct 114 ms 5052 KB Output is correct
17 Correct 164 ms 7236 KB Output is correct
18 Correct 209 ms 8292 KB Output is correct
19 Correct 245 ms 10832 KB Output is correct
20 Correct 275 ms 11996 KB Output is correct