153332025-02-18 13:35:18MezeiDavidKert (75 pont)cpp17Runtime error 24/75234ms32000 KiB
#include <vector>
#include <iostream>

using namespace std;

int main()
{
    int oszam,sszam ,szinkod, svirag=0,vege=0;
    cin >> oszam >> sszam >> szinkod;
    vector<vector<int>>viragok(oszam, vector<int>(sszam));
    
    for(int i=0; i<oszam; i++){
        for (int j=0; j<sszam; j++){
            cin >> viragok[i][j];
        }
    }
    for(int i=0; i< oszam; i++){
        vector<int>szinek(szinkod + 1, 0);
        svirag = 0;
        for(int j=0; j<sszam; j++){
            szinek[viragok[i][j]]++;
        }
        for(int a=1; a<szinkod + 1; a++){
            //cout << szinek[a] << " ";
            if(svirag < szinek[a]){
                svirag = szinek[a];
            }
        }
        //cout << svirag << "\n";
        if(svirag > sszam / 2)
            vege++;
    }
    cout << vege << endl;
    int aa = 0, max_aa = 0, max_aa_i;
    for(int i=0; i<oszam; i++){
        for(int j=1; j<sszam; j++){
            if(viragok[i][j] == viragok[i][j - 1]){
                aa++;
                //cout << aa << " ";
            }
            else{
                if(aa > max_aa){
                    max_aa = aa;
                    max_aa_i = i + 1;
                }
                aa = 0;              
            }   
        }
        //cout << "\n";
    }
    cout << max_aa_i;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base24/75
1Accepted0/01ms316 KiB
2Runtime error0/0214ms32000 KiB
3Partially correct2/41ms316 KiB
4Accepted4/41ms316 KiB
5Partially correct2/43ms672 KiB
6Partially correct2/43ms672 KiB
7Partially correct2/43ms672 KiB
8Partially correct2/43ms720 KiB
9Partially correct2/43ms764 KiB
10Partially correct2/46ms820 KiB
11Partially correct3/63ms672 KiB
12Partially correct3/637ms4320 KiB
13Runtime error0/652ms32000 KiB
14Runtime error0/6200ms32000 KiB
15Runtime error0/6207ms32000 KiB
16Runtime error0/6234ms32000 KiB
17Runtime error0/7128ms32000 KiB