[uva] Add C++ solution for 10305 - Ordering Tasks.

Author: abeaumont

uva/10305-1.ans

@@ -0,0 +1 @@
+4 1 5 2 3

uva/10305-1.in

@@ -0,0 +1,6 @@
+5 4
+1 2
+2 3
+1 3
+1 5
+0 0

uva/10305.cc

@@ -0,0 +1,32 @@
+// https://uva.onlinejudge.org/external/103/10305.pdf
+#include<bits/stdc++.h>
+using namespace std;
+using vi=vector<int>;
+using vvi=vector<vi>;
+int main(){
+  for(;;){
+    int n,m,u,v;
+    cin>>n>>m;
+    if(!n)break;
+    vvi g(n);
+    for(int i=0;i<m;i++){
+      cin>>u>>v;
+      u--;v--;
+      g[u].push_back(v);
+    }
+    vi s(n),p;
+    function<void(int)>dfs=[&](int u){
+      s[u]=1;
+      for(int v:g[u])
+        if(!s[v])
+          dfs(v);
+      p.push_back(u);
+    };
+    for(int i=0;i<n;i++)
+      if(!s[i])
+        dfs(i);
+    reverse(p.begin(),p.end());
+    for(int i=0;i<n;i++)
+      cout<<p[i]+1<<" \n"[i==n-1];
+  }
+}

uva/README.md

@@ -59,6 +59,8 @@ There are solutions for the following
    ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1119))
 1. [10227 - Forests](10227.py)
    ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1168))
+1. [10305 - Ordering Tasks](10305.cc)
+   ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1246))
 1. [10369 - Arctic Network](10369.cc)
    ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1310))
 1. [10301 - Rings and Glue](10301.cc)