No commit message

gzshawnliang · Feb 14, 2019 · a51e5f8 · a51e5f8
1 parent 388b163
commit a51e5f8
Show file tree

Hide file tree

Showing 5 changed files with 63 additions and 70 deletions.
diff --git a/findingNemo_UVA1202.out b/findingNemo_UVA1202.out
diff --git a/myCpps/findingNemo_UVA1202.cpp b/myCpps/findingNemo_UVA1202.cpp
@@ -20,15 +20,15 @@ struct door
     int d;
 };
 
-char f[200 + 2][200 + 2][2];
+//char f[200 + 2][200 + 2][2];
 // int g[200][200];
 // int a[200][200];
 
 int main()
 {
     while (true)
     {
-        memset(f, '.', sizeof(f));
+        //memset(f, '.', sizeof(f));
         // memset(a, INT_MAX, sizeof(a));
         // memset(g, INT_MAX, sizeof(g));
 
@@ -71,11 +71,7 @@ int main()
             }
         }
 
-        //char f[200 + 2][200 + 2][2];
-        //memset(f, '.', sizeof(f));
-
-        //vector<vector<vector<char>>> f(maxX + 2, vector<vector<char>>(maxY + 2, vector<char>(2, '.')));
-        //vector<string> f(maxX + 2, "..");
+        vector<vector<vector<char>>> f(maxX + 2, vector<vector<char>>(maxY + 2, vector<char>(2, '.')));
 
         for (int i = 0; i <= m - 1; ++i)
         {

diff --git a/myCpps/findingNemo_UVA1202.out b/myCpps/findingNemo_UVA1202.out
@@ -1,16 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15

diff --git a/myCpps/findingNemo_UVA1202_bug.cpp b/myCpps/findingNemo_UVA1202_bug.cpp
@@ -65,53 +65,53 @@ int main()
 
         vector<vector<vector<char>>> f(maxX + 2, vector<vector<char>>(maxY + 2, vector<char>(2, '.')));
 
-        // for (int i = 0; i <= m - 1; ++i)
-        // {
-        //     if (w[i].d == 0)
-        //     {
-        //         for (int c = 0; c <= w[i].t - 1; ++c)
-        //         {
-        //             f[w[i].x + c][w[i].y][0] = 'w';
-        //         }
-        //     }
-        //     else
-        //     {
-        //         for (int c = 0; c <= w[i].t - 1; ++c)
-        //         {
-        //             f[w[i].x][w[i].y + c][1] = 'w';
-        //         }
-        //     }
-        // }
-
-        // for (int i = 0; i <= n - 1; ++i)
-        // {
-        //     f[d[i].x][d[i].y][d[i].d] = 'd';
-        // }
-
-        // int vt = maxX * maxY;
-        // vector<int> xp = {-1, 0, 1, 0}, yp = {0, -1, 0, 1};
-        // vector<vector<int>> g(vt), a(vt, vector<int>(vt, INT_MAX));
-
-        // for (int y = 0; y <= maxY - 1; ++y)
-        // {
-        //     for (int x = 0; x <= maxX - 1; ++x)
-        //     {
-        //         int NO = x + y * maxX;
-        //         fout << NO << '\n';
-
-        //         a[NO][NO] = 0;
-
-        //         for (int p = 0; p <= 3; ++p)
-        //         {
-        //             int nowX = x + xp[p], nowY = y + yp[p], nowNO = nowX + nowY * maxX;
-
-        //             if (nowNO < 0 || nowNO > vt - 1)
-        //             {
-        //                 continue;
-        //             }
-        //         }
-        //     }
-        // }
+        for (int i = 0; i <= m - 1; ++i)
+        {
+            if (w[i].d == 0)
+            {
+                for (int c = 0; c <= w[i].t - 1; ++c)
+                {
+                    f[w[i].x + c][w[i].y][0] = 'w';
+                }
+            }
+            else
+            {
+                for (int c = 0; c <= w[i].t - 1; ++c)
+                {
+                    f[w[i].x][w[i].y + c][1] = 'w';
+                }
+            }
+        }
+
+        for (int i = 0; i <= n - 1; ++i)
+        {
+            f[d[i].x][d[i].y][d[i].d] = 'd';
+        }
+
+        int vt = maxX * maxY;
+        vector<int> xp = {-1, 0, 1, 0}, yp = {0, -1, 0, 1};
+        vector<vector<int>> g(vt), a(vt, vector<int>(vt, INT_MAX));
+
+        for (int y = 0; y <= maxY - 1; ++y)
+        {
+            for (int x = 0; x <= maxX - 1; ++x)
+            {
+                int NO = x + y * maxX;
+                fout << NO << '\n';
+
+                a[NO][NO] = 0;
+
+                for (int p = 0; p <= 3; ++p)
+                {
+                    int nowX = x + xp[p], nowY = y + yp[p], nowNO = nowX + nowY * maxX;
+
+                    if (nowNO < 0 || nowNO > vt - 1)
+                    {
+                        continue;
+                    }
+                }
+            }
+        }
 
         double tempEx, tempEy; fin >> tempEx >> tempEy;
     }

diff --git a/myCpps/hex.cpp b/myCpps/hex.cpp
@@ -0,0 +1,13 @@
+
+#include <bitset>
+#include <iostream>
+using namespace std;
+int main()
+{
+    cout << "36的8进制:" << std::oct << 36 << endl;
+    cout << "36的10进制" << std::dec << 36 << endl;
+    cout << "36的16进制:" << std::hex << 16 << endl;
+    cout << "36的2进制: " << bitset<8>(36) << endl;
+    return 0;
+
+}