136112025-01-08 11:23:58MezeiDavidLegtöbb unoka (80 pont)cpp17Wrong answer 60/807ms756 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> gy(m), a(m), hisz(n + 1, 0), u(n + 1, 0);
    //vector<vector <int>> z(n, vector<int>(101, 0));
    for(int i = 0; i < m; i++)
    {
        cin >> a[i] >> gy[i];
    }
    for(int i = 0; i < m; i++)
    {
        hisz[a[i]]++;
    }
    for(int i = 0; i < m; i++)
    {
        u[a[i]] += hisz[gy[i]];
    }
    int max = u[1], maxi = 1;
    for(int i = 2; i <= n; i++)
    {
        //cout << u[i];
        if(max < u[i])
        {
            max = u[i];
            maxi = i;
        }
    }
    cout << maxi << " " << max;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base60/80
1Accepted0/01ms316 KiB
2Accepted0/04ms748 KiB
3Wrong answer0/41ms316 KiB
4Wrong answer0/41ms316 KiB
5Accepted4/47ms564 KiB
6Accepted4/46ms652 KiB
7Wrong answer0/41ms316 KiB
8Wrong answer0/41ms316 KiB
9Accepted4/44ms528 KiB
10Accepted4/47ms648 KiB
11Accepted4/47ms648 KiB
12Accepted4/44ms328 KiB
13Accepted4/47ms756 KiB
14Accepted4/47ms564 KiB
15Accepted4/47ms564 KiB
16Accepted4/46ms564 KiB
17Accepted4/47ms564 KiB
18Accepted4/46ms564 KiB
19Wrong answer0/21ms508 KiB
20Wrong answer0/21ms400 KiB
21Accepted3/31ms500 KiB
22Accepted3/32ms316 KiB
23Accepted3/37ms756 KiB
24Accepted3/37ms604 KiB