| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 123118 | 吴悠 | 树根和宝藏 | C++ | Accepted | 100 | 0 MS | 252 KB | 462 | 2024-01-22 17:19:03 |
#include<iostream> using namespace std; int n,m; int tree[1001]; int main(){ int x,y,root,maxn,sum=0,maxs=0; cin>>n>>m; for(int i=1;i<=m;i++){ cin>>x>>y; tree[y]=x; } for(int i=1;i<=n;i++){ if(tree[i]==0){ root=i; break; } } for(int i=1;i<=n;i++){ sum=0; for(int j=1;j<=n;j++){ if(tree[j]==i){ sum++; } } if(sum>maxs){ maxs=sum; maxn=i; } } cout<<root<<" "<<maxn<<endl; return 0; }