Submission #3,774

2023-03-02 21:49:22

cpp17

Accepted 80/80

8ms

5268 KiB

#include<bits/stdc++.h>
using namespace std;
vector<int>gy;
vector<int>u;


int main(){
  int n, m;
  cin>>n>>m;
  vector<vector<int> >s(n+1);
  gy.resize(n+1);
  u.resize(n+1);
  for(int i=1; i<=m; i++){
    int x, y;
    cin>>x>>y;
    s[x].push_back(y);
    gy[x]++;
  }
  int ln=0, sor;
  for(int i=1; i<=n; i++){
    for(int x : s[i]){
        u[i]+=gy[x];
    }
    if(ln<u[i]){
        ln=u[i];
        sor=i;
    }
  }
  if(ln!=0){
  cout<<sor<<" "<<ln<<endl;
  } else cout<<-1;

}

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	3ms	1688 KiB
		2	Accepted	0/0	6ms	2764 KiB
		3	Accepted	4/4	3ms	2256 KiB
		4	Accepted	4/4	2ms	2392 KiB
		5	Accepted	4/4	8ms	3396 KiB
		6	Accepted	4/4	8ms	3524 KiB
		7	Accepted	4/4	3ms	2972 KiB
		8	Accepted	4/4	3ms	3188 KiB
		9	Accepted	4/4	6ms	3404 KiB
		10	Accepted	4/4	8ms	3744 KiB
		11	Accepted	4/4	8ms	3948 KiB
		12	Accepted	4/4	6ms	3772 KiB
		13	Accepted	4/4	8ms	4184 KiB
		14	Accepted	4/4	8ms	4140 KiB
		15	Accepted	4/4	8ms	4352 KiB
		16	Accepted	4/4	8ms	4560 KiB
		17	Accepted	4/4	8ms	4988 KiB
		18	Accepted	4/4	8ms	4592 KiB
		19	Accepted	2/2	3ms	4264 KiB
		20	Accepted	2/2	3ms	4484 KiB
		21	Accepted	3/3	3ms	4376 KiB
		22	Accepted	3/3	3ms	4404 KiB
		23	Accepted	3/3	8ms	5264 KiB
		24	Accepted	3/3	8ms	5268 KiB