# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
507594 |
2022-01-12T19:06:07 Z |
tabr |
Poi (IOI09_poi) |
C++17 |
|
202 ms |
16032 KB |
#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);
sort(order.begin(), order.end(), [&](int i, int j) { return (c[i] == c[j] ? i < j : c[i] > c[j]); });
for (int i = 0; i < n; i++) {
if (order[i] == p) {
cout << c[p] << " " << i + 1 << '\n';
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
2 ms |
332 KB |
Output is correct |
11 |
Correct |
6 ms |
716 KB |
Output is correct |
12 |
Correct |
10 ms |
1100 KB |
Output is correct |
13 |
Incorrect |
30 ms |
2648 KB |
Output isn't correct |
14 |
Correct |
42 ms |
3668 KB |
Output is correct |
15 |
Incorrect |
77 ms |
6220 KB |
Output isn't correct |
16 |
Correct |
79 ms |
6604 KB |
Output is correct |
17 |
Correct |
113 ms |
9752 KB |
Output is correct |
18 |
Correct |
151 ms |
11008 KB |
Output is correct |
19 |
Correct |
172 ms |
14468 KB |
Output is correct |
20 |
Correct |
202 ms |
16032 KB |
Output is correct |