junk

Author: arknave

Diff for: codeforces/gym/100796/journey.cpp

@@ -0,0 +1,97 @@
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+#include <utility>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+const int MAXN = 505;
+
+const int dx[] = {1, 0, -1, 0};
+const int dy[] = {0, -1, 0, 1};
+
+int n, m;
+int a, b;
+// true means you can walk there
+bool grid[MAXN][MAXN];
+
+char row[MAXN];
+
+struct state {
+    int x, y, dist;
+    bool is_town;
+
+    bool operator<(const state& other) const {
+        return other.dist < dist;
+    }
+};
+
+inline bool in_bounds(int x, int y) {
+    return 0 <= x and x < n and 0 <= y and y < m;
+}
+
+void read() {
+    scanf("%d %d", &m, &n);
+    scanf("%d %d", &a, &b);
+    memset(grid, false, sizeof(grid));
+
+    for (int i = 0; i < n; ++i) {
+        scanf("%s", row);
+        for (int j = 0; j < m; ++j) {
+            grid[i][j] = (row[j] == '.');
+        }
+    }
+
+    /*
+    for (int i = 0; i < n; ++i) {
+        for (int j = 0; j < m; ++j) {
+            printf("%d", grid[i][j]);
+        }
+        puts("");
+    }
+    */
+}
+
+void solve() {
+    if (!grid[0][0] or !grid[n - 1][m - 1]) {
+        puts("IMPOSSIBLE");
+        return;
+    }
+
+    state start = {0, 0, 0, true};
+    priority_queue<state> pq;
+    pq.push(start);
+
+    while (!pq.empty()) {
+        state cur = pq.top();
+        pq.pop();
+
+        if (cur.x == n - 1 and cur.y == m - 1) {
+            printf("%d\n", cur.dist);
+            return;
+        }
+
+        if (!grid[cur.x][cur.y]) continue;
+
+        grid[cur.x][cur.y] = false;
+
+        for (int d = 0; d < 4; ++d) {
+            int nx = cur.x + dx[d];
+            int ny = cur.y + dy[d];
+            if (in_bounds(nx, ny) and grid[nx][ny]) {
+                state next_state = {nx, ny, cur.dist + (cur.is_town ? b : a), !cur.is_town};
+                pq.push(next_state);
+            }
+        }
+    }
+
+    puts("IMPOSSIBLE");
+}
+
+int main() {
+    read();
+    solve();
+    return 0;
+}

Diff for: hackerrank/cube_summation.cpp

@@ -0,0 +1,76 @@
+#include <cstdio>
+#include <cstring>
+
+using namespace std;
+
+const int MAXN = 102;
+int n, m;
+long long f_tree[MAXN][MAXN][MAXN];
+
+char command[20];
+
+void update(int x, int y, int z, int v) {
+    for (int i = x; i < MAXN; i += (i & -i)) {
+        for (int j = y; j < MAXN; j += (j & -j)) {
+            for (int k = z; k < MAXN; k += (k & -k)) {
+                f_tree[i][j][k] += v;
+            }
+        }
+    }
+}
+
+long long query(int x, int y, int z) {
+    long long ans = 0;
+    for (int i = x; i > 0; i -= (i & -i)) {
+        for (int j = y; j > 0; j -= (j & -j)) {
+            for (int k = z; k > 0; k -= (k & -k)) {
+                ans += f_tree[i][j][k];
+            }
+        }
+    }
+
+    return ans;
+}
+
+long long query(int x1, int y1, int z1, int x2, int y2, int z2) {
+    long long ans = query(x2, y2, z2);
+    ans -= query(x1 - 1, y2, z2);
+    ans -= query(x2, y1 - 1, z2);
+    ans -= query(x2, y2, z1 - 1);
+
+    ans += query(x2, y1 - 1, z1 - 1);
+    ans += query(x1 - 1, y2, z1 - 1);
+    ans += query(x1 - 1, y1 - 1, z2);
+
+    ans -= query(x1 - 1, y1 - 1, z1 - 1);
+
+    return ans;
+}
+
+int main() {
+    int T;
+    scanf("%d", &T);
+
+    int x1, y1, z1, x2, y2, z2, v;
+    while (T-- > 0) {
+        scanf("%d %d", &n, &m);
+        memset(f_tree, 0, sizeof(f_tree));
+
+        while (m-- > 0) {
+            scanf("%s", command);
+
+            if (command[0] == 'U') {
+                scanf("%d %d %d %d", &x1, &y1, &z1, &v);
+                long long old_v = query(x1, y1, z1, x1, y1, z1);
+                update(x1, y1, z1, v - old_v);
+            } else {
+                scanf("%d %d %d %d %d %d", &x1, &y1, &z1, &x2, &y2, &z2);
+                long long ans = query(x1, y1, z1, x2, y2, z2);
+
+                printf("%lld\n", ans);
+            }
+        }
+    }
+
+    return 0;
+}