#include <iostream> #include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; int n, t, s; int laipsniai[1001]; vector<int> adj[1001]; vector<int> result; int isnaudotapak = 0; const int inf = 1e8; void toposort(){ pii order[n]; queue<pii> q; for(int i=1; i<=n; i++){ order[i-1]= {laipsniai[i], i}; //cout << " i = " << i << " laipsniai = " << laipsniai[i] << endl; } sort(order, order+n); q.push(order[0]); order[0].first = inf; // cout<<laipsniai[1]<<endl; while(!q.empty()){ int v = q.front().second; int laip = q.front().first; q.pop(); result.push_back(v); for(auto u :adj[v]){ laipsniai[u]--; for(int i =0; i<n; i++){if(order[i].second ==u){order[i].first--;}} sort(order, order+n); if(result.size()<n){q.push(order[0]);order[0].first = inf; } } } } int main() { cin>>t>>n>>s; for(int i=0; i<n; i++){ int num; cin>>num; laipsniai[i+1] = num; for(int a=0; a<num; a++){ int u; cin>>u; adj[u].push_back(i+1); } } toposort(); for(auto i: result){ cout<<i<<"\n"; } } /* test case 0 4 1 2 2 3 0 1 4 1 1*/

sauga.cpp: In function 'void toposort()':
sauga.cpp:29:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |                 if(result.size()<n){q.push(order[0]);order[0].first = inf; }
      |                    ~~~~~~~~~~~~~^~
sauga.cpp:23:39: warning: unused variable 'laip' [-Wunused-variable]
   23 |         int v = q.front().second; int laip = q.front().first;  q.pop();
      |                                       ^~~~