#include "teatr.h" #include "message.h" #include "bits/stdc++.h" #include <iostream> #define ull long long int #define FOR(i,n) for(int i=0;i<(n);++i) #define FORI(i,start,n) for(int i=(start);i<(n);++i) #define FORit(it,collection) for(auto it = collection.cbegin(); it != collection.cend(); it++) using namespace std; #define DEBUG 0 #define dcout DEBUG && cout //int GetN() { return 100 * 1000 * 1000; } //int GetElement(int i) { return (100000000-i)/101+1;} #define LEVELS 21 #define SIZE (1<<20) class K{public: int**h; K(){ h=new int*[LEVELS]; int size=SIZE; *h=new int[2*SIZE+2000]; FOR(i,2*SIZE+2000)(*h)[i]=0; int allocated=0; int level=0; while(level<LEVELS){ h[level]=*h+allocated; allocated+=size; size=size/2; ++level; } } void recompute(){ int size=SIZE/2; int level=1; while(level<LEVELS){ FOR(i,size)h[level][i]=h[level-1][2*i]+h[level-1][2*i+1]; size=size/2; ++level; } } int moreThanAndInc(int n){ int s=0; FOR(i,LEVELS){ if(!(n&1)){ s+=h[i][n+1]; } ++h[i][n]; n/=2; } return s; } void inc(int n){ FOR(i,LEVELS){ ++h[i][n]; n/=2; } } int moreThan(int n){ int s=0; FOR(i,LEVELS){ if(!(n&1)){ s+=h[i][n+1]; } n/=2; } return s; } }; int main(){ int nodes = NumberOfNodes(); int node = MyNodeId(); ull s=0; int N=GetN(); if(N<1000000){ if(node==0){ K*k=new K(); FOR(i,N){ int d=GetElement(i); s+=k->moreThanAndInc(d); } cout<<s<<endl; } return 0; } int chunks=1; while((chunks*(chunks+1))/2<(nodes))++chunks; --chunks; if(!node)dcout<<"There will be "<<chunks<<" chunks"<<endl; int computingNodes = (chunks*(chunks+1))/2; int masterNode=computingNodes; if(node==masterNode){ FOR(i,computingNodes){ Receive(i); ull sp=GetLL(i); s+=sp; dcout<<"Received from "<<sp<<":+="<<s<<endl; } cout<<s<<endl; return 0; } if(node>computingNodes)return 0; int chunkSize = N/chunks + chunks*2; int chunkStarts[chunks]; FOR(i,chunks)chunkStarts[i]=i*chunkSize; int chunkEnds[chunks]; FOR(i,chunks)chunkEnds[i]=min(chunkStarts[i]+chunkSize, N); int myCachedChunk=-1; int myComputingChunk=-1; { int majorChunk=chunks; int minorChunk=chunks+1; FOR(i, computingNodes){ if(minorChunk > majorChunk){ --majorChunk; minorChunk=0; } if(node==i){ myCachedChunk=minorChunk; myComputingChunk=majorChunk; dcout<<"I am instance "<<node<<" of "<<computingNodes<<". I will cache chunk no "<<myCachedChunk<<"("<<chunkStarts[myCachedChunk]<<","<<chunkEnds[myCachedChunk]<<") and compute chunk "<<myComputingChunk<<"("<<chunkStarts[myComputingChunk]<<","<<chunkEnds[myComputingChunk]<<")"<<endl; } ++minorChunk; } } if(myCachedChunk==myComputingChunk){ //just compute current dcout<<"I am just computing my chunk: "<<myComputingChunk<<endl; K*k=new K(); FORI(i,chunkStarts[myComputingChunk], chunkEnds[myComputingChunk]){ int d=GetElement(i); s+=k->moreThanAndInc(d); } //dcout<<"sending just master: "<<s<<endl; PutLL(masterNode,s); Send(masterNode); return 0; } K*k=new K(); FORI(i,chunkStarts[myCachedChunk], chunkEnds[myCachedChunk]){ int d=GetElement(i); (k->h)[0][d]++; //k->inc(d); } k->recompute(); FORI(i,chunkStarts[myComputingChunk], chunkEnds[myComputingChunk]){ int d=GetElement(i); s+=k->moreThan(d); } //dcout<<"sending: "<<s<<endl; PutLL(masterNode,s); Send(masterNode); 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 | #include "teatr.h" #include "message.h" #include "bits/stdc++.h" #include <iostream> #define ull long long int #define FOR(i,n) for(int i=0;i<(n);++i) #define FORI(i,start,n) for(int i=(start);i<(n);++i) #define FORit(it,collection) for(auto it = collection.cbegin(); it != collection.cend(); it++) using namespace std; #define DEBUG 0 #define dcout DEBUG && cout //int GetN() { return 100 * 1000 * 1000; } //int GetElement(int i) { return (100000000-i)/101+1;} #define LEVELS 21 #define SIZE (1<<20) class K{public: int**h; K(){ h=new int*[LEVELS]; int size=SIZE; *h=new int[2*SIZE+2000]; FOR(i,2*SIZE+2000)(*h)[i]=0; int allocated=0; int level=0; while(level<LEVELS){ h[level]=*h+allocated; allocated+=size; size=size/2; ++level; } } void recompute(){ int size=SIZE/2; int level=1; while(level<LEVELS){ FOR(i,size)h[level][i]=h[level-1][2*i]+h[level-1][2*i+1]; size=size/2; ++level; } } int moreThanAndInc(int n){ int s=0; FOR(i,LEVELS){ if(!(n&1)){ s+=h[i][n+1]; } ++h[i][n]; n/=2; } return s; } void inc(int n){ FOR(i,LEVELS){ ++h[i][n]; n/=2; } } int moreThan(int n){ int s=0; FOR(i,LEVELS){ if(!(n&1)){ s+=h[i][n+1]; } n/=2; } return s; } }; int main(){ int nodes = NumberOfNodes(); int node = MyNodeId(); ull s=0; int N=GetN(); if(N<1000000){ if(node==0){ K*k=new K(); FOR(i,N){ int d=GetElement(i); s+=k->moreThanAndInc(d); } cout<<s<<endl; } return 0; } int chunks=1; while((chunks*(chunks+1))/2<(nodes))++chunks; --chunks; if(!node)dcout<<"There will be "<<chunks<<" chunks"<<endl; int computingNodes = (chunks*(chunks+1))/2; int masterNode=computingNodes; if(node==masterNode){ FOR(i,computingNodes){ Receive(i); ull sp=GetLL(i); s+=sp; dcout<<"Received from "<<sp<<":+="<<s<<endl; } cout<<s<<endl; return 0; } if(node>computingNodes)return 0; int chunkSize = N/chunks + chunks*2; int chunkStarts[chunks]; FOR(i,chunks)chunkStarts[i]=i*chunkSize; int chunkEnds[chunks]; FOR(i,chunks)chunkEnds[i]=min(chunkStarts[i]+chunkSize, N); int myCachedChunk=-1; int myComputingChunk=-1; { int majorChunk=chunks; int minorChunk=chunks+1; FOR(i, computingNodes){ if(minorChunk > majorChunk){ --majorChunk; minorChunk=0; } if(node==i){ myCachedChunk=minorChunk; myComputingChunk=majorChunk; dcout<<"I am instance "<<node<<" of "<<computingNodes<<". I will cache chunk no "<<myCachedChunk<<"("<<chunkStarts[myCachedChunk]<<","<<chunkEnds[myCachedChunk]<<") and compute chunk "<<myComputingChunk<<"("<<chunkStarts[myComputingChunk]<<","<<chunkEnds[myComputingChunk]<<")"<<endl; } ++minorChunk; } } if(myCachedChunk==myComputingChunk){ //just compute current dcout<<"I am just computing my chunk: "<<myComputingChunk<<endl; K*k=new K(); FORI(i,chunkStarts[myComputingChunk], chunkEnds[myComputingChunk]){ int d=GetElement(i); s+=k->moreThanAndInc(d); } //dcout<<"sending just master: "<<s<<endl; PutLL(masterNode,s); Send(masterNode); return 0; } K*k=new K(); FORI(i,chunkStarts[myCachedChunk], chunkEnds[myCachedChunk]){ int d=GetElement(i); (k->h)[0][d]++; //k->inc(d); } k->recompute(); FORI(i,chunkStarts[myComputingChunk], chunkEnds[myComputingChunk]){ int d=GetElement(i); s+=k->moreThan(d); } //dcout<<"sending: "<<s<<endl; PutLL(masterNode,s); Send(masterNode); return 0; } |