Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n,m;
- int dp[100];
- int x[100], y[100];
- int res[100];
- int br;
- void resi(){
- dp[0] = 0;
- for(int i=1; i<=n; i++)dp[i] = 1e9;
- for(int i=1; i<=n; i++){
- for(int j=0; j<m; j++){
- if(y[j] == i)dp[i] = min(dp[x[j]] + 1, dp[i]);
- }
- }
- cout << dp[n] << "\n";
- int tr = n;
- while(tr > 0){
- int koji = 0;
- for(int j=0; j<m; j++){
- if(y[j] == tr && (dp[tr] == (dp[x[j]] + 1)) ){
- tr = x[j];
- koji = j;
- break;
- }
- }
- res[br++] = koji;
- }
- for(int i=br-1; i>=0; i--)cout << res[i] << endl;
- }
- int main()
- {
- cin >> n >> m;
- for(int i=0; i<m; i++){
- cin >> x[i] >> y[i];
- }
- resi();
- return 0;
- }
- /*
- 5 6
- 0 3
- 0 1
- 1 2
- 2 4
- 3 4
- 4 5
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement