235502026-01-24 17:43:01BoldizsárLegtöbb unoka (80 pont)cpp17Wrong answer 60/808ms1076 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,m;cin >> n >> m;
    vector<vector<int>>g(n,vector<int>());
    for(int i = 0;i < m;i++){
        int a,b;cin >> a>>b;
        g[a-1].push_back(b-1);
    }
    long long ans1 = -1,ans2=-1;long long current = 0;
    for(int j = 0;j < n;j++){
        for(int i = 0;i < g[j].size();i++){
            current+=g[g[j][i]].size();
        }
        if(current > ans2){
            ans1 = j+1;ans2 = current;
        }
        current =0;
    }
    if(ans1 == -1  && ans2 == -1) cout << -1;
    else cout<<ans1<<" "<<ans2;
}
SubtaskSumTestVerdictTimeMemory
base60/80
1Accepted0/01ms316 KiB
2Accepted0/04ms564 KiB
3Wrong answer0/41ms316 KiB
4Wrong answer0/41ms316 KiB
5Accepted4/48ms800 KiB
6Accepted4/48ms748 KiB
7Wrong answer0/41ms316 KiB
8Wrong answer0/41ms316 KiB
9Accepted4/44ms524 KiB
10Accepted4/48ms788 KiB
11Accepted4/48ms648 KiB
12Accepted4/44ms576 KiB
13Accepted4/48ms784 KiB
14Accepted4/48ms1076 KiB
15Accepted4/48ms768 KiB
16Accepted4/48ms676 KiB
17Accepted4/48ms824 KiB
18Accepted4/48ms820 KiB
19Wrong answer0/21ms564 KiB
20Wrong answer0/21ms568 KiB
21Accepted3/31ms564 KiB
22Accepted3/32ms652 KiB
23Accepted3/38ms860 KiB
24Accepted3/38ms828 KiB