Niestety, nie byliśmy w stanie w pełni poprawnie wyświetlić tego pliku, ponieważ nie jest zakodowany w UTF-8.
Możesz pobrać ten plik i spróbować otworzyć go samodzielnie.
//Jakub Staro� #include <iostream> #include <string> #include <vector> #include <map> #include <set> #include <list> #include <deque> #include <queue> #include <stack> #include <algorithm> #include <cstdlib> #include <ctime> #include <unordered_map> #include <unordered_set> #include "message.h" #include "kanapka.h" #ifdef COMPILING_HOME #define DEBUG_MODE #endif using namespace std; typedef char int8; typedef unsigned char uint8; typedef short int int16; typedef unsigned short int uint16; typedef int int32; typedef unsigned int uint32; typedef long long int64; typedef unsigned long long uint64; typedef std::pair <int32, int32> int32_pair; typedef std::pair <uint32, uint32> uint32_pair; typedef std::pair <int64, int64> int64_pair; typedef std::pair <uint64, uint64> uint64_pair; typedef std::vector<bool> bit_vector; #ifdef DEBUG_MODE #define debug_print(x) cerr << #x << " = " << x << endl #define print_line cerr << "Line " << __LINE__ << endl #include <cassert> #else #define debug_print(x) #define print_line #define assert(x) #endif #define rep(i, x) for(int32 i = 0 ; i < (x) ; i++) #define for_range(i, begin, end) for(auto i = (begin) ; i != (end) ; ++i ) #define all(c) (c).begin(),(c).end() #define sort_all(x) sort( all(x) ) #define divide(a, b) ( ( (b)%(a) ) == 0 ) #define mp(x, y) make_pair(x,y) #define pb(x) push_back(x) #define sig(x) ( (x) == 0 ? 0 : ( (x) < 0 ? -1 : 1 ) ) const double epsilon = 1e-5; template<class T> void unique(std::vector <T> &v) { sort_all(v); v.resize(std::unique(all(v)) - v.begin()); } ostream &newline(ostream &str) { str.put('\n'); return str; } template<typename T1, typename T2> istream &operator>>(istream &stream, std::pair <T1, T2> &pair) { stream >> pair.first >> pair.second; return stream; } template<typename T1, typename T2> ostream &operator<<(ostream &stream, const std::pair <T1, T2> &pair) { #ifdef DEBUG_MODE stream << "(" << pair.first << ", " << pair.second << ")"; #else stream << pair.first << ' ' << pair.second; #endif return stream; } template<class T> inline pair <T, T> operator+(const pair <T, T> &a, const pair <T, T> &b) { return pair<T, T>(a.first + b.first, a.second + b.second); } template<class T> inline pair <T, T> operator-(const pair <T, T> &a, const pair <T, T> &b) { return pair<T, T>(a.first - b.first, a.second - b.second); } template<class T> ostream &operator<<(ostream &str, const vector <T> &v) { if (!v.empty()) { for (int32 i = 0; i + 1 < v.size(); i++) str << v[i] << ' '; str << v.back(); } return str; } class Graf { public: typedef vector <uint32> list_type; void resize(uint32 k) { graf.resize(k); } void add(uint32 a, uint32 b) { graf[a].push_back(b); graf[b].push_back(a); } uint32 deg(uint32 k) { return graf[k].size(); } list_type &obok(uint32 k) { return graf[k]; } uint32 size() { return graf.size(); } private: vector <list_type> graf; }; const int64 infinity = 1000000000000000000LL; class Application { public: Application() { } void Run() { WczytajDane(); if (myNodeId == 0) Master(); else Slave(); } void Master() { uint64 number = numberOfNodes - 1; vector <int64> sum(number); vector <int64> max_prefix(number); vector <int64> max_suffix(number); vector <int64> max_prefix_suffix_sum(number); rep(i, number) { int32 id = Receive(-1); int32 index = id - 1; sum[index] = GetLL(id); max_prefix[index] = GetLL(id); max_suffix[index] = GetLL(id); max_prefix_suffix_sum[index] = GetLL(id); } int64 sum_of_all = 0; for(int64 k : sum) sum_of_all += k; int64 best_result = -infinity; rep(begin, number) { for_range(end, begin, number) { int64 result; if (begin == end) { result = sum_of_all - sum[begin] + max_prefix_suffix_sum[begin]; } else { result = 0; for_range(i, 0, begin) result += sum[i]; for_range(i, end + 1, number) result += sum[i]; result += max_prefix[begin]; result += max_suffix[end]; } if (result > best_result) best_result = result; } } cout << best_result << newline; } void Slave() { uint64 number = numberOfNodes - 1; uint64 myId = myNodeId - 1; uint64 step = (N + number - 1) / number; uint64 begin = step * myId; uint64 end = min(step * (myId + 1), N); vector <int64> V(step); rep(i, step) V[i] = GetTaste(i + begin); vector <int64> prefixes(step + 1); vector <int64> suffixes(step + 1); rep(i, step) { prefixes[i + 1] = prefixes[i] + V[i]; suffixes[i + 1] = suffixes[i] + V[step - i - 1]; } int64 sum = prefixes.back(); int64 max_prefix = *max_element(all(prefixes)); int64 max_suffix = *max_element(all(suffixes)); int64 max_prefix_suffix_sum = -infinity; { int64 max_prefix = prefixes[0]; rep(i, step + 1) { max_prefix = max(max_prefix, prefixes[i]); int64 sum = suffixes[step - i] + max_prefix; if (sum > max_prefix_suffix_sum) max_prefix_suffix_sum = sum; } } PutLL(0, sum); PutLL(0, max_prefix); PutLL(0, max_suffix); PutLL(0, max_prefix_suffix_sum); Send(0); } void WczytajDane() { numberOfNodes = NumberOfNodes(); myNodeId = MyNodeId(); N = GetN(); } uint64 numberOfNodes; uint64 myNodeId; uint64 N; }; int main() { ios::sync_with_stdio(0); Application application; application.Run(); 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 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 | //Jakub Staro� #include <iostream> #include <string> #include <vector> #include <map> #include <set> #include <list> #include <deque> #include <queue> #include <stack> #include <algorithm> #include <cstdlib> #include <ctime> #include <unordered_map> #include <unordered_set> #include "message.h" #include "kanapka.h" #ifdef COMPILING_HOME #define DEBUG_MODE #endif using namespace std; typedef char int8; typedef unsigned char uint8; typedef short int int16; typedef unsigned short int uint16; typedef int int32; typedef unsigned int uint32; typedef long long int64; typedef unsigned long long uint64; typedef std::pair <int32, int32> int32_pair; typedef std::pair <uint32, uint32> uint32_pair; typedef std::pair <int64, int64> int64_pair; typedef std::pair <uint64, uint64> uint64_pair; typedef std::vector<bool> bit_vector; #ifdef DEBUG_MODE #define debug_print(x) cerr << #x << " = " << x << endl #define print_line cerr << "Line " << __LINE__ << endl #include <cassert> #else #define debug_print(x) #define print_line #define assert(x) #endif #define rep(i, x) for(int32 i = 0 ; i < (x) ; i++) #define for_range(i, begin, end) for(auto i = (begin) ; i != (end) ; ++i ) #define all(c) (c).begin(),(c).end() #define sort_all(x) sort( all(x) ) #define divide(a, b) ( ( (b)%(a) ) == 0 ) #define mp(x, y) make_pair(x,y) #define pb(x) push_back(x) #define sig(x) ( (x) == 0 ? 0 : ( (x) < 0 ? -1 : 1 ) ) const double epsilon = 1e-5; template<class T> void unique(std::vector <T> &v) { sort_all(v); v.resize(std::unique(all(v)) - v.begin()); } ostream &newline(ostream &str) { str.put('\n'); return str; } template<typename T1, typename T2> istream &operator>>(istream &stream, std::pair <T1, T2> &pair) { stream >> pair.first >> pair.second; return stream; } template<typename T1, typename T2> ostream &operator<<(ostream &stream, const std::pair <T1, T2> &pair) { #ifdef DEBUG_MODE stream << "(" << pair.first << ", " << pair.second << ")"; #else stream << pair.first << ' ' << pair.second; #endif return stream; } template<class T> inline pair <T, T> operator+(const pair <T, T> &a, const pair <T, T> &b) { return pair<T, T>(a.first + b.first, a.second + b.second); } template<class T> inline pair <T, T> operator-(const pair <T, T> &a, const pair <T, T> &b) { return pair<T, T>(a.first - b.first, a.second - b.second); } template<class T> ostream &operator<<(ostream &str, const vector <T> &v) { if (!v.empty()) { for (int32 i = 0; i + 1 < v.size(); i++) str << v[i] << ' '; str << v.back(); } return str; } class Graf { public: typedef vector <uint32> list_type; void resize(uint32 k) { graf.resize(k); } void add(uint32 a, uint32 b) { graf[a].push_back(b); graf[b].push_back(a); } uint32 deg(uint32 k) { return graf[k].size(); } list_type &obok(uint32 k) { return graf[k]; } uint32 size() { return graf.size(); } private: vector <list_type> graf; }; const int64 infinity = 1000000000000000000LL; class Application { public: Application() { } void Run() { WczytajDane(); if (myNodeId == 0) Master(); else Slave(); } void Master() { uint64 number = numberOfNodes - 1; vector <int64> sum(number); vector <int64> max_prefix(number); vector <int64> max_suffix(number); vector <int64> max_prefix_suffix_sum(number); rep(i, number) { int32 id = Receive(-1); int32 index = id - 1; sum[index] = GetLL(id); max_prefix[index] = GetLL(id); max_suffix[index] = GetLL(id); max_prefix_suffix_sum[index] = GetLL(id); } int64 sum_of_all = 0; for(int64 k : sum) sum_of_all += k; int64 best_result = -infinity; rep(begin, number) { for_range(end, begin, number) { int64 result; if (begin == end) { result = sum_of_all - sum[begin] + max_prefix_suffix_sum[begin]; } else { result = 0; for_range(i, 0, begin) result += sum[i]; for_range(i, end + 1, number) result += sum[i]; result += max_prefix[begin]; result += max_suffix[end]; } if (result > best_result) best_result = result; } } cout << best_result << newline; } void Slave() { uint64 number = numberOfNodes - 1; uint64 myId = myNodeId - 1; uint64 step = (N + number - 1) / number; uint64 begin = step * myId; uint64 end = min(step * (myId + 1), N); vector <int64> V(step); rep(i, step) V[i] = GetTaste(i + begin); vector <int64> prefixes(step + 1); vector <int64> suffixes(step + 1); rep(i, step) { prefixes[i + 1] = prefixes[i] + V[i]; suffixes[i + 1] = suffixes[i] + V[step - i - 1]; } int64 sum = prefixes.back(); int64 max_prefix = *max_element(all(prefixes)); int64 max_suffix = *max_element(all(suffixes)); int64 max_prefix_suffix_sum = -infinity; { int64 max_prefix = prefixes[0]; rep(i, step + 1) { max_prefix = max(max_prefix, prefixes[i]); int64 sum = suffixes[step - i] + max_prefix; if (sum > max_prefix_suffix_sum) max_prefix_suffix_sum = sum; } } PutLL(0, sum); PutLL(0, max_prefix); PutLL(0, max_suffix); PutLL(0, max_prefix_suffix_sum); Send(0); } void WczytajDane() { numberOfNodes = NumberOfNodes(); myNodeId = MyNodeId(); N = GetN(); } uint64 numberOfNodes; uint64 myNodeId; uint64 N; }; int main() { ios::sync_with_stdio(0); Application application; application.Run(); return 0; } |