Submission #685063

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
685063	2023-01-23T08:32:23 Z	acceptify	Poi (IOI09_poi)	C++17	70 / 100	512 ms	23792 KB

poi

#include <bits/stdc++.h>
using namespace std;

const int mxn = 2005;
const int mxt = 2005;

int n, t, p, ac[mxn][mxt], pt[mxt], scr[mxn], rk[mxn];

int main() {
    cin >> n >> t >> p;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) {
        cin >> ac[i][j];
        pt[j] += 1 - ac[i][j];
    }
    for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) scr[i] += ac[i][j] * pt[j];
    for (int i = 1; i <= n; i++) rk[i] = i;
    sort(rk + 1, rk + n + 1, [](int x, int y) -> bool {
        if (scr[x] != scr[y]) return scr[x] > scr[y];
        return x < y;
    });
    cout << scr[p] << " ";
    for (int i = 1; i <= n; i++) if (rk[i] == p) cout << i << "\n";
}

Subtask #1

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Incorrect	1 ms	340 KB	Output isn't correct
4	Incorrect	1 ms	312 KB	Output isn't correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Incorrect	1 ms	596 KB	Output isn't correct
8	Incorrect	2 ms	596 KB	Output isn't correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	5 ms	1236 KB	Output is correct
11	Correct	18 ms	2192 KB	Output is correct
12	Correct	29 ms	3428 KB	Output is correct
13	Incorrect	79 ms	6508 KB	Output isn't correct
14	Correct	144 ms	9200 KB	Output is correct
15	Incorrect	232 ms	12652 KB	Output isn't correct
16	Correct	213 ms	13588 KB	Output is correct
17	Correct	320 ms	16704 KB	Output is correct
18	Correct	358 ms	19028 KB	Output is correct
19	Correct	499 ms	23032 KB	Output is correct
20	Correct	512 ms	23792 KB	Output is correct