#include <bits/stdc++.h>
using namespace std;
using tuplis = array<int, 3>;
#define name2(a,b,c,...) c
#define rep1(b) for(int i = 0; i < b; i++)
#define rep2(i,b) for(int i = 0; i < b; i++)
#define rep(...) name2(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define each(i,a) for(auto&& i : a)
#define all(a) begin(a), end(a)
int main(){
int n, t, p;
cin >> n >> t >> p;
p--;
vector<vector<bool>> a(t, vector<bool>(n));
rep(n) rep(j, t){
char c;
while(~(c = getchar()) & 48);
a[j][i] = c & 1;
}
vector<int> point(t);
rep(t) point[i] = n - accumulate(all(a[i]), 0);
vector<tuplis> b(n);
rep(n){
b[i][2] = i;
rep(j, t) if(a[j][i]){
b[i][0] -= point[j];
b[i][1]--;
}
}
sort(all(b));
rep(n) if(b[i][2] == p) cout << -b[i][0] << ' ' << i + 1 << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
432 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
6 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
9 ms |
640 KB |
Output is correct |
12 |
Correct |
13 ms |
768 KB |
Output is correct |
13 |
Correct |
26 ms |
1664 KB |
Output is correct |
14 |
Correct |
34 ms |
2176 KB |
Output is correct |
15 |
Correct |
57 ms |
3576 KB |
Output is correct |
16 |
Correct |
61 ms |
3832 KB |
Output is correct |
17 |
Correct |
89 ms |
5368 KB |
Output is correct |
18 |
Correct |
101 ms |
6008 KB |
Output is correct |
19 |
Correct |
130 ms |
7928 KB |
Output is correct |
20 |
Correct |
157 ms |
8908 KB |
Output is correct |