#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
int n,m,t;
int it[1001][1001];
int co[1001];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m>>t;
vector<pair<pair<int,int>,int>> ss;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>it[i][j];
if(it[i][j]==0){
co[j]+=1;
}
}
}
for(int i=0;i<n;i++){
int so=0;
int so2=0;
for(int j=0;j<m;j++){
if(it[i][j]==1){
so+=co[j];
so2+=1;
}
}
ss.pb({{-so,-so2},i});
}
for(int i=0;i<n;i++){
if(ss[i].b==t-1){
cout<<-ss[i].a.a<<" "<<i+1<<endl;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
512 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
512 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
512 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
640 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
640 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
768 KB |
Output isn't correct |
10 |
Incorrect |
4 ms |
1152 KB |
Output isn't correct |
11 |
Incorrect |
14 ms |
1792 KB |
Output isn't correct |
12 |
Incorrect |
16 ms |
2688 KB |
Output isn't correct |
13 |
Incorrect |
49 ms |
4216 KB |
Output isn't correct |
14 |
Incorrect |
87 ms |
6008 KB |
Output isn't correct |
15 |
Incorrect |
89 ms |
7032 KB |
Output isn't correct |
16 |
Incorrect |
88 ms |
7032 KB |
Output isn't correct |
17 |
Incorrect |
141 ms |
7668 KB |
Output isn't correct |
18 |
Runtime error |
141 ms |
11852 KB |
Execution killed with signal 11 |
19 |
Incorrect |
127 ms |
8056 KB |
Output isn't correct |
20 |
Runtime error |
167 ms |
12620 KB |
Execution killed with signal 11 |