Submission #539501

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
539501	2022-03-19T04:20:01 Z	MurotY	Poi (IOI09_poi)	C++14	0 / 100	302 ms	31796 KB

poi

#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, 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.ff=ans[i].ss.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];
			if (a[i][j] == 1) ans[i].ss.ff+=1;
			ans[i].ss.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.ss == p){
			cout << ans[i].ff << " " << i;
			return ;
		}
	}
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
		solve(); 
		cout << "\n";
	}
	return 0;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	340 KB	Output isn't correct
2	Incorrect	0 ms	340 KB	Output isn't correct
3	Incorrect	0 ms	340 KB	Output isn't correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Incorrect	1 ms	340 KB	Output isn't correct
6	Incorrect	1 ms	468 KB	Output isn't correct
7	Incorrect	1 ms	596 KB	Output isn't correct
8	Incorrect	1 ms	596 KB	Output isn't correct
9	Incorrect	2 ms	724 KB	Output isn't correct
10	Incorrect	4 ms	1308 KB	Output isn't correct
11	Incorrect	9 ms	2488 KB	Output isn't correct
12	Incorrect	16 ms	3852 KB	Output isn't correct
13	Incorrect	68 ms	7796 KB	Output isn't correct
14	Incorrect	101 ms	10952 KB	Output isn't correct
15	Incorrect	111 ms	16812 KB	Output isn't correct
16	Incorrect	107 ms	18276 KB	Output isn't correct
17	Incorrect	239 ms	23892 KB	Output isn't correct
18	Incorrect	238 ms	27072 KB	Output isn't correct
19	Incorrect	294 ms	31796 KB	Output isn't correct
20	Incorrect	302 ms	31696 KB	Output isn't correct