256262026-02-23 18:06:53BoldizsárLegtöbb unoka (80 pont)cpp17Accepted 80/808ms900 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,m;cin >> n >> m;
    vector<vector<int>>v(n+1,vector<int>());
    for(int i = 0;i  < m;i++){
        int a,b;cin >> a >> b;
        v[a].push_back(b);
    }
    int ki=0,hany =0,c = 0;
    for(int i = 1;i <= n;i++){
        int s = v[i].size();
        for(int j = 0;j < s;j++){
            c += v[v[i][j]].size();
        }
        if(c > hany){
            hany = c;
            ki = i;
        }
        c = 0;
    }
    if(hany == 0){
        cout  << -1;
    }else{
        cout << ki << " " << hany;
    }
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms316 KiB
2Accepted0/04ms564 KiB
3Accepted4/41ms316 KiB
4Accepted4/41ms548 KiB
5Accepted4/48ms656 KiB
6Accepted4/48ms568 KiB
7Accepted4/41ms568 KiB
8Accepted4/41ms508 KiB
9Accepted4/44ms380 KiB
10Accepted4/48ms564 KiB
11Accepted4/48ms564 KiB
12Accepted4/44ms564 KiB
13Accepted4/48ms764 KiB
14Accepted4/48ms820 KiB
15Accepted4/48ms564 KiB
16Accepted4/48ms568 KiB
17Accepted4/48ms756 KiB
18Accepted4/48ms856 KiB
19Accepted2/21ms564 KiB
20Accepted2/21ms664 KiB
21Accepted3/31ms564 KiB
22Accepted3/32ms564 KiB
23Accepted3/38ms900 KiB
24Accepted3/38ms896 KiB