Submission #3,773

2023-03-02 21:46:45

cpp17

Wrong answer 60/80

8ms

5372 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;
    }
  }
  cout<<sor<<" "<<ln<<endl;

}

	Sum	Test	Verdict		Time	Memory
base	60/80
		1	Accepted	0/0	3ms	1808 KiB
		2	Accepted	0/0	6ms	2832 KiB
		3	Wrong answer	0/4	2ms	2084 KiB
		4	Wrong answer	0/4	3ms	2216 KiB
		5	Accepted	4/4	8ms	3292 KiB
		6	Accepted	4/4	8ms	3648 KiB
		7	Wrong answer	0/4	3ms	2884 KiB
		8	Wrong answer	0/4	3ms	2852 KiB
		9	Accepted	4/4	6ms	3516 KiB
		10	Accepted	4/4	8ms	3864 KiB
		11	Accepted	4/4	8ms	3740 KiB
		12	Accepted	4/4	6ms	3828 KiB
		13	Accepted	4/4	8ms	4136 KiB
		14	Accepted	4/4	8ms	4200 KiB
		15	Accepted	4/4	8ms	4332 KiB
		16	Accepted	4/4	8ms	4092 KiB
		17	Accepted	4/4	8ms	4620 KiB
		18	Accepted	4/4	8ms	4480 KiB
		19	Wrong answer	0/2	3ms	3936 KiB
		20	Wrong answer	0/2	3ms	3940 KiB
		21	Accepted	3/3	3ms	4200 KiB
		22	Accepted	3/3	3ms	4172 KiB
		23	Accepted	3/3	8ms	5164 KiB
		24	Accepted	3/3	8ms	5372 KiB