255842026-02-20 20:28:04sarminKert (75 pont)cpp17Accepted 75/75101ms564 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, p; cin >> n >> m >> p;
    int res = 0, mx = 0;
    for (int i = 0; i < n; i++) {
    	int cnt = 0, pr = -1, b;
    	map<int, int> x;
    	for (int j = 0; j < m; j++) {
    		cin >> b;
    		x[b]++;
    		if (j != 0 && b != pr) {
    			mx = max(mx, cnt);
    			cnt = 1;
    		} else {
    			cnt++;
    		}
    		pr = b;
    	}
    	mx = max(mx, cnt);
    	int leg = 0;
    	for (auto& [key, value] : x) {
    		if (leg < value) {
    			leg = value;
    		}
    	}
    	if (leg > m/2) res++;
    }
    cout << res << "\n" << mx << "\n";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms500 KiB
2Accepted0/097ms316 KiB
3Accepted4/41ms500 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/43ms508 KiB
11Accepted6/61ms508 KiB
12Accepted6/64ms316 KiB
13Accepted6/614ms316 KiB
14Accepted6/697ms472 KiB
15Accepted6/686ms460 KiB
16Accepted6/6101ms468 KiB
17Accepted7/767ms564 KiB