152742025-02-17 19:53:41tomi7Kert (75 pont)cpp17Wrong answer 35/75319ms2612 KiB
// Source: https://usaco.guide/general/io

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

int main() {
	int n, m, p;cin>>n>>m>>p;
    vector<vector<int>> a(n, vector<int> (m, 0));
    int maxi=0;
    int semaxi=0;
    int y=0;
    int ans=0;
    map<int, int> mape;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int x;cin>>x;
            x--;
            mape[x]++;
            if(j!=0){
                if(y==x){
                    semaxi++;
                }else{
                    maxi=max(semaxi, maxi);
                }
            }
            y=x;
        }
        maxi=max(maxi, semaxi);
        semaxi=0;
        int hh=0;
        for(pair<int, int> j: mape){
            hh=max(hh, j.second);
        }
        if(hh>=(m+1)/2){
            ans++;
        }
        mape.clear();
    }
    cout<<ans<<'\n'<<maxi<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base35/75
1Accepted0/01ms316 KiB
2Wrong answer0/0231ms2356 KiB
3Partially correct2/41ms508 KiB
4Wrong answer0/41ms316 KiB
5Partially correct2/41ms316 KiB
6Partially correct2/41ms316 KiB
7Partially correct2/41ms404 KiB
8Partially correct2/41ms316 KiB
9Partially correct2/41ms412 KiB
10Partially correct2/44ms368 KiB
11Partially correct3/62ms316 KiB
12Partially correct3/69ms508 KiB
13Partially correct3/629ms644 KiB
14Partially correct3/6221ms2408 KiB
15Partially correct3/6225ms2612 KiB
16Partially correct3/6319ms2356 KiB
17Partially correct3/7141ms1376 KiB