#include "kanapka.h" #include "message.h" #include <algorithm> #include <iostream> using namespace std; long long msg_response[100][4]; int main() { int id = MyNodeId(); int instances_num = NumberOfNodes(); long long n = GetN(); long long step = n/instances_num; if(id != instances_num - 1){ long long left = 0; long long left_id = -1; long long total = 0; for(long long i = id*step; i < (id+1)*step; ++i){ total += GetTaste(i); if(total > left){ left = total; left_id = i; } } long long right = 0; long long right_id = -1; long long temp = 0; for(long long i = (id+1)*step - 1; i > id*step-1; --i){ temp += GetTaste(i); if(temp > right){ right = temp; right_id = i; } } long long lr = left + right; if(left_id >= right_id && right_id != -1 && left_id != -1){ long long lrr = left; long long i; for(i = left_id; i >= right_id; i--){ lrr -= GetTaste(i); } temp = lrr; while(i >= id*step){ temp -= GetTaste(i); if(temp > lrr) lrr = temp; --i; } long long llr = right; for(i = right_id; i <= left_id; i++){ llr -= GetTaste(i); } temp = llr; while(i <= (id+1)*step - 1){ temp -= GetTaste(i); if(temp > llr) llr = temp; ++i; } if(lrr > llr) lr = lrr + right; else lr = llr + left; } if(id != 0){ PutLL(0, total); PutLL(0, left); PutLL(0, right); PutLL(0, lr); Send(0); } else{//Central instance id 0 msg_response[0][0] = total; msg_response[0][1] = left; msg_response[0][2] = right; msg_response[0][3] = lr; for(int i=1; i < instances_num; i++){ Receive(i); for(int j=0; j<4; j++) msg_response[i][j] = GetLL(i); } long long res = 0; long long sum = 0; for(int i=0; i<instances_num; i++) //Eating full sandwich sum += msg_response[i][0]; if(sum > res) res = sum; //cout<<res<<endl; for(int i=0; i<instances_num; i++){//Meeting inside one section left_right sum -= msg_response[i][0]; sum += msg_response[i][3]; if(sum > res) res = sum; sum -= msg_response[i][3]; sum += msg_response[i][0]; } //cout<<res<<endl; long long left_sum = 0; long long right_sum = 0; for(int j=instances_num - 1; j >= 0; j--){ right_sum += msg_response[j][2]; if(right_sum > res) res = right_sum; right_sum -= msg_response[j][2]; right_sum += msg_response[j][0]; } for(int i=0; i<instances_num; i++){ left_sum += msg_response[i][1]; if(left_sum > res) res = left_sum; left_sum -= msg_response[i][1]; left_sum += msg_response[i][0]; } //cout<<res<<endl; right_sum = 0; left_sum = 0; for(int i=0; i<instances_num; i++){//Not meeting inside one section left_sum += msg_response[i][1]; right_sum = 0; for(int j=instances_num - 1; j > i; j--){ right_sum += msg_response[j][2]; if(left_sum + right_sum > res) res = left_sum + right_sum; right_sum -= msg_response[j][2]; right_sum += msg_response[j][0]; } left_sum -= msg_response[i][1]; left_sum += msg_response[i][0]; } cout<<res<<endl; } } else{//Last instance long long left = 0; long long left_id = -1; long long total = 0; for(long long i = id*step; i < n; ++i){ total += GetTaste(i); if(total > left){ left = total; left_id = i; } } long long right = 0; long long right_id = -1; long long temp = 0; for(long long i = n - 1; i > id*step-1; --i){ temp += GetTaste(i); if(temp > right){ right = temp; right_id = i; } } long long lr = left + right; //cout<<lr<<"\t"<<left_id<<"\t"<<right_id<<endl; if(left_id >= right_id && right_id != -1 && left_id != -1){ long long lrr = left; long long i; for(i = left_id; i >= right_id; i--){ lrr -= GetTaste(i); } temp = lrr; while(i >= id*step){ temp -= GetTaste(i); if(temp > lrr) lrr = temp; --i; } long long llr = right; for(i = right_id; i <= left_id; i++){ llr -= GetTaste(i); } temp = llr; while(i <= n - 1){ temp -= GetTaste(i); if(temp > llr) llr = temp; ++i; } if(lrr > llr) lr = lrr + right; else lr = llr + left; } PutLL(0, total); PutLL(0, left); PutLL(0, right); PutLL(0, lr); Send(0); } 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 | #include "kanapka.h" #include "message.h" #include <algorithm> #include <iostream> using namespace std; long long msg_response[100][4]; int main() { int id = MyNodeId(); int instances_num = NumberOfNodes(); long long n = GetN(); long long step = n/instances_num; if(id != instances_num - 1){ long long left = 0; long long left_id = -1; long long total = 0; for(long long i = id*step; i < (id+1)*step; ++i){ total += GetTaste(i); if(total > left){ left = total; left_id = i; } } long long right = 0; long long right_id = -1; long long temp = 0; for(long long i = (id+1)*step - 1; i > id*step-1; --i){ temp += GetTaste(i); if(temp > right){ right = temp; right_id = i; } } long long lr = left + right; if(left_id >= right_id && right_id != -1 && left_id != -1){ long long lrr = left; long long i; for(i = left_id; i >= right_id; i--){ lrr -= GetTaste(i); } temp = lrr; while(i >= id*step){ temp -= GetTaste(i); if(temp > lrr) lrr = temp; --i; } long long llr = right; for(i = right_id; i <= left_id; i++){ llr -= GetTaste(i); } temp = llr; while(i <= (id+1)*step - 1){ temp -= GetTaste(i); if(temp > llr) llr = temp; ++i; } if(lrr > llr) lr = lrr + right; else lr = llr + left; } if(id != 0){ PutLL(0, total); PutLL(0, left); PutLL(0, right); PutLL(0, lr); Send(0); } else{//Central instance id 0 msg_response[0][0] = total; msg_response[0][1] = left; msg_response[0][2] = right; msg_response[0][3] = lr; for(int i=1; i < instances_num; i++){ Receive(i); for(int j=0; j<4; j++) msg_response[i][j] = GetLL(i); } long long res = 0; long long sum = 0; for(int i=0; i<instances_num; i++) //Eating full sandwich sum += msg_response[i][0]; if(sum > res) res = sum; //cout<<res<<endl; for(int i=0; i<instances_num; i++){//Meeting inside one section left_right sum -= msg_response[i][0]; sum += msg_response[i][3]; if(sum > res) res = sum; sum -= msg_response[i][3]; sum += msg_response[i][0]; } //cout<<res<<endl; long long left_sum = 0; long long right_sum = 0; for(int j=instances_num - 1; j >= 0; j--){ right_sum += msg_response[j][2]; if(right_sum > res) res = right_sum; right_sum -= msg_response[j][2]; right_sum += msg_response[j][0]; } for(int i=0; i<instances_num; i++){ left_sum += msg_response[i][1]; if(left_sum > res) res = left_sum; left_sum -= msg_response[i][1]; left_sum += msg_response[i][0]; } //cout<<res<<endl; right_sum = 0; left_sum = 0; for(int i=0; i<instances_num; i++){//Not meeting inside one section left_sum += msg_response[i][1]; right_sum = 0; for(int j=instances_num - 1; j > i; j--){ right_sum += msg_response[j][2]; if(left_sum + right_sum > res) res = left_sum + right_sum; right_sum -= msg_response[j][2]; right_sum += msg_response[j][0]; } left_sum -= msg_response[i][1]; left_sum += msg_response[i][0]; } cout<<res<<endl; } } else{//Last instance long long left = 0; long long left_id = -1; long long total = 0; for(long long i = id*step; i < n; ++i){ total += GetTaste(i); if(total > left){ left = total; left_id = i; } } long long right = 0; long long right_id = -1; long long temp = 0; for(long long i = n - 1; i > id*step-1; --i){ temp += GetTaste(i); if(temp > right){ right = temp; right_id = i; } } long long lr = left + right; //cout<<lr<<"\t"<<left_id<<"\t"<<right_id<<endl; if(left_id >= right_id && right_id != -1 && left_id != -1){ long long lrr = left; long long i; for(i = left_id; i >= right_id; i--){ lrr -= GetTaste(i); } temp = lrr; while(i >= id*step){ temp -= GetTaste(i); if(temp > lrr) lrr = temp; --i; } long long llr = right; for(i = right_id; i <= left_id; i++){ llr -= GetTaste(i); } temp = llr; while(i <= n - 1){ temp -= GetTaste(i); if(temp > llr) llr = temp; ++i; } if(lrr > llr) lr = lrr + right; else lr = llr + left; } PutLL(0, total); PutLL(0, left); PutLL(0, right); PutLL(0, lr); Send(0); } return 0; } |