1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=100010; vector<int> g[N]; int main() { int n,m; cin>>n>>m; for(int i=1;i<=m;i++) { int x,y; cin>>x>>y; g[x].push_back(y);//添加一条x到y的边 } for(int i=1;i<=n;i++) { if(g[i].size()) //存在i可以到的边 { cout<<i<<":"; for(int j=0;j<g[i].size();j++) //访问所有边 { cout<<g[i][j]<<" "; } cout<<endl; } } return 0; }
- 1
Information
- ID
- 2119
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 1
- Accepted
- 1
- Uploaded By