# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1148989 | blackslex | Poi (IOI09_poi) | C++20 | 204 ms | 16104 KiB |
#include<bits/stdc++.h>
using namespace std;
using tp = tuple<int, int, int>;
const int N = 2005;
int n, m, p, a[N][N], b[N], cnt[N], cnt2[N];
int main() {
scanf("%d %d %d", &n, &m, &p);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
cnt[j] += 1 - a[i][j];
cnt2[i] += a[i][j];
}
}
vector<tp> c;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i] += cnt[j] * a[i][j];
}
c.emplace_back(b[i], cnt2[i], -i);
}
sort(c.rbegin(), c.rend());
int ans = -1;
for (int i = 0; i < n; i++) {
if (get<2>(c[i]) == -p) ans = i;
}
printf("%d %d", get<0>(c[ans]), ++ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |