noya2_Library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub noya2ruler/noya2_Library

:heavy_check_mark: test/data_structure/aoj1068_segtree2d.test.cpp

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1068"

#include"../../template/template.hpp"
#include"../../data_structure/segment_tree_2d.hpp"

int op(int a, int b){
    return min(a,b);
}
int e(){
    return numeric_limits<int>::max();
}

void solve(int h, int w, int q){
    vector<vector<int>> a(h,vector<int>(w)); in(a);
    segtree_2d<int,op,e> seg(a);
    while (q--){
        int lx, rx, ly, ry; in(lx,ly,rx,ry); rx++, ry++;
        out(seg.prod(lx,rx,ly,ry));
    }
}

int main(){
    while(true){
        int h, w, q; in(h,w,q);
        if (h == 0) break;
        solve(h,w,q);
    }
}
#line 1 "test/data_structure/aoj1068_segtree2d.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1068"

#line 2 "template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "template/utils.hpp"

#line 6 "template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "data_structure/segment_tree_2d.hpp"

#line 4 "data_structure/segment_tree_2d.hpp"

namespace noya2{

template<class S, S(*op)(S, S), S(*e)()>
struct segtree_2d {
    int h, w;
    segtree_2d (int h_ = 1, int w_ = 0) : segtree_2d(std::vector<std::vector<S>>(h_,vector<S>(w_,e()))) {}
    segtree_2d (const std::vector<std::vector<S>> &vec){
        assert(!vec.empty());
        //h = bit_ceil(vec.size()), w = bit_ceil(vec[0].size());
        h = 1; while (h < (int)(vec.size())) h <<= 1; w = 1; while (w < (int)(vec[0].size())) w <<= 1;
        d.assign(h*w*4,e());
        for (int i = 0; i < (int)(vec.size()); i++) for (int j = 0; j < (int)(vec[i].size()); j++) d[id(i+h,j+w)] = vec[i][j];
        build();
    }
    void build(){
        for (int i = 0; i < h; i++) for (int j = w-1; j > 0; j--) update_y(i+h,j);
        for (int i = h-1; i > 0; i--) for (int j = 1; j < 2*w; j++) update_x(i,j);
    }
    void assign(int p, int q, S v){
        d[id(p+h,q+w)] = v;
    }
    void set(int p, int q, S v){
        p += h, q += w;
        d[id(p,q)] = v;
        for (int j = q>>1; j > 0; j >>= 1) update_y(p,j);
        for ( ; q > 0; q >>= 1) for (int i = p>>1; i > 0; i >>= 1) update_x(i,q);
    }
    S prod(int lp, int rp, int lq, int rq){
        if (lp >= rp || lq >= rq) return e();
        S res = e();
        lp += h, rp += h, lq += w, rq += w;
        for ( ; lp < rp; lp >>= 1, rp >>= 1){
            if (lp & 1) res = op(res,inner_prod(lp++,lq,rq));
            if (rp & 1) res = op(res,inner_prod(--rp,lq,rq));
        }
        return res;
    }
    S get(int p, int q){
        p += h, q += w;
        return d[id(p,q)];
    }
    int id(int p, int q){ return p * 2 * w + q; }
    void update_x(int p, int q){ d[id(p,q)] = op(d[id(2*p,q)],d[id(2*p+1,q)]); }
    void update_y(int p, int q){ d[id(p,q)] = op(d[id(p,2*q)],d[id(p,2*q+1)]); }
    S inner_prod(int p, int lq, int rq){
        S res = e();
        for ( ; lq < rq; lq >>= 1, rq >>= 1){
            if (lq & 1) res = op(res,d[id(p,lq++)]);
            if (rq & 1) res = op(res,d[id(p,--rq)]);
        }
        return res;
    }
    std::vector<S> d;
};

} // namespace noya2
#line 5 "test/data_structure/aoj1068_segtree2d.test.cpp"

int op(int a, int b){
    return min(a,b);
}
int e(){
    return numeric_limits<int>::max();
}

void solve(int h, int w, int q){
    vector<vector<int>> a(h,vector<int>(w)); in(a);
    segtree_2d<int,op,e> seg(a);
    while (q--){
        int lx, rx, ly, ry; in(lx,ly,rx,ry); rx++, ry++;
        out(seg.prod(lx,rx,ly,ry));
    }
}

int main(){
    while(true){
        int h, w, q; in(h,w,q);
        if (h == 0) break;
        solve(h,w,q);
    }
}
Back to top page