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
// Przykładowe (błędne) rozwiązanie - każdy węzeł wysyła węzłowi o numerze 0
// pierwszą z cen swoich akcji. Węzeł 0 wypisuje sumę tych liczb.
#include "message.h"
#include "skup.h"

#include <bits/stdc++.h>
using namespace std;


vector<int> wektory[101];
bitset<127> ignorex;

int main() {
  /*
  assert(NumberOfCompanies() >= 1);
  PutInt(0, GetShareCost(0));
  Send(0);

  if (MyNodeId() != 0)
    return 0;

  long long Total = 0;
  for (int SendingNode = 0; SendingNode < NumberOfNodes(); ++SendingNode) {
    Receive(SendingNode);
    Total += GetInt(SendingNode);
  }

  std::cout << Total << "\n";
  */
  int my_id = MyNodeId();
  int m = NumberOfCompanies();
  int n = NumberOfNodes();
  queue<int> nowe;
  nowe.push(my_id);
  int known = 1;

  int tab[m];
  for(int i=0;i<m;i++)
  {
    wektory[my_id].push_back(GetShareCost(i));
  }
  for(int i=0;i<n;i++)
  {
    vector<int> q;
    while(!nowe.empty())
    {
      q.push_back(nowe.front());
      nowe.pop();
    }
    for(int target=0;target<n;target++)
    {
      if(target == my_id)
        continue;
      PutInt(target, q.size());
      for(int xD=0;xD<(int)q.size();xD++)
      {
        int wek = q[xD];
        PutInt(target, wek);
        PutInt(target, wektory[wek].size());
        for(int x=0;x<(int)wektory[wek].size();x++)
        {
          PutInt(target, wektory[wek][x]);
        }
      }
      Send(target);
    }
    for(int target=0;target<n;target++)
    {
      if(target == my_id || ignorex[target])
        continue;
      Receive(target);
      int tmp = GetInt(target);
      if(tmp == 0 && i == 0)
        ignorex[target] = 1;
      for(int j=0;j<tmp;j++)
      {
        int wek = GetInt(target);
        int count = GetInt(target);
        bool ignore = wektory[wek].size() > 0;
        if(!ignore)
          nowe.push(wek), known++;
        for(int x=0;x<count;x++)
        {
          int abc = GetInt(target);
          if(!ignore)
            wektory[wek].push_back(abc);
        }
      }
    }
  }
  cerr<<"known: "<<known<<endl;
  int best = 0;
  if(known == n)
    best = my_id+1;
  for(int i=0;i<n;i++)
  {
    for(int target=0;target<n;target++)
    {
      if(target == my_id)
        continue;
      PutInt(target, best);
      Send(target);
    }
    for(int target=0;target<n;target++)
    {
      if(target == my_id || ignorex[target])
        continue;
      Receive(target);
      //int tmp = GetInt(target);
      best = max(best, GetInt(target));
    }
  }

  if(best == my_id+1)
  {
    vector<int> ciag;
    for(int i=0;i<n;i++)
    {
      for(int j=0;j<(int)wektory[i].size();j++)
      {
        ciag.push_back(wektory[i][j]);
      }
    }
    sort(ciag.begin(), ciag.end());
    long long suma = 0;
    int dl = ciag.size();
    for(int i=0;i<dl;i++)
    {
      suma += (long long)ciag[i] * (long long) (dl-i);
    }
    cout<<suma<<endl;
  }
}