#include <bits/stdc++.h> #include "message.h" #include "dzialka.h" using namespace std; // int GetFieldHeight() { // return 50000; // } // // int GetFieldWidth() { // return 50000; // } // // int IsUsableCell(int x, int y) { // if (x != y) return 1; else return 0;; // } const int N = 75005, INF = 1e9; int m, id; int height[N], heightUpper[N]; pair<int, int > S[N]; int size; long long solve() { size = 0; S[++size] = {-INF - 1, -1}; long long ret = 0; long long area = 0; for (int i = 0; i < m; i++) { while (S[size].first >= height[i]) { area -= (long long)S[size].first * (S[size].second - S[size - 1].second); size--; } area += (long long)(i - S[size].second) * height[i]; ret += area; S[++size] = {height[i], i}; } return ret; } int howManyRows[105]; int readArray(int target, int *tab) { // cerr << "Jestem " << id << " i czytam od " << target << endl; target--; int start = 0; if (m >= 50000) { Receive(target); for (int i = 0; i < 50000; i++) { tab[i] = GetInt(target); } start = 50000; } Receive(target); for (int i = start; i < m; i++) { tab[i] = GetInt(target); } // cerr << "Jestem " << id << " i przeczytalem od " << target + 1 << endl; return GetInt(target); } void sendArray(int target, int *tab, int length) { // cerr << "Wysylam z " << id << "do " << target << endl; target--; int start = 0; if (m >= 50000) { for (int i = 0; i < 50000; i++) { PutInt(target, tab[i]); } Send(target); start = 50000; } for (int i = start; i < m; i++) { PutInt(target, tab[i]); } PutInt(target, length); Send(target); // cerr << "Jestem " << id << " i wyslalem do " << target + 1 << endl; } void joinArrays(int *tab, int *upper, int rows) { for (int i = 0; i < m; i++) { if (tab[i] < 0) { tab[i] = upper[i] + rows; } } } int main() { int n = GetFieldHeight(); howManyRows[100] = 0; for (int i = 99; i >= 0; i--) { howManyRows[i] = howManyRows[i + 1] + 10; } /* howManyRows[100] = 300; for (int i = 99; i >= 0; i--) { howManyRows[i] = howManyRows[i + 1] + 9; }*/ m = GetFieldWidth(); int nodes = max(2, min(2 * n - 1, NumberOfNodes())); unsigned long long ans = 0; int base = 2; while (base < nodes - base + 1) { base *= 2; } // cerr << nodes << " " << base << endl; id = MyNodeId(); if (id >= nodes) { return 0; } // cerr << nodes << " " << base << endl; id++; if (id >= base) { int rowFrom = (id - base) * n / (nodes - base + 1); int rowTo = min(n, (id - base + 1) * n / (nodes - base + 1)); int rows = rowTo - rowFrom; // cerr << id << " " << rowFrom << " " << rows << " " << n << endl; for (int i = 0; i < rows; i++) { for (int j = 0; j < m; j++) { int usable = IsUsableCell(i + rowFrom, j); height[j] = usable ? (i == 0 ? -INF : (height[j] + 1)) : 0; } } sendArray(id / 2, height, rows); readArray(id / 2, heightUpper); for (int i = 0; i < m; i++) { height[i] = 0; } for (int i = 0; i < rows; i++) { for (int j = 0; j < m; j++) { int usable = IsUsableCell(i + rowFrom, j); height[j] = usable ? (i == 0 ? heightUpper[j] + 1 : (height[j] + 1)) : 0; } ans += solve(); } // cerr << "Jestem " << id << ", obliczylem " << ans << " i wysylam do 0" << endl; PutLL(0, ans); Send(0); } if (id > 1 && id < base) { int tmp1 = id; while (tmp1 < base) tmp1 *= 2; if (tmp1 > nodes) { return 0; } int l1 = readArray(2 * id, heightUpper); int tmp = 2 * id + 1; while (tmp < base) tmp *= 2; bool shouldCommunicate = tmp <= nodes; if (shouldCommunicate) { int l2 = readArray(2 * id + 1, height); joinArrays(height, heightUpper, l2); sendArray(id / 2, height, l1 + l2); } else { sendArray(id / 2, heightUpper, l1); } int l = readArray(id / 2, height); sendArray(2 * id, height, l); if (shouldCommunicate) { joinArrays(heightUpper, height, l1); sendArray(2 * id + 1, heightUpper, l + l1); } } if (id == 1) { sendArray(2 * id, height, 0); int l1 = readArray(2 * id, heightUpper); joinArrays(heightUpper, height, l1); int tmp = 2 * id + 1; while (tmp < base) tmp *= 2; if (tmp <= nodes) { bool shouldCommunicate = tmp <= nodes; int l2 = readArray(2 * id + 1, height); sendArray(2 * id + 1, heightUpper, l1); } } if (id == 1) { for (int i = 1; i <= nodes - base + 1; i++) { // cerr << "elo\n"; int inst = Receive(-1); ans += (unsigned long long)GetLL(inst); } printf("%llu\n", ans); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 | #include <bits/stdc++.h> #include "message.h" #include "dzialka.h" using namespace std; // int GetFieldHeight() { // return 50000; // } // // int GetFieldWidth() { // return 50000; // } // // int IsUsableCell(int x, int y) { // if (x != y) return 1; else return 0;; // } const int N = 75005, INF = 1e9; int m, id; int height[N], heightUpper[N]; pair<int, int > S[N]; int size; long long solve() { size = 0; S[++size] = {-INF - 1, -1}; long long ret = 0; long long area = 0; for (int i = 0; i < m; i++) { while (S[size].first >= height[i]) { area -= (long long)S[size].first * (S[size].second - S[size - 1].second); size--; } area += (long long)(i - S[size].second) * height[i]; ret += area; S[++size] = {height[i], i}; } return ret; } int howManyRows[105]; int readArray(int target, int *tab) { // cerr << "Jestem " << id << " i czytam od " << target << endl; target--; int start = 0; if (m >= 50000) { Receive(target); for (int i = 0; i < 50000; i++) { tab[i] = GetInt(target); } start = 50000; } Receive(target); for (int i = start; i < m; i++) { tab[i] = GetInt(target); } // cerr << "Jestem " << id << " i przeczytalem od " << target + 1 << endl; return GetInt(target); } void sendArray(int target, int *tab, int length) { // cerr << "Wysylam z " << id << "do " << target << endl; target--; int start = 0; if (m >= 50000) { for (int i = 0; i < 50000; i++) { PutInt(target, tab[i]); } Send(target); start = 50000; } for (int i = start; i < m; i++) { PutInt(target, tab[i]); } PutInt(target, length); Send(target); // cerr << "Jestem " << id << " i wyslalem do " << target + 1 << endl; } void joinArrays(int *tab, int *upper, int rows) { for (int i = 0; i < m; i++) { if (tab[i] < 0) { tab[i] = upper[i] + rows; } } } int main() { int n = GetFieldHeight(); howManyRows[100] = 0; for (int i = 99; i >= 0; i--) { howManyRows[i] = howManyRows[i + 1] + 10; } /* howManyRows[100] = 300; for (int i = 99; i >= 0; i--) { howManyRows[i] = howManyRows[i + 1] + 9; }*/ m = GetFieldWidth(); int nodes = max(2, min(2 * n - 1, NumberOfNodes())); unsigned long long ans = 0; int base = 2; while (base < nodes - base + 1) { base *= 2; } // cerr << nodes << " " << base << endl; id = MyNodeId(); if (id >= nodes) { return 0; } // cerr << nodes << " " << base << endl; id++; if (id >= base) { int rowFrom = (id - base) * n / (nodes - base + 1); int rowTo = min(n, (id - base + 1) * n / (nodes - base + 1)); int rows = rowTo - rowFrom; // cerr << id << " " << rowFrom << " " << rows << " " << n << endl; for (int i = 0; i < rows; i++) { for (int j = 0; j < m; j++) { int usable = IsUsableCell(i + rowFrom, j); height[j] = usable ? (i == 0 ? -INF : (height[j] + 1)) : 0; } } sendArray(id / 2, height, rows); readArray(id / 2, heightUpper); for (int i = 0; i < m; i++) { height[i] = 0; } for (int i = 0; i < rows; i++) { for (int j = 0; j < m; j++) { int usable = IsUsableCell(i + rowFrom, j); height[j] = usable ? (i == 0 ? heightUpper[j] + 1 : (height[j] + 1)) : 0; } ans += solve(); } // cerr << "Jestem " << id << ", obliczylem " << ans << " i wysylam do 0" << endl; PutLL(0, ans); Send(0); } if (id > 1 && id < base) { int tmp1 = id; while (tmp1 < base) tmp1 *= 2; if (tmp1 > nodes) { return 0; } int l1 = readArray(2 * id, heightUpper); int tmp = 2 * id + 1; while (tmp < base) tmp *= 2; bool shouldCommunicate = tmp <= nodes; if (shouldCommunicate) { int l2 = readArray(2 * id + 1, height); joinArrays(height, heightUpper, l2); sendArray(id / 2, height, l1 + l2); } else { sendArray(id / 2, heightUpper, l1); } int l = readArray(id / 2, height); sendArray(2 * id, height, l); if (shouldCommunicate) { joinArrays(heightUpper, height, l1); sendArray(2 * id + 1, heightUpper, l + l1); } } if (id == 1) { sendArray(2 * id, height, 0); int l1 = readArray(2 * id, heightUpper); joinArrays(heightUpper, height, l1); int tmp = 2 * id + 1; while (tmp < base) tmp *= 2; if (tmp <= nodes) { bool shouldCommunicate = tmp <= nodes; int l2 = readArray(2 * id + 1, height); sendArray(2 * id + 1, heightUpper, l1); } } if (id == 1) { for (int i = 1; i <= nodes - base + 1; i++) { // cerr << "elo\n"; int inst = Receive(-1); ans += (unsigned long long)GetLL(inst); } printf("%llu\n", ans); } return 0; } |