Submission #678662

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
678662	2023-01-06T10:00:01 Z	penguin133	Poi (IOI09_poi)	C++17	100 / 100	564 ms	23732 KB

poi

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,m,k;
	cin >> n >> m >> k;
	int grid[n][m];
	int cnt[m];
	memset(cnt,0,sizeof(cnt));
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin >> grid[i][j];
			if(grid[i][j] == 1){
				cnt[j]++;
			}
		}
	}
	int cnt2 = 0,cnt3 = 0,cnt5 = 0;
	for(int i=0;i<m;i++){
		cnt[i] = n - cnt[i];
		if(grid[k-1][i] == 1){
			cnt2 += cnt[i];
			cnt5++;
		}
	}
	cout << cnt2 << " ";
	int cnt4 = 0,cnt6 = 0;
	for(int i=0;i<n;i++){
		cnt3 = 0;
		cnt6 = 0;
		if(i == k-1)continue;
		for(int j=0;j<m;j++){
			if(grid[i][j] == 1){
				cnt3 += cnt[j];
				cnt6++;
			}
		}
		if(cnt3 > cnt2){
			cnt4++;
		}
		else if(cnt3 == cnt2){
			if(cnt6 > cnt5){
				cnt4++;
			}
			else if(cnt6 == cnt5){
				if(i < k-1){
					cnt4++;
				}
			}
		}
	}
	cout << cnt4+1;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	3 ms	340 KB	Output is correct
10	Correct	5 ms	468 KB	Output is correct
11	Correct	23 ms	980 KB	Output is correct
12	Correct	29 ms	1448 KB	Output is correct
13	Correct	96 ms	3740 KB	Output is correct
14	Correct	115 ms	5196 KB	Output is correct
15	Correct	230 ms	9208 KB	Output is correct
16	Correct	224 ms	9704 KB	Output is correct
17	Correct	367 ms	14268 KB	Output is correct
18	Correct	380 ms	16252 KB	Output is correct
19	Correct	499 ms	21532 KB	Output is correct
20	Correct	564 ms	23732 KB	Output is correct