Submission #921527

#TimeUsernameProblemLanguageResultExecution timeMemory
921527josanneo22Poi (IOI09_poi)C++17
70 / 100
172 ms16216 KiB
#include <bits/stdc++.h> using namespace std; using i64 = long long; #define L(i,j,k) for(int i=(j);i<=(k);++i) #define R(i,j,k) for(int i=(j);i>=(k);--i) #define all(x) x.begin(),x.end() #define me(x,a) memset(x,a,sizeof(x)) int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N, M; int id; cin >> N >> M >> id; vector<i64> people_not_scoring(M + 1, N); vector<vector<int>> a(N + 1, vector<int>(M + 1)); L(i, 1, N) { L(j, 1, M) { cin >> a[i][j]; people_not_scoring[j] -= (a[i][j] == 1); } } vector<i64> score(N + 1); L(i, 1, N) L(j, 1, M) score[i] += 1LL * a[i][j] * people_not_scoring[j]; vector<int> ord(N); iota(all(ord), 1); sort(all(ord), [&](int i, int j) { if (score[i] == score[j]) return i < j; return score[i] > score[j]; }); L(i, 0, N - 1) { if (ord[i] == id) { cout << score[id] << ' ' << i + 1 << '\n'; return 0; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...