Submission #3926159


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

#define IMMACULATE -100000000000LL

vll solve(int H, int W, vvi& p, vvi& f) {
    vector<vll> pa(H, vll(W+1)), fa(H, vll(W+1));
    rep(i,H){
        pa[i][0] = fa[i][0] = 0;
        rep(j,W) {
            pa[i][j+1] = pa[i][j] + p[i][j];
            fa[i][j+1] = fa[i][j] + f[i][j];
        }
    }
    vector<vll> dp(H+1, vll(W, IMMACULATE));
    dp[0][0] = 0;

    for (int r=0; r<H; ++r) {
        vll diff(W); rep(i,W) diff[i] = p[r][i] -  f[r][i];
        vll left_round(W, 0);
        for (int i=1; i<W; ++i) {
            ll left_1 = diff[i-1] - f[r][i];
            amax(left_round[i], left_1);
            amax(left_round[i], left_1 + left_round[i-1]);
        }
        vll right_round(W, 0);
        for (int i=W-2; i>=0; --i) {
            ll right_1 = diff[i+1] - f[r][i];
            amax(right_round[i], right_1);
            amax(right_round[i], right_1 + right_round[i+1]);
        }
        vll left_visited(W, IMMACULATE);
        left_visited[0] = dp[r][0] + diff[0];
        for (int i=1; i<W; ++i) {
            amax(left_visited[i], left_visited[i-1] + diff[i]);
            amax(left_visited[i], dp[r][i] + diff[i] + left_round[i]);
        }
        rep(i,W) left_visited[i] += right_round[i];
        vll right_visited(W, IMMACULATE);
        if (dp[r][W-1] != IMMACULATE)
            right_visited[W-1] = dp[r][W-1] + diff[W-1];
        for (int i=W-2; i>=0; --i) {
            amax(right_visited[i], right_visited[i+1] + diff[i]);
            amax(right_visited[i], dp[r][i] + diff[i] + right_round[i]);
        }
        rep(i,W) right_visited[i] += left_round[i];
        rep(i,W) {
            dp[r+1][i] = max(left_visited[i], right_visited[i]);
        }
    }

    return dp[H];
}


int main() {
    int H, W; scanf("%d%d", &H, &W);
    read_cr();
    vvi p(H), f(H);
    rep(i,H) loadvec(p[i], W);
    rep(i,H) loadvec(f[i], W);
    vll ans = solve(H,W,p,f);
    rep(i,W) printf("%lld\n", ans[i]);
    return 0;
}

Submission Info

Submission Time
Task D - 建物
User naoya_t
Language C++14 (GCC 5.4.1)
Score 600
Code Size 5046 Byte
Status
Exec Time 57 ms
Memory 18584 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:95:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:151:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int H, W; scanf("%d%d", &H, &W);
                                    ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample0.txt, sample1.txt, sample2.txt
All 600 / 600 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, hand0.txt, hand1.txt, sample0.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
01-00.txt 57 ms 18568 KB
01-01.txt 57 ms 18568 KB
01-02.txt 57 ms 18568 KB
01-03.txt 57 ms 18584 KB
01-04.txt 57 ms 18568 KB
01-05.txt 54 ms 18584 KB
01-06.txt 54 ms 18568 KB
01-07.txt 54 ms 18568 KB
01-08.txt 55 ms 18568 KB
01-09.txt 55 ms 18568 KB
01-10.txt 55 ms 18568 KB
01-11.txt 54 ms 18568 KB
01-12.txt 55 ms 18584 KB
01-13.txt 47 ms 18396 KB
01-14.txt 48 ms 18440 KB
01-15.txt 53 ms 18584 KB
01-16.txt 52 ms 18568 KB
01-17.txt 51 ms 18584 KB
hand0.txt 1 ms 256 KB
hand1.txt 1 ms 256 KB
sample0.txt 1 ms 256 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB