[uva] Add C++ solution for 10377 - Maze Traversal.

Author: abeaumont

uva/10377-1.ans

@@ -0,0 +1 @@
+5 6 W

uva/10377-1.in

@@ -0,0 +1,14 @@
+1
+
+7 8
+********
+* * * **
+* *    *
+* * ** *
+* * *  *
+*   * **
+********
+2 4
+RRFLFF FFR
+FF
+RFFQ

uva/10377.cc

@@ -0,0 +1,43 @@
+// https://uva.onlinejudge.org/external/103/10377.pdf
+#include<bits/stdc++.h>
+using namespace std;
+using vs=vector<string>;
+int main(){
+  ios::sync_with_stdio(0);
+  cin.tie(0);
+  int t,n,m,y,x,o,q;
+  int dy[]={-1,0,1,0};
+  int dx[]={0,1,0,-1};
+  cin>>t;
+  for(int T=0;T<t;T++){
+    cin>>n>>m;
+    string s;
+    getline(cin,s);
+    vs a(n);
+    for(int i=0;i<n;i++){
+      getline(cin,s);
+      a[i]=s;
+    }
+    cin>>y>>x;
+    getline(cin,s);
+    y--;x--;
+    o=0;q=0;
+    for(;;){
+      getline(cin,s);
+      for(char c:s){
+        if(c=='L')o=!o?3:o-1;
+        else if(c=='R')o=o==3?0:o+1;
+        else if(c=='F'){
+          if(a[y+dy[o]][x+dx[o]]!='*'){y+=dy[o];x+=dx[o];}
+        }else if(c=='Q'){q=1;break;}
+      }
+      if(q)break;
+    }
+    for(;;){
+      getline(cin,s);
+      if(s.empty())break;
+    }
+    if(T)cout<<"\n";
+    cout<<y+1<<" "<<x+1<<" "<<"NESW"[o]<<"\n";
+  }
+}

uva/README.md

@@ -111,6 +111,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=1277))
 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. [10377 - Maze Traversal](10377.cc)
+   ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1318))
 1. [10382 - Watering Grass](10382.cc)
    ([problem site](https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1323))
 1. [10507 - Waking up brain](10507.cc)