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
#include <iostream>

#include "message.h"
#include "teatr.h"
#include <vector>
#include <tuple>

using namespace std;


int64_t  merge(int arr[], int temp[], int left, int mid, int right){
    // zliczajacy mergesort zerznięte z googlow, jest 23 :)

    int i, j, k;
    int64_t  inv_count = 0;

    i = left; /* i is index for left subarray*/
    j = mid;  /* j is index for right subarray*/
    k = left; /* k is index for resultant merged subarray*/

    while ((i <= mid - 1) && (j <= right)){
        if (arr[i] <= arr[j]){
            temp[k++] = arr[i++];
        }
        else{
            temp[k++] = arr[j++];
            inv_count = inv_count + (mid - i);
        }
    }
    while (i <= mid - 1)
        temp[k++] = arr[i++];

    while (j <= right)
        temp[k++] = arr[j++];


    for (i=left; i <= right; i++)
        arr[i] = temp[i];

    return inv_count;
}

int64_t  _mergeSort(int arr[], int temp[], int left, int right){

    int64_t inv_count = 0;
    int mid;
    if (right > left)   {
        mid = (right + left)/2;
        inv_count  = _mergeSort(arr, temp, left, mid);
        inv_count += _mergeSort(arr, temp, mid+1, right);
        inv_count += merge(arr, temp, left, mid+1, right);
    }
    return inv_count;
}

int64_t  mergeSort(int arr[], int array_size){
    vector <int > temp(array_size);
    return _mergeSort(arr, temp.data(), 0, array_size - 1);
}


pair<int, int> find_xy(int id){
    int x, y;
    int ind=0;
    for (x=1; x<=14; x++)
        for (y=x+1;y<=14;y++){
            if (ind == id)
                return make_pair(x,y);
            ind++;
        }
    return make_pair(-1,-1);
}


int main() {

    int n = GetN();
    int nodes = NumberOfNodes();

    int  id = MyNodeId();


    if (n<1000000){
        //if (id !=0 ) return 0;

        vector <int > tab;
        for (int i=0; i<n;i++)
            tab.push_back(GetElement(i));

        int64_t wyn = mergeSort( tab.data(),tab.size() );
        if (id==0)cout<<wyn<<endl;
    }else
    {

        int x, y;

        tie(x, y) = find_xy(id);


      //  cout<<id<<" xy "<<x<<" "<<y<<endl;

        if (x==-1) return 0;

        int begA = ((x - 1) * n) / 14;
        int endA = ((x) * n) / 14;
        int begB = ((y - 1) * n) / 14;
        int endB = ((y) * n)  / 14;


        vector<int> tab;
        int sizeA;

        for (int i = begA; i < endA; i++)
            tab.push_back(GetElement(i));

        sizeA= tab.size();

        for (int i = begB; i < endB; i++)
            tab.push_back(GetElement(i));

        int sizeAB = tab.size();
        int sizeB = sizeAB - sizeA;

        uint64_t Acount = mergeSort(tab.data(), sizeA);
        uint64_t Bcount = mergeSort(tab.data() + sizeA, sizeB);
        uint64_t crosscount = mergeSort(tab.data(), sizeB + sizeA);

     //   cout<<x<<" "<<y<<"s "<<sizeA<<" "<<sizeB<<"    "<<Acount<<" "<<Bcount<<" "<<crosscount<<endl;

        PutInt(0,x);
        PutInt(0,y);
        PutLL(0, Acount );
        PutLL(0, Bcount );
        PutLL(0, crosscount );
        Send(0);



        if (id==0) {
            uint64_t accu= 0;
            for (int i=0; i<=90;i++) {
                Receive(i);
                int x, y;
                uint64_t Ac, Bc, Cc;
                x = GetInt(i);
                y = GetInt(i);
                Ac = GetLL(i);
                Bc = GetLL(i);
                Cc = GetLL(i);
              //  cout << x << " " << y << "    " << Ac << " " << Bc << " " << Cc << endl;
                accu += Cc;
                if ( x == 1) accu += Bc;
            }

            cout<<accu<<endl;

        }




//        cout<<id<<" xy "<<x<<" "<<y<<endl;





    }








}