1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=1e5+10; vector<int> g[N]; int st[N]; void dfs(int u,int fa) { st[u]=fa; for(auto j:g[u]) { if(st[j]) continue; dfs(j,fa); } } int main() { int n,m; cin>>n>>m; for(int i=1;i<=m;i++) { int a,b; cin>>a>>b; g[b].push_back(a); } for(int i=n;i>=1;i--) { if(st[i]) continue; dfs(i,i); } for(int i=1;i<=n;i++) { cout<<st[i]<<" "; } return 0; }
- 1
Information
- ID
- 1801
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 5
- Accepted
- 4
- Uploaded By