#include <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <map> #include <cstdio> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cout<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cout<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define ALL(x) (x).begin(),(x).end() using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } #include "message.h" #include "teatr.h" using namespace std; int bit[1000008]; int maxval = 1000005; // BIT obsluguje przedzial [1..maxval-1] void czysc(int mxv) { maxval=mxv; FOR(i,mxv+1) bit[i]=0; } void dodaj(int ind, int war) { while(ind<maxval) { bit[ind]+=war; ind+=(ind & -ind); } } int suma(int ind)//[1..ind] { int sm=0; while(ind>0) { sm+=bit[ind]; ind-=(ind & -ind); } return sm; } vi v,v1,v2; int main() { int my_id = MyNodeId(); int all_nodes = 100; ll n = GetN(); vector<pii> intervals; int D=13; FOR(i,D) { int L = n*i/D; int R = n*(i+1)/D; intervals.pb(mp(L,R)); } vector<pii> jobs; FOR(i,D)FOR(j,D) if (i<=j) jobs.pb(mp(i,j)); if (my_id >= jobs.sz) return 0; int i1 = jobs[my_id].fi; int i2 = jobs[my_id].se; ll res_local = 0; if (i1==i2) { int L = intervals[i1].fi; int R = intervals[i2].se; REP(j,L,R-1) v.pb(GetElement(j)); int cnt=0; FOR(i,v.sz) { res_local += cnt - suma(v[i]); dodaj(v[i],1); cnt++; } } else { int L = intervals[i1].fi; int R = intervals[i1].se; REP(j,L,R-1) v1.pb(GetElement(j)); L = intervals[i2].fi; R = intervals[i2].se; REP(j,L,R-1) v2.pb(GetElement(j)); FOR(i,v1.sz) dodaj(v1[i],1); int cnt = v1.sz; FOR(i,v2.sz) res_local += cnt - suma(v2[i]); } PutLL(0, res_local); Send(0); ll res_global=0; if (my_id==0) { FOR(i,jobs.sz) { Receive(i); res_global += GetLL(i); } cout<<res_global<<"\n"; } }
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 | #include <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <map> #include <cstdio> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cout<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cout<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define ALL(x) (x).begin(),(x).end() using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } #include "message.h" #include "teatr.h" using namespace std; int bit[1000008]; int maxval = 1000005; // BIT obsluguje przedzial [1..maxval-1] void czysc(int mxv) { maxval=mxv; FOR(i,mxv+1) bit[i]=0; } void dodaj(int ind, int war) { while(ind<maxval) { bit[ind]+=war; ind+=(ind & -ind); } } int suma(int ind)//[1..ind] { int sm=0; while(ind>0) { sm+=bit[ind]; ind-=(ind & -ind); } return sm; } vi v,v1,v2; int main() { int my_id = MyNodeId(); int all_nodes = 100; ll n = GetN(); vector<pii> intervals; int D=13; FOR(i,D) { int L = n*i/D; int R = n*(i+1)/D; intervals.pb(mp(L,R)); } vector<pii> jobs; FOR(i,D)FOR(j,D) if (i<=j) jobs.pb(mp(i,j)); if (my_id >= jobs.sz) return 0; int i1 = jobs[my_id].fi; int i2 = jobs[my_id].se; ll res_local = 0; if (i1==i2) { int L = intervals[i1].fi; int R = intervals[i2].se; REP(j,L,R-1) v.pb(GetElement(j)); int cnt=0; FOR(i,v.sz) { res_local += cnt - suma(v[i]); dodaj(v[i],1); cnt++; } } else { int L = intervals[i1].fi; int R = intervals[i1].se; REP(j,L,R-1) v1.pb(GetElement(j)); L = intervals[i2].fi; R = intervals[i2].se; REP(j,L,R-1) v2.pb(GetElement(j)); FOR(i,v1.sz) dodaj(v1[i],1); int cnt = v1.sz; FOR(i,v2.sz) res_local += cnt - suma(v2[i]); } PutLL(0, res_local); Send(0); ll res_global=0; if (my_id==0) { FOR(i,jobs.sz) { Receive(i); res_global += GetLL(i); } cout<<res_global<<"\n"; } } |