# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503507 | 600Mihnea | Poi (IOI09_poi) | C++17 | 262 ms | 23792 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;
const int N = 2000 + 7;
int n;
int t;
int pos;
int yes[N][N];
int nsolved[N];
int score[N];
int total[N];
bool cmp(int i, int j) {
if (score[i] != score[j]) {
return score[i] > score[j];
}
if (total[i] != total[j]) {
return total[i] > total[j];
}
return i < j;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
/// freopen ("input", "r", stdin);
cin >> n >> t >> pos;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= t; j++) {
cin >> yes[i][j];
total[i] += yes[i][j];
nsolved[j] += 1 ^ yes[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= t; j++) {
score[i] += yes[i][j] * nsolved[j];
}
}
int sm = 0;
for (int i = 1; i <= n; i++) {
if (i != pos) {
sm += cmp(i, pos);
}
}
cout << score[pos] << " " << sm + 1 << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |