Submission #489411

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
489411	2021-11-22T21:23:47 Z	Alexandruabcde	Poi (IOI09_poi)	C++14	100 / 100	301 ms	16132 KB

poi

#include <bits/stdc++.h>

using namespace std;

constexpr int NMAX = 2005;

int N, T, P;
int mat[NMAX][NMAX];
int cnt[NMAX];
int value[NMAX];

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

    cin >> N >> T >> P;

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

    for (int j = 1; j <= T; ++ j ) {
        int val = 0;
        for (int i = 1; i <= N; ++ i )
            val += (1 - mat[i][j]);

        for (int i = 1; i <= N; ++ i )
            value[i] += val * mat[i][j];
    }

    int pos = 0;
    for (int i = 1; i <= N; ++ i ) {
        if (value[i] > value[P]) ++ pos;
        else if (value[i] == value[P] && i != P && (cnt[i] > cnt[P] || (cnt[i] == cnt[P] && i < P)))
            ++ pos;
    }

    cout << value[P] << " " << pos+1 << '\n';

    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	1 ms	716 KB	Output is correct
10	Correct	2 ms	1228 KB	Output is correct
11	Correct	9 ms	1976 KB	Output is correct
12	Correct	14 ms	3148 KB	Output is correct
13	Correct	37 ms	5444 KB	Output is correct
14	Correct	56 ms	7648 KB	Output is correct
15	Correct	98 ms	9800 KB	Output is correct
16	Correct	115 ms	10636 KB	Output is correct
17	Correct	178 ms	12204 KB	Output is correct
18	Correct	212 ms	13748 KB	Output is correct
19	Correct	295 ms	16064 KB	Output is correct
20	Correct	301 ms	16132 KB	Output is correct