144442025-01-10 19:27:57miszorimarciLegtöbb unoka (80 pont)cpp17Accepted 80/808ms948 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m; cin >> n >> m;
	vector<vector<int>>adj(n+1);
	while(m--)
	{
		int a, b; cin >> a >> b;
		adj[a].push_back(b);
	}
	int maxi = 0, index = -1;
	for(int i = 1; i <= n; i++)
	{
		int sum = 0;
		for(int j = 0; j < adj[i].size(); j++)sum += adj[adj[i][j]].size();
		if(sum > maxi)
		{
			maxi = sum;
			index = i;
		}
	}
	if(index == -1)
	{
		cout << -1;
		return 0;
	}
	cout << index << " " << maxi;
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms496 KiB
2Accepted0/04ms564 KiB
3Accepted4/41ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/48ms604 KiB
6Accepted4/48ms564 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/44ms564 KiB
10Accepted4/48ms796 KiB
11Accepted4/48ms564 KiB
12Accepted4/44ms584 KiB
13Accepted4/48ms856 KiB
14Accepted4/48ms820 KiB
15Accepted4/48ms728 KiB
16Accepted4/48ms780 KiB
17Accepted4/48ms836 KiB
18Accepted4/48ms820 KiB
19Accepted2/21ms564 KiB
20Accepted2/21ms564 KiB
21Accepted3/31ms836 KiB
22Accepted3/32ms448 KiB
23Accepted3/38ms948 KiB
24Accepted3/38ms728 KiB