195392025-12-14 12:00:31GergoszaboLegtöbb unoka (80 pont)cpp17Wrong answer 60/807ms552 KiB
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    long long n, m; cin >> n >> m;
    vector<int> apa(n+1);
    for (int i = 1; i <= m; i++){
        int a, b; cin >> a >> b;
        apa[b] = a;
    }
    vector<int> gy(n+1);
    int maxu = 0, ind = 0;
    for (int i = 1; i <= n; i++){
        gy[apa[apa[i]]]++;
    }
    for (int i = 1; i <= n; i++){
        if (gy[i] > maxu){
            maxu = gy[i]; ind = i;
        }
    }
    cout << ind << " " << maxu;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base60/80
1Accepted0/01ms508 KiB
2Accepted0/04ms316 KiB
3Wrong answer0/41ms316 KiB
4Wrong answer0/41ms316 KiB
5Accepted4/47ms316 KiB
6Accepted4/47ms436 KiB
7Wrong answer0/41ms316 KiB
8Wrong answer0/41ms316 KiB
9Accepted4/44ms316 KiB
10Accepted4/47ms316 KiB
11Accepted4/47ms436 KiB
12Accepted4/44ms416 KiB
13Accepted4/47ms552 KiB
14Accepted4/47ms340 KiB
15Accepted4/47ms436 KiB
16Accepted4/47ms432 KiB
17Accepted4/47ms436 KiB
18Accepted4/47ms440 KiB
19Wrong answer0/21ms320 KiB
20Wrong answer0/21ms316 KiB
21Accepted3/31ms316 KiB
22Accepted3/32ms316 KiB
23Accepted3/37ms436 KiB
24Accepted3/37ms316 KiB