Submission #507595

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
507595	2022-01-12T19:07:57 Z	tabr	Poi (IOI09_poi)	C++17	100 / 100	201 ms	16036 KB

poi

#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, p;
    cin >> n >> m >> p;
    p--;
    vector<vector<int>> a(n, vector<int>(m));
    vector<int> b(m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
            b[j] += !a[i][j];
        }
    }
    vector<tuple<int, int, int>> c(n);
    for (int i = 0; i < n; i++) {
        get<2>(c[i]) = -i;
        for (int j = 0; j < m; j++) {
            get<0>(c[i]) += a[i][j] * b[j];
            get<1>(c[i]) += a[i][j];
        }
    }
    sort(c.rbegin(), c.rend());
    for (int i = 0; i < n; i++) {
        if (get<2>(c[i]) == -p) {
            cout << get<0>(c[i]) << " " << i + 1 << '\n';
        }
    }
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	6 ms	716 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	30 ms	2636 KB	Output is correct
14	Correct	43 ms	3668 KB	Output is correct
15	Correct	74 ms	6200 KB	Output is correct
16	Correct	81 ms	6704 KB	Output is correct
17	Correct	117 ms	9676 KB	Output is correct
18	Correct	135 ms	10956 KB	Output is correct
19	Correct	174 ms	14476 KB	Output is correct
20	Correct	201 ms	16036 KB	Output is correct