Submission #539504

# Submission time Handle Problem Language Result Execution time Memory
539504 2022-03-19T04:23:53 Z MurotY Poi (IOI09_poi) C++14
5 / 100
310 ms 31692 KB
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
#define ll long long
using namespace std;
const int N=2*1e3+7, M=1e9+7;
ll a[N][N], b[N];
pair <ll, ll> ans[N];
void solve()
{
	ll n, m, p;
	cin >> n >> m >> p;
	for (int i=1;i<=n;i++) b[i]=0, ans[i].ff=ans[i].ss=0;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=m;j++) cin >> a[i][j];
	}
	for (int j=1;j<=m;j++){
		for (int i=1;i<=n;i++){
			if (a[i][j] == 0) b[j]++;
		}
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=m;j++){
			if (a[i][j] == 1) ans[i].ff+=b[j];
			ans[i].ss=i;
		}
	}
	sort(ans+1,ans+n+1);
	for (int i=1;i<=n;i++){
	//	cout << ans[i].ff <<" " << ans[i].ss.ff <<" " << ans[i].ss.ss <<"\n";
		if (ans[i].ss == p){
			cout << ans[i].ff << " " << i;
			return ;
		}
	}
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
		solve(); 
		cout << "\n";
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Incorrect 1 ms 468 KB Output isn't correct
6 Incorrect 1 ms 468 KB Output isn't correct
7 Correct 1 ms 596 KB Output is correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 Incorrect 3 ms 1364 KB Output isn't correct
11 Incorrect 10 ms 2492 KB Output isn't correct
12 Incorrect 17 ms 3796 KB Output isn't correct
13 Incorrect 44 ms 7792 KB Output isn't correct
14 Incorrect 80 ms 11012 KB Output isn't correct
15 Incorrect 106 ms 16824 KB Output isn't correct
16 Incorrect 116 ms 18156 KB Output isn't correct
17 Incorrect 186 ms 23800 KB Output isn't correct
18 Incorrect 247 ms 26944 KB Output isn't correct
19 Incorrect 263 ms 31664 KB Output isn't correct
20 Incorrect 310 ms 31692 KB Output isn't correct