#include<bits/stdc++.h> #include "dzialka.h" #include "message.h" #define ALL(X) X.begin(),X.end() #define FOR(I,A,B) for(int (I) = (A); (I) <= (B); (I)++) #define FORW(I,A,B) for(int (I) = (A); (I) < (B); (I)++) #define FORD(I,A,B) for(int (I) = (A); (I) >= (B); (I)--) #define CLEAR(X) memset(X,0,sizeof(X)) #define SIZE(X) int(X.size()) #define CONTAINS(A,X) (A.find(X) != A.end()) #define PB push_back #define MP make_pair #define X first #define Y second using namespace std; template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U> &_p) { return os << "(" << _p.X << "," << _p.Y << ")"; } template<typename T> ostream& operator << (ostream &os, const vector<T>& _V) { bool f = true; os << "["; for(auto v: _V) { os << (f ? "" : ",") << v; f = false; } return os << "]"; } template<typename T> ostream& operator << (ostream &os, const set<T>& _S) { bool f = true; os << "("; for(auto s: _S) { os << (f ? "" : ",") << s; f = false; } return os << ")"; } template<typename T, typename U> ostream& operator << (ostream &os, const map<T, U>& _M) { return os << set<pair<T, U>>(ALL(_M)); } typedef signed long long slong; typedef long double ldouble; typedef pair<int,int> pii; const slong INF = 1000000100; const ldouble EPS = 1e-9; template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif typedef vector<int> vi; int PROC, ID, H, W; const int MASTER = 0; int get_int(int source) { Receive(source); return GetInt(source); } void send_int(int target, int x) { PutInt(target, x); Send(target); } slong get_slong(int source) { Receive(source); return GetLL(source); } void send_slong(int target, slong x) { PutLL(target, x); Send(target); } /// trzeba w kawalkach < 60kB bo cos nie dziala const int BATCH_SIZE = 6000; void send_vector(int target, const vi &v) { /// TODO: napisac vector<vi> batches; vi cur; for(int x : v) { cur.PB(x); if(SIZE(cur) == BATCH_SIZE) { batches.PB(cur); cur.clear(); } } if(SIZE(cur)) { batches.PB(cur); } send_int(target, SIZE(batches)); for(vi &w : batches) { PutInt(target, SIZE(w)); for(int x : w) { PutInt(target, x); } Send(target); } //debug(target, SIZE(batches), v); } vi get_vector(int source) { /// TODO: napisac vi ret; int batch_cnt = get_int(source); FOR(i,1,batch_cnt) { Receive(source); int cnt = GetInt(source); FOR(j,1,cnt) { ret.PB(GetInt(source)); } } //debug(source, batch_cnt, ret); return ret; } slong calc(vi &up, int r, int W) { stack<pii> S; S.push({-1,-1}); slong ret = 0; slong cur = 0; //debug(up, r, W); FORW(c,0,W) { while(up[c] <= S.top().Y) { pii p = S.top(); S.pop(); cur -= slong(p.X - S.top().X) * slong(p.Y - r); } pii p = {c, up[c]}; cur += slong(p.X - S.top().X) * slong(p.Y - r); S.push(p); //debug(r, c, cur); ret += cur; } //debug(r, ret); return ret; } const int MAXW = 77000; void slave(int st, int en) /// przedzial [st, en) rzedow { //debug(st,en); int seg = en - st; vector<bitset<MAXW> > F(seg); vi mini(W, H); FORW(r,0,seg) { FORW(c,0,W) { F[r][c] = IsUsableCell(st+r,c); if(!F[r][c]) { mini[c] = min(mini[c], st+r); } } } vi up(W,H); if(ID + 1 < PROC) { up = get_vector(ID + 1); //debug(up); FORW(c,0,W) { mini[c] = min(mini[c], up[c]); } } if(ID > 0) { send_vector(ID - 1, mini); } slong ans = 0; FORD(r,seg-1,0) { FORW(c,0,W) { if(!F[r][c]) { up[c] = st + r; } } ans += calc(up, st+r, W); } send_slong(MASTER, ans); } void master() { slong ans = 0; FORW(source,0,PROC) { ans += get_slong(source); } cout << ans << "\n"; } int main() { PROC = NumberOfNodes(); ID = MyNodeId(); H = GetFieldHeight(); W = GetFieldWidth(); slong hsegm = (H + PROC - 1) / PROC; // ile rzedow na proces slave(min(hsegm * ID, slong(H)), min(hsegm * (ID+1), slong(H))); if(ID == MASTER) master(); 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 | #include<bits/stdc++.h> #include "dzialka.h" #include "message.h" #define ALL(X) X.begin(),X.end() #define FOR(I,A,B) for(int (I) = (A); (I) <= (B); (I)++) #define FORW(I,A,B) for(int (I) = (A); (I) < (B); (I)++) #define FORD(I,A,B) for(int (I) = (A); (I) >= (B); (I)--) #define CLEAR(X) memset(X,0,sizeof(X)) #define SIZE(X) int(X.size()) #define CONTAINS(A,X) (A.find(X) != A.end()) #define PB push_back #define MP make_pair #define X first #define Y second using namespace std; template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U> &_p) { return os << "(" << _p.X << "," << _p.Y << ")"; } template<typename T> ostream& operator << (ostream &os, const vector<T>& _V) { bool f = true; os << "["; for(auto v: _V) { os << (f ? "" : ",") << v; f = false; } return os << "]"; } template<typename T> ostream& operator << (ostream &os, const set<T>& _S) { bool f = true; os << "("; for(auto s: _S) { os << (f ? "" : ",") << s; f = false; } return os << ")"; } template<typename T, typename U> ostream& operator << (ostream &os, const map<T, U>& _M) { return os << set<pair<T, U>>(ALL(_M)); } typedef signed long long slong; typedef long double ldouble; typedef pair<int,int> pii; const slong INF = 1000000100; const ldouble EPS = 1e-9; template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";} template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...); } #ifdef LOCAL #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (__VA_ARGS__) #define cerr if(0)cout #endif typedef vector<int> vi; int PROC, ID, H, W; const int MASTER = 0; int get_int(int source) { Receive(source); return GetInt(source); } void send_int(int target, int x) { PutInt(target, x); Send(target); } slong get_slong(int source) { Receive(source); return GetLL(source); } void send_slong(int target, slong x) { PutLL(target, x); Send(target); } /// trzeba w kawalkach < 60kB bo cos nie dziala const int BATCH_SIZE = 6000; void send_vector(int target, const vi &v) { /// TODO: napisac vector<vi> batches; vi cur; for(int x : v) { cur.PB(x); if(SIZE(cur) == BATCH_SIZE) { batches.PB(cur); cur.clear(); } } if(SIZE(cur)) { batches.PB(cur); } send_int(target, SIZE(batches)); for(vi &w : batches) { PutInt(target, SIZE(w)); for(int x : w) { PutInt(target, x); } Send(target); } //debug(target, SIZE(batches), v); } vi get_vector(int source) { /// TODO: napisac vi ret; int batch_cnt = get_int(source); FOR(i,1,batch_cnt) { Receive(source); int cnt = GetInt(source); FOR(j,1,cnt) { ret.PB(GetInt(source)); } } //debug(source, batch_cnt, ret); return ret; } slong calc(vi &up, int r, int W) { stack<pii> S; S.push({-1,-1}); slong ret = 0; slong cur = 0; //debug(up, r, W); FORW(c,0,W) { while(up[c] <= S.top().Y) { pii p = S.top(); S.pop(); cur -= slong(p.X - S.top().X) * slong(p.Y - r); } pii p = {c, up[c]}; cur += slong(p.X - S.top().X) * slong(p.Y - r); S.push(p); //debug(r, c, cur); ret += cur; } //debug(r, ret); return ret; } const int MAXW = 77000; void slave(int st, int en) /// przedzial [st, en) rzedow { //debug(st,en); int seg = en - st; vector<bitset<MAXW> > F(seg); vi mini(W, H); FORW(r,0,seg) { FORW(c,0,W) { F[r][c] = IsUsableCell(st+r,c); if(!F[r][c]) { mini[c] = min(mini[c], st+r); } } } vi up(W,H); if(ID + 1 < PROC) { up = get_vector(ID + 1); //debug(up); FORW(c,0,W) { mini[c] = min(mini[c], up[c]); } } if(ID > 0) { send_vector(ID - 1, mini); } slong ans = 0; FORD(r,seg-1,0) { FORW(c,0,W) { if(!F[r][c]) { up[c] = st + r; } } ans += calc(up, st+r, W); } send_slong(MASTER, ans); } void master() { slong ans = 0; FORW(source,0,PROC) { ans += get_slong(source); } cout << ans << "\n"; } int main() { PROC = NumberOfNodes(); ID = MyNodeId(); H = GetFieldHeight(); W = GetFieldWidth(); slong hsegm = (H + PROC - 1) / PROC; // ile rzedow na proces slave(min(hsegm * ID, slong(H)), min(hsegm * (ID+1), slong(H))); if(ID == MASTER) master(); return 0; } |