| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1148954 | blackslex | Poi (IOI09_poi) | C++20 | 215 ms | 16152 KiB | 
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int n, m, p;
int main() {
    scanf("%d %d %d", &n, &m, &p); p--;
    vector<vector<int>> a(n, vector<int>(m));
    vector<int> cnt(m, n);
    for (auto &e: a) {
        for (auto &E: e) scanf("%d", &E);
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) cnt[i] -= a[j][i];
    }
    vector<int> b(n);
    vector<pii> c;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) b[i] += cnt[j] * a[i][j];
        c.emplace_back(b[i], i);
    }
    sort(c.begin(), c.end(), [&] (const pii &p1, const pii &p2) {
        return (p1.first == p2.first ? p1.second < p2.second : p1.first > p2.first);
    });
    int ans = -1;
    for (int i = 0; i < n; i++) {
        if (c[i].second == p) ans = i;
    }
    printf("%d %d", c[ans].first, ++ans);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
