Cod sursa(job #2906317)

Utilizator Albert_GAlbert G Albert_G Data 25 mai 2022 17:00:52
Problema Plantatie Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.23 kb
#include <fstream>

std::ifstream in("plantatie.in");
std::ofstream out("plantatie.out");

constexpr int N = 501;
int rez[18][N][N], log[N];

void precalculare(int n){
    int lim = log[n] + 1;
    for(int power=1; power <= lim; ++power){
        for(int i = (1 << power) - 1; i<=n; ++i){
            for(int j = i; j<=n; ++j){
                int p = 1 << (power-1);
                rez[power][i][j] = std::max(rez[power-1][i - p][j - p], 
                    std::max(rez[power-1][i - p][j], 
                        std::max(rez[power-1][i][j - p], rez[power-1][i][j])));
            }
        }
    }
}

void calc_log(int n){
    log[1] = 0;
    for(int i=2; i<=n; ++i)
        log[i] = 1 + log[i/2];
}

int main(){
    int n, m;
    in >> n >> m;
    calc_log(n);
    for(int i=0; i<n; ++i) for(int j=0; j<n; ++j){
        int x;
        in >> x;
        rez[0][i][j] = x;
    }
    precalculare(n);
    for(int i=0; i<m; ++i){
        int y, x, lat;
        in >> y >> x >> lat;
        int power = log[lat], p = (1 << power);
        out << std::max(rez[power][y - lat + p][x - lat + p],
                    std::max(rez[power][y - lat + p][x],
                        std::max(rez[power][y][x - lat + p], rez[power][y][x]))
        ) << '\n';
    }
}