# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
507592 | tabr | Poi (IOI09_poi) | C++17 | 202 ms | 23848 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<int> c(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i] += a[i][j] * b[j];
}
}
vector<int> order(n);
iota(order.begin(), order.end(), 0);
stable_sort(order.begin(), order.end(), [&](int i, int j) { return c[i] < c[j]; });
for (int i = 0; i < n; i++) {
if (order[i] == p) {
cout << c[p] << " " << i + 1 << '\n';
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |