Submission #503507

#TimeUsernameProblemLanguageResultExecution timeMemory
503507600MihneaPoi (IOI09_poi)C++17
100 / 100
262 ms23792 KiB
#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 timeMemoryGrader output
Fetching results...