Submission #489410

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
489410	2021-11-22T21:11:28 Z	Alexandruabcde	Poi (IOI09_poi)	C++14	60 / 100	261 ms	17828 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])
            ++ pos;
    }
    cout << value[P] << " " << pos+1 << '\n';

    return 0;
}

Subtask #1

60.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	332 KB	Output isn't correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Incorrect	0 ms	316 KB	Output isn't correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	452 KB	Output is correct
7	Incorrect	1 ms	588 KB	Output isn't correct
8	Correct	1 ms	588 KB	Output is correct
9	Incorrect	1 ms	716 KB	Output isn't correct
10	Correct	2 ms	1228 KB	Output is correct
11	Correct	7 ms	2128 KB	Output is correct
12	Incorrect	11 ms	3408 KB	Output isn't correct
13	Incorrect	34 ms	6596 KB	Output isn't correct
14	Correct	51 ms	9228 KB	Output is correct
15	Incorrect	87 ms	11512 KB	Output isn't correct
16	Correct	98 ms	12268 KB	Output is correct
17	Incorrect	153 ms	13780 KB	Output isn't correct
18	Correct	180 ms	15432 KB	Output is correct
19	Correct	259 ms	17828 KB	Output is correct
20	Correct	261 ms	17800 KB	Output is correct