| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 507595 | tabr | Poi (IOI09_poi) | C++17 | 201 ms | 16036 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
