Cod sursa(job #2369263)

Utilizator PopeangaMihneaPopeanga Mihnea- Stefan PopeangaMihnea Data 5 martie 2019 22:01:45
Problema Ciclu hamiltonian de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("tablou.in");
ofstream fout("tablou.out");

int n, m, k, sumtotal;
int s[3001][3001];
long long sum[100001];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=m; ++j)
        {
            char ch;
            fin>>ch;
            //fout<<ch;
            s[i][j]=s[i][j-1]-s[i-1][j-1]+s[i-1][j]+ch-'0';
        }
        //fout<<"\n";
    }
    fin>>k;
    for(int i=1; i<=k; ++i)
    {
        int la, ca, lb, cb, val;
        fin>>la>>ca>>lb>>cb>>val;
        sum[i]=s[n][m]-(s[lb][cb]-s[lb][ca-1]-s[la-1][cb]+s[la-1][ca-1])+val*((lb-la+1)*(cb-ca+1));
        sumtotal=sumtotal+sum[i];
    }
    for(int i=1; i<=k; ++i)
    {
        long long sol=1LL*n*m*(k*sum[i]-sumtotal);
        fout<<sol<<"\n";
    }
    //fout<<(float)(sizeof(s)+sizeof(sum))/1024;
    return 0;
}