Submission #14,442

2025-01-10 19:27:21

cpp17

Wrong answer 60/80

8ms

868 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;
	cout << index << " " << maxi;
}

	Sum	Test	Verdict		Time	Memory
base	60/80
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	564 KiB
		3	Wrong answer	0/4	1ms	316 KiB
		4	Wrong answer	0/4	1ms	316 KiB
		5	Accepted	4/4	7ms	564 KiB
		6	Accepted	4/4	8ms	752 KiB
		7	Wrong answer	0/4	1ms	316 KiB
		8	Wrong answer	0/4	1ms	316 KiB
		9	Accepted	4/4	4ms	564 KiB
		10	Accepted	4/4	8ms	572 KiB
		11	Accepted	4/4	8ms	768 KiB
		12	Accepted	4/4	4ms	604 KiB
		13	Accepted	4/4	8ms	828 KiB
		14	Accepted	4/4	8ms	804 KiB
		15	Accepted	4/4	8ms	776 KiB
		16	Accepted	4/4	8ms	564 KiB
		17	Accepted	4/4	8ms	820 KiB
		18	Accepted	4/4	7ms	844 KiB
		19	Wrong answer	0/2	1ms	780 KiB
		20	Wrong answer	0/2	1ms	564 KiB
		21	Accepted	3/3	1ms	572 KiB
		22	Accepted	3/3	2ms	564 KiB
		23	Accepted	3/3	7ms	868 KiB
		24	Accepted	3/3	8ms	716 KiB