#include <stdio.h> #include <bitset> #include <vector> #include <iostream> using namespace std; const int C=1025, D=9, T=840, H=15005, HH=1000001, LG=18, Q=1000005; int n, m; //Hyperparams int encode(int i, int j){ return m*i+j; } std::pair<int,int> decode(int v){ return {v/m, v%m}; } int get_bin(string s){ int i, ln=s.size(), res=0; for (i=0; i<ln; i++){ if (s[i]=='1') res+=(1<<i); } return res; } int breakdown[T], dp[T][H][LG]; void fill_dp(int k){ //k - either n or m int c, i, j, next_t; for (c=1; c<LG; c++){ for (i=0; i<T; i++){ for (j=0; j<=k; j++){ next_t = (i+(1<<(c-1)))%T; dp[i][j][c] = dp[next_t][dp[i][j][c-1]][c-1]; } } } } int lift_binaria(int x, int x2, int t0, bool direction){ //dir=0 - left/up, 1 - right/down int _tmp_k = LG-1, _tmp_res=0; while (_tmp_k >= 0){ if ((dp[t0][x][_tmp_k] <= x2 && (!direction)) || (dp[t0][x][_tmp_k] >= x2 && direction)) _tmp_k--; else { x = dp[t0][x][_tmp_k]; t0 = (t0 + (1<<_tmp_k))%T; _tmp_res = _tmp_res + (1<<_tmp_k); } } return _tmp_res; } bitset<T> bit_system[D][C]; bitset<T> communication_breakdown_vertical[H], communication_breakdown_horizontal[H]; std::pair<int,int> blyat_mask[HH]; bool finished[Q]; int res[Q], q_t[Q], q_x1[Q], q_x2[Q], q_y1[Q], q_y2[Q]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int i=0, j=0, pw, bit, place; for (i=2; i<D; i++){ pw = (1<<i); for (j=0; j<pw; j++){ for (bit = 0; bit <= i; bit++){ if ((j&(1<<bit)) == 0) continue; for (place = bit; place<T; place+=i) bit_system[i][j][place] = 1; } } } int value_bin; string _str; int q; cin >> n >> m >> q; for (i=0; i<n; i++){ for (j=0; j<m; j++){ cin >> _str; value_bin = get_bin(_str); blyat_mask[encode(i,j)] = {_str.size(), value_bin}; } } std::pair<int,int> _mask; //Pionowe serca for (j=0; j<m; j++) communication_breakdown_vertical[j] = 0; for (i=0; i<n; i++){ for (j=0; j<m; j++){ _mask = blyat_mask[encode(i,j)]; communication_breakdown_vertical[j] |= bit_system[_mask.first][_mask.second]; } } for (j=0; j<m; j++) communication_breakdown_vertical[j] = ~communication_breakdown_vertical[j]; //Tam, gdzie rosną poziomki for (i=0; i<n; i++) communication_breakdown_horizontal[i] = ~communication_breakdown_horizontal[i]; for (j=0; j<m; j++){ for (i=0; i<n; i++){ _mask = blyat_mask[encode(i,j)]; communication_breakdown_horizontal[i] &= bit_system[_mask.first][_mask.second]; } } for (i=0; i<T; i++) breakdown[i] = 2; for (i=0; i<T; i++){ for (j=0; j<m; j++){ if (communication_breakdown_vertical[j][i] == 1) breakdown[i] = 1; //vertical meltdown } for (j=0; j<n; j++){ if (communication_breakdown_horizontal[j][i] == 1) breakdown[i] = 0; //horizontal meltdown } } for (i=0; i<q; i++){ cin >> q_t[i] >> q_y1[i] >> q_x1[i] >> q_y2[i] >> q_x2[i]; if (breakdown[q_t[i]%T] == 2) { res[i] = 0; finished[i] = 1; } } //dp for leftmost-border for (i=0; i<T; i++){ dp[i][0][0] = 0; for (j=1; j<=m; j++){ dp[i][j][0] = dp[i][j-1][0]; if (communication_breakdown_vertical[j-1][i]) dp[i][j][0] = j; } } fill_dp(m); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 0 || q_x1[i] < q_x2[i]) continue; res[i] = lift_binaria(q_x1[i], q_x2[i], q_t[i]%T, 0); finished[i] = true; } //dp for rightmost-border for (i=0; i<T; i++){ dp[i][m][0] = m; for (j=m-1; j>=0; j--){ dp[i][j][0] = dp[i][j+1][0]; if (communication_breakdown_vertical[j][i]) dp[i][j][0] = j; } } fill_dp(m); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 0 || q_x1[i] > q_x2[i]) continue; res[i] = lift_binaria(q_x1[i], q_x2[i], q_t[i]%T, 1); finished[i] = true; } //dp for upper-border for (i=0; i<T; i++){ dp[i][0][0] = 0; for (j=1; j<=n; j++){ dp[i][j][0] = dp[i][j-1][0]; if (communication_breakdown_horizontal[j-1][i]) dp[i][j][0] = j; } } fill_dp(n); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 1 || q_y1[i] < q_y2[i]) continue; res[i] = lift_binaria(q_y1[i], q_y2[i], q_t[i]%T, 0); finished[i] = true; } //dp for lower-border for (i=0; i<T; i++){ dp[i][n][0] = n; for (j=n-1; j>=0; j--){ dp[i][j][0] = dp[i][j+1][0]; if (communication_breakdown_horizontal[j][i]) dp[i][j][0] = j; } } fill_dp(n); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 1 || q_y1[i] > q_y2[i]) continue; res[i] = lift_binaria(q_y1[i], q_y2[i], q_t[i]%T, 1); finished[i] = true; } for (i=0; i<q; i++){ printf ("%d\n", res[i] + q_t[i]); } 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 | #include <stdio.h> #include <bitset> #include <vector> #include <iostream> using namespace std; const int C=1025, D=9, T=840, H=15005, HH=1000001, LG=18, Q=1000005; int n, m; //Hyperparams int encode(int i, int j){ return m*i+j; } std::pair<int,int> decode(int v){ return {v/m, v%m}; } int get_bin(string s){ int i, ln=s.size(), res=0; for (i=0; i<ln; i++){ if (s[i]=='1') res+=(1<<i); } return res; } int breakdown[T], dp[T][H][LG]; void fill_dp(int k){ //k - either n or m int c, i, j, next_t; for (c=1; c<LG; c++){ for (i=0; i<T; i++){ for (j=0; j<=k; j++){ next_t = (i+(1<<(c-1)))%T; dp[i][j][c] = dp[next_t][dp[i][j][c-1]][c-1]; } } } } int lift_binaria(int x, int x2, int t0, bool direction){ //dir=0 - left/up, 1 - right/down int _tmp_k = LG-1, _tmp_res=0; while (_tmp_k >= 0){ if ((dp[t0][x][_tmp_k] <= x2 && (!direction)) || (dp[t0][x][_tmp_k] >= x2 && direction)) _tmp_k--; else { x = dp[t0][x][_tmp_k]; t0 = (t0 + (1<<_tmp_k))%T; _tmp_res = _tmp_res + (1<<_tmp_k); } } return _tmp_res; } bitset<T> bit_system[D][C]; bitset<T> communication_breakdown_vertical[H], communication_breakdown_horizontal[H]; std::pair<int,int> blyat_mask[HH]; bool finished[Q]; int res[Q], q_t[Q], q_x1[Q], q_x2[Q], q_y1[Q], q_y2[Q]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int i=0, j=0, pw, bit, place; for (i=2; i<D; i++){ pw = (1<<i); for (j=0; j<pw; j++){ for (bit = 0; bit <= i; bit++){ if ((j&(1<<bit)) == 0) continue; for (place = bit; place<T; place+=i) bit_system[i][j][place] = 1; } } } int value_bin; string _str; int q; cin >> n >> m >> q; for (i=0; i<n; i++){ for (j=0; j<m; j++){ cin >> _str; value_bin = get_bin(_str); blyat_mask[encode(i,j)] = {_str.size(), value_bin}; } } std::pair<int,int> _mask; //Pionowe serca for (j=0; j<m; j++) communication_breakdown_vertical[j] = 0; for (i=0; i<n; i++){ for (j=0; j<m; j++){ _mask = blyat_mask[encode(i,j)]; communication_breakdown_vertical[j] |= bit_system[_mask.first][_mask.second]; } } for (j=0; j<m; j++) communication_breakdown_vertical[j] = ~communication_breakdown_vertical[j]; //Tam, gdzie rosną poziomki for (i=0; i<n; i++) communication_breakdown_horizontal[i] = ~communication_breakdown_horizontal[i]; for (j=0; j<m; j++){ for (i=0; i<n; i++){ _mask = blyat_mask[encode(i,j)]; communication_breakdown_horizontal[i] &= bit_system[_mask.first][_mask.second]; } } for (i=0; i<T; i++) breakdown[i] = 2; for (i=0; i<T; i++){ for (j=0; j<m; j++){ if (communication_breakdown_vertical[j][i] == 1) breakdown[i] = 1; //vertical meltdown } for (j=0; j<n; j++){ if (communication_breakdown_horizontal[j][i] == 1) breakdown[i] = 0; //horizontal meltdown } } for (i=0; i<q; i++){ cin >> q_t[i] >> q_y1[i] >> q_x1[i] >> q_y2[i] >> q_x2[i]; if (breakdown[q_t[i]%T] == 2) { res[i] = 0; finished[i] = 1; } } //dp for leftmost-border for (i=0; i<T; i++){ dp[i][0][0] = 0; for (j=1; j<=m; j++){ dp[i][j][0] = dp[i][j-1][0]; if (communication_breakdown_vertical[j-1][i]) dp[i][j][0] = j; } } fill_dp(m); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 0 || q_x1[i] < q_x2[i]) continue; res[i] = lift_binaria(q_x1[i], q_x2[i], q_t[i]%T, 0); finished[i] = true; } //dp for rightmost-border for (i=0; i<T; i++){ dp[i][m][0] = m; for (j=m-1; j>=0; j--){ dp[i][j][0] = dp[i][j+1][0]; if (communication_breakdown_vertical[j][i]) dp[i][j][0] = j; } } fill_dp(m); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 0 || q_x1[i] > q_x2[i]) continue; res[i] = lift_binaria(q_x1[i], q_x2[i], q_t[i]%T, 1); finished[i] = true; } //dp for upper-border for (i=0; i<T; i++){ dp[i][0][0] = 0; for (j=1; j<=n; j++){ dp[i][j][0] = dp[i][j-1][0]; if (communication_breakdown_horizontal[j-1][i]) dp[i][j][0] = j; } } fill_dp(n); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 1 || q_y1[i] < q_y2[i]) continue; res[i] = lift_binaria(q_y1[i], q_y2[i], q_t[i]%T, 0); finished[i] = true; } //dp for lower-border for (i=0; i<T; i++){ dp[i][n][0] = n; for (j=n-1; j>=0; j--){ dp[i][j][0] = dp[i][j+1][0]; if (communication_breakdown_horizontal[j][i]) dp[i][j][0] = j; } } fill_dp(n); for (i=0; i<q; i++){ if (finished[i] || breakdown[q_t[i]%T] == 1 || q_y1[i] > q_y2[i]) continue; res[i] = lift_binaria(q_y1[i], q_y2[i], q_t[i]%T, 1); finished[i] = true; } for (i=0; i<q; i++){ printf ("%d\n", res[i] + q_t[i]); } return 0;} |