Submission #539509

# Submission time Handle Problem Language Result Execution time Memory
539509 2022-03-19T04:29:21 Z MurotY Poi (IOI09_poi) C++14
55 / 100
359 ms 31760 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++) ans[i].ff=ans[i].ss=0;
	for (int i=1;i<=m;i++) b[i]=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=n;i>=1;i--){
	//	cout << ans[i].ff <<" " << ans[i].ss.ff <<" " << ans[i].ss.ss <<"\n";
		if (ans[i].ss == p){
			cout << ans[i].ff << " " << n-i+1;
			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 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Correct 1 ms 468 KB Output is correct
7 Incorrect 1 ms 596 KB Output isn't correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 3 ms 816 KB Output isn't correct
10 Correct 4 ms 1364 KB Output is correct
11 Correct 9 ms 2388 KB Output is correct
12 Incorrect 15 ms 3816 KB Output isn't correct
13 Incorrect 40 ms 7828 KB Output isn't correct
14 Incorrect 85 ms 10924 KB Output isn't correct
15 Correct 117 ms 16884 KB Output is correct
16 Correct 108 ms 18252 KB Output is correct
17 Correct 192 ms 23836 KB Output is correct
18 Correct 209 ms 27060 KB Output is correct
19 Incorrect 359 ms 31760 KB Output isn't correct
20 Correct 298 ms 31668 KB Output is correct