01:07(160)

subway/subway.cpp

@@ -2,7 +2,7 @@
 using namespace std;
 int c, n, m, d, q; // 25 500 5e5 20 1e5
 int w[500005];
-vector<pair<int, int>> fri[500505];
+vector<pair<long long, int>> fri[500505];
 long long de[500505];
 long long dline[505][505];
 priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
@@ -13,7 +13,7 @@ void dig(int s) {
     while(!pq.empty()) {
         pair<long long, int> u = pq.top();
         pq.pop();
-        for(pair<int, int> v : fri[u.second]) {
+        for(pair<long long, int> v : fri[u.second]) {
             if(de[v.second] > de[u.second] + v.first) {
                 de[v.second] = de[u.second] + v.first;
                 pq.push({de[v.second], v.second});
@@ -30,8 +30,9 @@ int main() {
     }
     for(int i = 1, k; i <= n; ++i) {
         scanf("%d", &k);
-        for(int j = 1, sta, ti; j <= k; ++j) {
-            scanf("%d%d", &sta, &ti);
+        for(int j = 1, sta; j <= k; ++j) {
+            long long ti;
+            scanf("%d%lld", &sta, &ti);
             fri[m + i].push_back({ti, sta});
             fri[sta].push_back({ti, m + i});
         }
@@ -48,13 +49,13 @@ int main() {
         int x, y;
         scanf("%d%d", &x, &y);
         long long ans = LLONG_MAX;
-        for(pair<int, int> i : fri[x]) {
-            for(pair<int, int> j : fri[y]) {
+        for(pair<long long, int> i : fri[x]) {
+            for(pair<long long, int> j : fri[y]) {
                 ans = min(ans, dline[i.second - m][j.second - m] + i.first + j.first);
             }
         }
         // dig(x);
-        printf("%lld\n", w[x] + w[y] + ans);
+        printf("%lld\n", 1ll * w[x] + 1ll * w[y] + ans);
     }
     return 0;
 }