Submission #539524

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
539524	2022-03-19T04:36:00 Z	MurotY	Poi (IOI09_poi)	C++14	100 / 100	356 ms	31756 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++) ans[i].ff=ans[i].ss.ff=ans[i].ss.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];
			if (a[i][j] == 1) ans[i].ss.ff++;
		}
		ans[i].ss.ss=i;
	}
	sort(ans+1,ans+n+1);
	
	for (int i=1;i<=n;i++){
		for (int j=i;j<=n;j++){
			if (ans[i].ff != ans[j].ff || ans[i].ss.ff != ans[j].ss.ff) {
				reverse(ans+i, ans+j);
				i=j-1;
				break;
			}
		}
	}
	for (int i=n;i>=1;i--){
	//	cout << ans[i].ff <<" " << ans[i].ss.ff <<" " << ans[i].ss.ss <<"\n";
		if (ans[i].ss.ss == p){
			cout << ans[i].ff << " " << n-i+1;
			return ;
		}
	}
	return ;
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
		solve(); 
		cout << "\n";
	}
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	2 ms	596 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	2 ms	1364 KB	Output is correct
11	Correct	12 ms	2388 KB	Output is correct
12	Correct	16 ms	3796 KB	Output is correct
13	Correct	44 ms	7780 KB	Output is correct
14	Correct	61 ms	10956 KB	Output is correct
15	Correct	118 ms	16784 KB	Output is correct
16	Correct	132 ms	18272 KB	Output is correct
17	Correct	219 ms	23860 KB	Output is correct
18	Correct	251 ms	27016 KB	Output is correct
19	Correct	306 ms	31688 KB	Output is correct
20	Correct	356 ms	31756 KB	Output is correct