No commit message

myCpps/!-OJcreater.cpp

@@ -12,7 +12,7 @@
 using namespace std;
 
 //***************************************
-const string CPPfile = "highestPaidToll_UVA12047"; //*
+const string CPPfile = "fromDuskTillDawn_UVA10187"; //*
 //***************************************
 
 ifstream fin(CPPfile + ".cpp");

myCpps/fromDuskTillDawn_UVA10187.cpp

@@ -0,0 +1,212 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+ifstream fin("fromDuskTillDawn_UVA10187.in");
+ofstream fout("fromDuskTillDawn_UVA10187.out");
+
+const int N = 100, inf = INT_MAX / 2;
+
+struct edge
+{
+    int t1;
+    int t2;
+};
+edge _edge(int t1, int t2)
+{
+    edge temp{t1, t2}; return temp;
+}
+
+struct segment
+{
+    int u;
+    int t;
+    int b;
+
+    bool operator < (const segment & temp) const
+    {
+        return b > temp.b;
+    }
+};
+segment _segment(int u, int t, int b)
+{
+    segment temp{u, t, b}; return temp;
+}
+
+int getNum(int & n, string str, map<string, int> & ston, vector<string> & ntos)
+{
+    if (ston.count(str) == 0)
+    {
+        ston[str] = n; ++n;
+        ntos.push_back(str);
+    }
+    return ston[str];
+}
+
+int getDis(int t1, int t2)
+{
+    if (t1 <= t2)
+    {
+        return t2 - t1;
+    }
+    else
+    {
+        return t2 - t1 + 24;
+    }
+}
+
+int main()
+{
+    int tcc; fin >> tcc;
+    for (int t = 1; t <= tcc; ++t)
+    {
+        int n = 0, m; fin >> m;
+
+        map<string, int> ston;
+        vector<string> ntos;
+        vector<vector<int>> g(N + 1);
+        vector<vector<vector<edge>>> a(N + 1, vector<vector<edge>>(N + 1));
+
+        for (int c = 1; c <= m; ++c)
+        {
+            string u_s, v_s; fin >> u_s >> v_s;
+            int u = getNum(n, u_s, ston, ntos), v = getNum(n, v_s, ston, ntos);
+            int t1, tp, t2; fin >> t1 >> tp;
+            t2 = (t1 + tp) % 24;
+
+
+            bool ok = false;
+            if (tp > 12)
+            {
+                ok = false;
+            }
+            else if (t1 >= 12 && t2 <= 12)
+            {
+                if (t1 >= 18 && t2 <= 6)
+                {
+                    ok = true;
+                }
+            }
+            else if ((t1 >= 18 || t2 <= 6) && t1 <= t2)
+            {
+                ok = true;
+            }
+
+            if (ok == true)
+            {
+                if (t1 == 24) t1 = 0;
+                if (t2 == 24) t2 = 0;
+
+                if (a[u][v].size() == 0)
+                {
+                    g[u].push_back(v);
+                }
+                a[u][v].push_back(_edge(t1, t2));
+            }
+        }
+
+        string s_s, e_s; fin >> s_s >> e_s;
+        int s = getNum(n, s_s, ston, ntos), e = getNum(n, e_s, ston, ntos);
+
+        if (t == 24)
+        {
+            for (int __s = 0; __s == 0; ++__s);
+        }
+
+        // fout << "START: " << s << " END: " << e << '\n';
+        // for (int u = 0; u <= n - 1; ++u)
+        //     for (int v = 0; v <= n - 1; ++v)
+        //         if (a[u][v].size() > 0) fout << u  << ' ' << v << '\n';
+        // for (int u = 0; u <= n - 1; ++u)
+        // {
+        //     for (int v = 0; v <= n - 1; ++v)
+        //     {
+        //         if (a[u][v].size() > 0)
+        //         {
+        //             fout << u  << "-->" << v << ": ";
+
+        //             int size = a[u][v].size();
+        //             for (int i = 0; i <= size - 1; ++i)
+        //             {
+        //                 if (i > 0) fout << "; ";
+        //                 fout << a[u][v][i].t1 << "-" << a[u][v][i].t2;
+        //             }
+        //             fout << '\n';
+        //         }
+        //     }
+        // }
+
+        bool isFirst = true;
+        int ans = -1;
+        vector<vector<int>> d(n, vector<int>(24, inf));
+        priority_queue<segment> pq; pq.push(_segment(s, 0, 0));
+        while (pq.empty() == false)
+        {
+            segment now = pq.top(); pq.pop();
+
+            if (isFirst == false && now.b >= d[now.u][now.t]) continue;
+            d[now.u][now.t] = now.b;
+
+            if (now.u == 3)
+            {
+                for (int __s = 0; __s == 0; ++__s);
+            }
+
+            if (now.u == e)
+            {
+                ans = now.b;
+                break;
+            }
+
+            int size0 = g[now.u].size();
+            for (int i = 0; i <= size0 - 1; ++i)
+            {
+                int v = g[now.u][i];
+
+                int size1 = a[now.u][v].size();
+                for (int j = 0; j <= size1 - 1; ++j)
+                {
+                    edge nowEdge = a[now.u][v][j];
+                    segment next;
+                    next.u = v;
+                    next.t = nowEdge.t2;
+
+                    if (isFirst == true)
+                    {
+                        next.b = now.b;
+                    }
+                    else
+                    {
+                        bool find12 = 0;
+                        for (int _t = now.t; _t != nowEdge.t1; _t = (_t + 1) % 24)
+                        {
+                            if (_t == 12)
+                            {
+                                find12 = 1;
+                                break;
+                            }
+                        }
+                        next.b = now.b + find12;
+                    }
+
+                    pq.push(next);
+                }
+            }
+
+            isFirst = false;
+        }
+
+        fout << "Test Case " << t << ".\n";
+        if (ans == -1)
+        {
+            fout << "There is no route Vladimir can take.\n";
+        }
+        else
+        {
+            fout << "Vladimir needs " << ans << " litre(s) of blood.\n";
+        }
+
+    }
+
+    return 0;
+}

myCpps/fromDuskTillDawn_UVA10187.in

@@ -0,0 +1,5 @@
+1
+2
+Berlin Paris 18 4
+Paris Madrid 0 5
+Berlin Madrid

myCpps/fromDuskTillDawn_UVA10187.out

@@ -0,0 +1,2 @@
+Test Case 1.
+Vladimir needs 0 litre(s) of blood.