#include <bits/stdc++.h> #define DEBUG(x) cout << '>' << #x << ':' << x << endl; #define fi first #define se second #define ll long long #define ld long double #define pb push_back #define vi vector<int> #define MAXN 100001 using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(vector<bool> &sizes) { int r = 1; for (int i = 0; i < sizes.size(); i++) { if (!sizes[i]) continue; r = ((i * r) / (gcd(i, r))); } return r; } struct strip { int p, q; }; strip new_strip(int x, int y) { strip res; res.p = x; res.q = y; return res; } struct layer { bool horizontal = false; int id; vector<strip> strips; }; struct node { strip s; int l; bool horizontal; int d; node(strip s_, bool h, int d_, int l_) { s = s_; horizontal = h; d = d_; l = l_; } }; bool inside(bool h, int x, int y, int p, int q) { if (h) { return x >= p && x <= q; } else { return y >= p && y <= q; } return false; } bool cross(bool h1, int p1, int q1, bool h2, int p2, int q2) { if ((h1 && h2) || ((!h1) && (!h2))) { return (p1 <= p2 && q1 >= p2) || (p2 <= p1 && q2 >= p1); } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, q; cin >> n >> m >> q; vector<vector<string> > S(n); vector<bool> sizes(9, false); for (int i = 0; i < n; i++) { S[i].resize(m); for (int j = 0; j < m; j++) { cin >> S[i][j]; sizes[S[i][j].size()] = true; } } int layers = lcm(sizes); vector<layer> L(layers); vector<int> R(n, 0); vector<int> C(m, 0); for (int t = 0; t < layers; t++) { L[t].id = t; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (S[i][j][t % S[i][j].size()] == '1') { R[i]++; C[j]++; } } } int last_row = 0; for (int i = 0; i < n; i++) { if (R[i] == m) { L[t].horizontal = true; L[t].strips.pb(new_strip(last_row, i)); last_row = i + 1; } } if (L[t].horizontal == true) { L[t].strips.pb(new_strip(last_row, n)); } else { int last_col = 0; for (int i = 0; i < m; i++) { if (C[i] == 0) { L[t].strips.pb(new_strip(last_col, i)); last_col = i + 1; } } L[t].strips.pb(new_strip(last_col, m)); } fill(R.begin(), R.end(), 0); fill(C.begin(), C.end(), 0); } for (int i = 0; i < q; i++) { int t, t0, a, b, c, d; cin >> t >> a >> b >> c >> d; t0 = t % layers; layer &l = L[t0]; queue<node> Q; for (strip s : l.strips) { if (inside(l.horizontal, a, b, s.p, s.q)) { Q.push(node(s, l.horizontal, 0, t0)); // cout<<l.horizontal<<" "<<a<<" "<<b<<" "<<s.p<<" "<<s.q<<" HM\n"; break; } } ll r = 0; while (!Q.empty()) { node front = Q.front(); Q.pop(); if (inside(front.horizontal, c, d, front.s.p, front.s.q)) { r = front.d; // cout<<front.d<<" "<<front.s.p<<" "<<front.s.q<<" HM\n"; break; } layer &curl = L[front.l]; int nxtl_id = (front.l + 1) % layers; layer &nxtl = L[nxtl_id]; for (strip s : nxtl.strips) { if (cross(curl.horizontal, front.s.p, front.s.q, nxtl.horizontal, s.p, s.q)) { Q.push(node(s, nxtl.horizontal, front.d + 1, nxtl_id)); } } } cout << t + r << endl; } // for(layer l : L) { // cout<<l.id<<" "<<l.horizontal<<endl; // for(int i=0; i<l.strips.size(); i++) // cout<<"\t"<<l.strips[i].p<<" "<<l.strips[i].q<<endl; // } 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> #define DEBUG(x) cout << '>' << #x << ':' << x << endl; #define fi first #define se second #define ll long long #define ld long double #define pb push_back #define vi vector<int> #define MAXN 100001 using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(vector<bool> &sizes) { int r = 1; for (int i = 0; i < sizes.size(); i++) { if (!sizes[i]) continue; r = ((i * r) / (gcd(i, r))); } return r; } struct strip { int p, q; }; strip new_strip(int x, int y) { strip res; res.p = x; res.q = y; return res; } struct layer { bool horizontal = false; int id; vector<strip> strips; }; struct node { strip s; int l; bool horizontal; int d; node(strip s_, bool h, int d_, int l_) { s = s_; horizontal = h; d = d_; l = l_; } }; bool inside(bool h, int x, int y, int p, int q) { if (h) { return x >= p && x <= q; } else { return y >= p && y <= q; } return false; } bool cross(bool h1, int p1, int q1, bool h2, int p2, int q2) { if ((h1 && h2) || ((!h1) && (!h2))) { return (p1 <= p2 && q1 >= p2) || (p2 <= p1 && q2 >= p1); } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, q; cin >> n >> m >> q; vector<vector<string> > S(n); vector<bool> sizes(9, false); for (int i = 0; i < n; i++) { S[i].resize(m); for (int j = 0; j < m; j++) { cin >> S[i][j]; sizes[S[i][j].size()] = true; } } int layers = lcm(sizes); vector<layer> L(layers); vector<int> R(n, 0); vector<int> C(m, 0); for (int t = 0; t < layers; t++) { L[t].id = t; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (S[i][j][t % S[i][j].size()] == '1') { R[i]++; C[j]++; } } } int last_row = 0; for (int i = 0; i < n; i++) { if (R[i] == m) { L[t].horizontal = true; L[t].strips.pb(new_strip(last_row, i)); last_row = i + 1; } } if (L[t].horizontal == true) { L[t].strips.pb(new_strip(last_row, n)); } else { int last_col = 0; for (int i = 0; i < m; i++) { if (C[i] == 0) { L[t].strips.pb(new_strip(last_col, i)); last_col = i + 1; } } L[t].strips.pb(new_strip(last_col, m)); } fill(R.begin(), R.end(), 0); fill(C.begin(), C.end(), 0); } for (int i = 0; i < q; i++) { int t, t0, a, b, c, d; cin >> t >> a >> b >> c >> d; t0 = t % layers; layer &l = L[t0]; queue<node> Q; for (strip s : l.strips) { if (inside(l.horizontal, a, b, s.p, s.q)) { Q.push(node(s, l.horizontal, 0, t0)); // cout<<l.horizontal<<" "<<a<<" "<<b<<" "<<s.p<<" "<<s.q<<" HM\n"; break; } } ll r = 0; while (!Q.empty()) { node front = Q.front(); Q.pop(); if (inside(front.horizontal, c, d, front.s.p, front.s.q)) { r = front.d; // cout<<front.d<<" "<<front.s.p<<" "<<front.s.q<<" HM\n"; break; } layer &curl = L[front.l]; int nxtl_id = (front.l + 1) % layers; layer &nxtl = L[nxtl_id]; for (strip s : nxtl.strips) { if (cross(curl.horizontal, front.s.p, front.s.q, nxtl.horizontal, s.p, s.q)) { Q.push(node(s, nxtl.horizontal, front.d + 1, nxtl_id)); } } } cout << t + r << endl; } // for(layer l : L) { // cout<<l.id<<" "<<l.horizontal<<endl; // for(int i=0; i<l.strips.size(); i++) // cout<<"\t"<<l.strips[i].p<<" "<<l.strips[i].q<<endl; // } return 0; } |