#include "message.h" #include "skup.h" #include <cstdio> #include <vector> #include <algorithm> const int NOD = 100; int num_nodes; int t[NOD][NOD]; std::vector<int> results; void send_ball(int v) { PutInt(v, 1); for (int i = 0; i < num_nodes; i++) { long long w = 0; for (int j = 0; j < NOD; j++) { w = 3 * w + t[i][j]; if (j % 20 == 19) { PutInt(v, w - (1LL<<31)); w = 0; } } } Send(v); } void receive_ball(int v, std::vector<int>& mask) { for (int i = 0; i < num_nodes; i++) { for (int jj = 0; jj < 5; jj++) { long long w = GetInt(v) + (1LL<<31); for (int j = jj*20+19; j >= jj*20; j--) { t[i][j] = std::max<int>(t[i][j], w % 3); w /= 3; } } } for (int i = 0; i < num_nodes; i++) mask[i] = t[i][i]; } std::vector<int> get_my_scc(int my_id) { std::vector<int> my_scc(num_nodes); std::vector<int> e(1, my_id); my_scc[my_id] = -1; while(!e.empty()) { int v = e.back(); e.pop_back(); for (int i = 0; i < num_nodes; i++) if (t[v][i] == 2 && !my_scc[i]) { e.push_back(i); my_scc[i] = v==my_id ? i+1 : my_scc[v]; } } return my_scc; } int where(int my_id) { std::vector<int> my_scc = get_my_scc(my_id); //printf("my_scc");for (int i = 0; i < num_nodes; i++) if(my_scc[i]) printf(" %d", i); printf("\n"); for (int i = 0; i < num_nodes; i++) if (t[my_id][i] && !my_scc[i]) return i; for (int i = 0; i < num_nodes; i++) if(my_scc[i]) { bool all_in = true; for (int j = 0; j < num_nodes; j++) if(t[i][j] && !my_scc[j]) { all_in = false; break; } if (!all_in) { return my_scc[i] - 1; } } int maybe_leader; for (int i = 0; i < num_nodes; i++) if (my_scc[i]) { maybe_leader = i; } if (maybe_leader == my_id) return -1; return my_scc[maybe_leader]-1; } bool compute_again = true; int leader_full(int my_id) { if (!compute_again) return my_id+1; std::vector<int> my_scc = get_my_scc(my_id); int leader = 0; for (int i = 0; i < num_nodes; i++) if(my_scc[i]) leader = i; compute_again = false; return leader; } void send_results(int count, int v) { if (results.size() > 15000) { int tr = 15000; PutInt(v, 2); PutInt(v, 1); PutInt(v, tr); while(tr--) { PutInt(v, results.back()); results.pop_back(); } Send(v); count--; } PutInt(v, 2); PutInt(v, count); PutInt(v, results.size()); for (int i = 0; i < results.size(); i++) { PutInt(v, results[i]); } Send(v); results.clear(); } int receive_results(int v) { int ret = GetInt(v); int u = GetInt(v); for (int i = 0; i < u; i++) results.push_back(GetInt(v)); return ret; } long long get_sum() { std::sort(results.begin(), results.end()); int m = results.size(); long long ret = 0; for (int i = 0; i < m; i++) ret += (m-i) * ((long long)results[i]); return ret; } int main() { num_nodes = NumberOfNodes(); int my_id = MyNodeId(); int res_ids = 1; int xx = NumberOfCompanies(); while(xx--) results.push_back(GetShareCost(xx)); std::vector<int> mask(num_nodes); for (int i = 0; i < num_nodes; i++) { if (i != my_id) { PutChar(i, 1); Send(i); } } t[my_id][my_id] = 1; for (int i = 0; i < num_nodes; i++) { if (i != my_id) { int v = Receive(i); int c = GetChar(v); if (c == 1) { t[v][my_id] = 2; PutInt(v, 0); Send(v); } } } mask[my_id] = 1; int balls = 1; std::vector<int> parents(num_nodes); std::vector<int> last_sent_mask; const std::vector<int> full(num_nodes, 1); bool found_leader = false; int leader_cache; //int msg_count = 0; while(true) { int v = Receive(-1); int x = GetInt(v); //printf("dostalem %d %d\n", v, x); //if (++msg_count > 1000) return 0; if (!x) { t[my_id][v] = std::max(t[my_id][v], 1); parents[v]++; if (parents[v] == 2) { found_leader = true; leader_cache = v; } else if (parents[v] == 3) { return 0; } } else if (x == 1) { receive_ball(v, mask); balls++; if (mask == full && !found_leader && leader_full(my_id) == my_id) { // printf("==== jestem leader ====\n"); found_leader = true; leader_cache = my_id; parents[my_id] = 2; for (int i = 0; i < num_nodes; i++) { if (i != my_id) { if (!t[i][my_id]) { PutInt(i, 0); Send(i); } PutInt(i, 0); Send(i); } } } } else { res_ids += receive_results(v); if (found_leader && my_id == leader_cache && res_ids == num_nodes) { for (int i = 0; i < num_nodes; i++) { if (i != my_id) { PutInt(i, 0); Send(i); } } printf("%lld\n", get_sum()); return 0; } } if (balls && mask != last_sent_mask) { int x = where(my_id); //printf("chcialbym wyslac do %d\n", x); if (x != -1) { send_ball(x); last_sent_mask = mask; balls--; } } if (found_leader && my_id != leader_cache && res_ids > 0) { int x = where(my_id); send_results(res_ids, x); res_ids = 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 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 | #include "message.h" #include "skup.h" #include <cstdio> #include <vector> #include <algorithm> const int NOD = 100; int num_nodes; int t[NOD][NOD]; std::vector<int> results; void send_ball(int v) { PutInt(v, 1); for (int i = 0; i < num_nodes; i++) { long long w = 0; for (int j = 0; j < NOD; j++) { w = 3 * w + t[i][j]; if (j % 20 == 19) { PutInt(v, w - (1LL<<31)); w = 0; } } } Send(v); } void receive_ball(int v, std::vector<int>& mask) { for (int i = 0; i < num_nodes; i++) { for (int jj = 0; jj < 5; jj++) { long long w = GetInt(v) + (1LL<<31); for (int j = jj*20+19; j >= jj*20; j--) { t[i][j] = std::max<int>(t[i][j], w % 3); w /= 3; } } } for (int i = 0; i < num_nodes; i++) mask[i] = t[i][i]; } std::vector<int> get_my_scc(int my_id) { std::vector<int> my_scc(num_nodes); std::vector<int> e(1, my_id); my_scc[my_id] = -1; while(!e.empty()) { int v = e.back(); e.pop_back(); for (int i = 0; i < num_nodes; i++) if (t[v][i] == 2 && !my_scc[i]) { e.push_back(i); my_scc[i] = v==my_id ? i+1 : my_scc[v]; } } return my_scc; } int where(int my_id) { std::vector<int> my_scc = get_my_scc(my_id); //printf("my_scc");for (int i = 0; i < num_nodes; i++) if(my_scc[i]) printf(" %d", i); printf("\n"); for (int i = 0; i < num_nodes; i++) if (t[my_id][i] && !my_scc[i]) return i; for (int i = 0; i < num_nodes; i++) if(my_scc[i]) { bool all_in = true; for (int j = 0; j < num_nodes; j++) if(t[i][j] && !my_scc[j]) { all_in = false; break; } if (!all_in) { return my_scc[i] - 1; } } int maybe_leader; for (int i = 0; i < num_nodes; i++) if (my_scc[i]) { maybe_leader = i; } if (maybe_leader == my_id) return -1; return my_scc[maybe_leader]-1; } bool compute_again = true; int leader_full(int my_id) { if (!compute_again) return my_id+1; std::vector<int> my_scc = get_my_scc(my_id); int leader = 0; for (int i = 0; i < num_nodes; i++) if(my_scc[i]) leader = i; compute_again = false; return leader; } void send_results(int count, int v) { if (results.size() > 15000) { int tr = 15000; PutInt(v, 2); PutInt(v, 1); PutInt(v, tr); while(tr--) { PutInt(v, results.back()); results.pop_back(); } Send(v); count--; } PutInt(v, 2); PutInt(v, count); PutInt(v, results.size()); for (int i = 0; i < results.size(); i++) { PutInt(v, results[i]); } Send(v); results.clear(); } int receive_results(int v) { int ret = GetInt(v); int u = GetInt(v); for (int i = 0; i < u; i++) results.push_back(GetInt(v)); return ret; } long long get_sum() { std::sort(results.begin(), results.end()); int m = results.size(); long long ret = 0; for (int i = 0; i < m; i++) ret += (m-i) * ((long long)results[i]); return ret; } int main() { num_nodes = NumberOfNodes(); int my_id = MyNodeId(); int res_ids = 1; int xx = NumberOfCompanies(); while(xx--) results.push_back(GetShareCost(xx)); std::vector<int> mask(num_nodes); for (int i = 0; i < num_nodes; i++) { if (i != my_id) { PutChar(i, 1); Send(i); } } t[my_id][my_id] = 1; for (int i = 0; i < num_nodes; i++) { if (i != my_id) { int v = Receive(i); int c = GetChar(v); if (c == 1) { t[v][my_id] = 2; PutInt(v, 0); Send(v); } } } mask[my_id] = 1; int balls = 1; std::vector<int> parents(num_nodes); std::vector<int> last_sent_mask; const std::vector<int> full(num_nodes, 1); bool found_leader = false; int leader_cache; //int msg_count = 0; while(true) { int v = Receive(-1); int x = GetInt(v); //printf("dostalem %d %d\n", v, x); //if (++msg_count > 1000) return 0; if (!x) { t[my_id][v] = std::max(t[my_id][v], 1); parents[v]++; if (parents[v] == 2) { found_leader = true; leader_cache = v; } else if (parents[v] == 3) { return 0; } } else if (x == 1) { receive_ball(v, mask); balls++; if (mask == full && !found_leader && leader_full(my_id) == my_id) { // printf("==== jestem leader ====\n"); found_leader = true; leader_cache = my_id; parents[my_id] = 2; for (int i = 0; i < num_nodes; i++) { if (i != my_id) { if (!t[i][my_id]) { PutInt(i, 0); Send(i); } PutInt(i, 0); Send(i); } } } } else { res_ids += receive_results(v); if (found_leader && my_id == leader_cache && res_ids == num_nodes) { for (int i = 0; i < num_nodes; i++) { if (i != my_id) { PutInt(i, 0); Send(i); } } printf("%lld\n", get_sum()); return 0; } } if (balls && mask != last_sent_mask) { int x = where(my_id); //printf("chcialbym wyslac do %d\n", x); if (x != -1) { send_ball(x); last_sent_mask = mask; balls--; } } if (found_leader && my_id != leader_cache && res_ids > 0) { int x = where(my_id); send_results(res_ids, x); res_ids = 0; } } return 0; } |