// #pragma GCC optimize("Ofast") #include <bits/stdc++.h> #define rep(i, p, k) for(int i(p); i < (k); ++i) #define per(i, p, k) for(int i(p); i > (k); --i) typedef long long int ll; typedef long double ld; template <typename T = int> inline T in() { T x; std::cin >> x; return x; } constexpr int maxl = 843, maxn = 15003, maxk = 10; bool sciana[maxl][2][maxn]; std::vector<std::vector<std::vector<int>>> doj[4]; int odl (bool z, int t, int a, int b, int lcm) { if(a == b)return t; bool bul(a < b); int k(maxk); if(bul) while(a < b) { while(k && doj[z][t % lcm][a][k] >= b)--k; a = doj[z][t % lcm][a][k]; t += 1 << k; } if(!bul) while(a > b) { while(k && doj[2 + z][t % lcm][a][k] <= b)--k; a = doj[2 + z][t % lcm][a][k]; t += 1 << k; } return t-1; } int main() { std::cin.tie(nullptr); std::cout.tie(nullptr); std::ios_base::sync_with_stdio(0); int n(in()), m(in()), q(in()); rep(r, 0, 840) { rep(i, 0, m)sciana[r][0][i] = 1; rep(i, 0, n)sciana[r][1][i] = 1; } int lcm(1); rep(i, 0, n)rep(j, 0, m) { std::string s(in<std::string>()); lcm = std::lcm(lcm, s.size()); int k(0); rep(r, 0, 840) { sciana[r][0][j] &= s[k] == '0'; sciana[r][1][i] &= s[k] == '1'; ++k; if(k == s.size())k = 0; } } rep(i, 0, 4)doj[i] = std::vector<std::vector<std::vector<int>>>(lcm, std::vector<std::vector<int>>((i & 1 ? n : m)+1, std::vector<int>{})); rep(r, 0, lcm){ int ls(-1); rep(i, 0, m+1)if(i == m || sciana[r][0][i]) { rep(j, ls, i)doj[0][r][j+1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(-1); rep(i, 0, n+1)if(i == n || sciana[r][1][i]) { rep(j, ls, i)doj[1][r][j+1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(m+1); per(i, m, -1)if(i == 0 || sciana[r][0][i-1]) { per(j, ls, i)doj[2][r][j-1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(n+1); per(i, n, -1)if(i == 0 || sciana[r][1][i-1]) { per(j, ls, i)doj[3][r][j-1].push_back(i); ls = i; }} rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, m+1) doj[0][r][i].push_back(doj[0][(r + (1 << k)) % lcm][doj[0][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, n+1) doj[1][r][i].push_back(doj[1][(r + (1 << k)) % lcm][doj[1][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, m+1) doj[2][r][i].push_back(doj[2][(r + (1 << k)) % lcm][doj[2][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, n+1) doj[3][r][i].push_back(doj[3][(r + (1 << k)) % lcm][doj[3][r][i][k]][k]); while(q--) { int t, a, b, c, d; std::cin >> t>> a >> b >> c>> d; std::cout << std::max(odl(0, t, b, d, lcm), odl(1, t, a, c, lcm))<<'\n'; } 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 | // #pragma GCC optimize("Ofast") #include <bits/stdc++.h> #define rep(i, p, k) for(int i(p); i < (k); ++i) #define per(i, p, k) for(int i(p); i > (k); --i) typedef long long int ll; typedef long double ld; template <typename T = int> inline T in() { T x; std::cin >> x; return x; } constexpr int maxl = 843, maxn = 15003, maxk = 10; bool sciana[maxl][2][maxn]; std::vector<std::vector<std::vector<int>>> doj[4]; int odl (bool z, int t, int a, int b, int lcm) { if(a == b)return t; bool bul(a < b); int k(maxk); if(bul) while(a < b) { while(k && doj[z][t % lcm][a][k] >= b)--k; a = doj[z][t % lcm][a][k]; t += 1 << k; } if(!bul) while(a > b) { while(k && doj[2 + z][t % lcm][a][k] <= b)--k; a = doj[2 + z][t % lcm][a][k]; t += 1 << k; } return t-1; } int main() { std::cin.tie(nullptr); std::cout.tie(nullptr); std::ios_base::sync_with_stdio(0); int n(in()), m(in()), q(in()); rep(r, 0, 840) { rep(i, 0, m)sciana[r][0][i] = 1; rep(i, 0, n)sciana[r][1][i] = 1; } int lcm(1); rep(i, 0, n)rep(j, 0, m) { std::string s(in<std::string>()); lcm = std::lcm(lcm, s.size()); int k(0); rep(r, 0, 840) { sciana[r][0][j] &= s[k] == '0'; sciana[r][1][i] &= s[k] == '1'; ++k; if(k == s.size())k = 0; } } rep(i, 0, 4)doj[i] = std::vector<std::vector<std::vector<int>>>(lcm, std::vector<std::vector<int>>((i & 1 ? n : m)+1, std::vector<int>{})); rep(r, 0, lcm){ int ls(-1); rep(i, 0, m+1)if(i == m || sciana[r][0][i]) { rep(j, ls, i)doj[0][r][j+1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(-1); rep(i, 0, n+1)if(i == n || sciana[r][1][i]) { rep(j, ls, i)doj[1][r][j+1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(m+1); per(i, m, -1)if(i == 0 || sciana[r][0][i-1]) { per(j, ls, i)doj[2][r][j-1].push_back(i); ls = i; }} rep(r, 0, lcm){ int ls(n+1); per(i, n, -1)if(i == 0 || sciana[r][1][i-1]) { per(j, ls, i)doj[3][r][j-1].push_back(i); ls = i; }} rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, m+1) doj[0][r][i].push_back(doj[0][(r + (1 << k)) % lcm][doj[0][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, n+1) doj[1][r][i].push_back(doj[1][(r + (1 << k)) % lcm][doj[1][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, m+1) doj[2][r][i].push_back(doj[2][(r + (1 << k)) % lcm][doj[2][r][i][k]][k]); rep(k, 0, maxk) rep(r, 0, lcm) rep(i, 0, n+1) doj[3][r][i].push_back(doj[3][(r + (1 << k)) % lcm][doj[3][r][i][k]][k]); while(q--) { int t, a, b, c, d; std::cin >> t>> a >> b >> c>> d; std::cout << std::max(odl(0, t, b, d, lcm), odl(1, t, a, c, lcm))<<'\n'; } return 0; } |