Submission #197825

#	Time	Username	Problem	Language	Result	Execution time	Memory
197825		Ruxandra985	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	199 ms	13448 KiB

maxcomp

#include <cstdio>
#include <iostream>
using namespace std;
int n , m , a[1010][1010] , d[1010];
int solve (){
    int sol , i , j;
    sol = -2000000000;

    for (j=0;j<=m;j++)
        d[j] = 2000000000;

    for (i=1;i<=n;i++){
        for (j=1;j<=m;j++){

            d[j] = min( min(d[j-1] , d[j]) , a[i][j] - i - j );

            sol = max (sol , a[i][j] - d[j] - i - j - 1);

        }
    }
    return sol;

}
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int i , j , sol , st , dr;
    fscanf (fin,"%d%d",&n,&m);
    for (i=1;i<=n;i++){
        for (j=1;j<=m;j++){
            fscanf (fin,"%d",&a[i][j]);
        }
    }
    sol = solve();
    for (i=1;i<=n;i++){
        st = 1;
        dr = m;
        while (st < dr){
            swap(a[i][st] , a[i][dr]);
            st++;
            dr--;
        }
    }
    sol = max (sol , solve());


    for (i=1;i<=m;i++){
        st = 1;
        dr = n;
        while (st < dr){
            swap(a[st][i] , a[dr][i]);
            st++;
            dr--;
        }
    }
    sol = max (sol , solve());

    for (i=1;i<=n;i++){
        st = 1;
        dr = m;
        while (st < dr){
            swap(a[i][st] , a[i][dr]);
            st++;
            dr--;
        }
    }
    sol = max (sol , solve());

    fprintf (fout,"%d",sol);
    return 0;
}

Compilation message (stderr)

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:29:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d%d",&n,&m);
     ~~~~~~~^~~~~~~~~~~~~~~~~~
maxcomp.cpp:32:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             fscanf (fin,"%d",&a[i][j]);
             ~~~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40