Cod sursa(job #2776711)

Utilizator zelionii97Zelionii Vasile zelionii97 Data 20 septembrie 2021 19:29:15
Problema Jocul Flip Scor 20
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.82 kb
#include <fstream>

using namespace std;

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

#define debounce 20

int n, m, i, j, a[16][16], v[16], w[16], suma, s = 0, k = 0;
bool orizontal = true, vertical = true;

int main()
{
    fin >> n >> m;

    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            fin >> a[i][j];
        }
    }

    while((orizontal == true) || (vertical == true)){
        for(i = 1; i <= max(n,m) + 1; i++){
            v[i] = 0;
            w[i] = 0;
        }

        for(i = 1; i <= n; i++){
            for(j = 1; j <= m; j++){
                v[i] = v[i] + a[i][j];
            }
        }
        orizontal = false;

        for(i = 1; i <= n; i++){
            if(v[i] < 0){
                for(j = 1; j <= m; j++){
                    a[i][j] = (-1) * a[i][j];
                }
                orizontal = true;
            } else {
                // nothing
            }
        }

        for(i = 1; i <= n; i++){
            for(j = 1; j <= m; j++){
                w[j] = w[j] + a[i][j];
            }
        }
        vertical = false;

        for(j = 1; j <= m; j++){
            if(w[j] < 0){
                for(i = 1; i <= n; i++){
                    a[i][j] = (-1) * a[i][j];
                }
                vertical = true;
            } else {
                // nothing
            }
        }

        for(i = 1; i <= n; i++){
            for(j = 1; j <= m; j++){
                suma = suma + a[i][j];

            }
        }

        s = max(suma,s);
        if (((suma == s) && (k >= debounce)) || ((orizontal == false) && (vertical == false))){
            orizontal = false;
            vertical = false;
            fout << suma;
        }
        k++;
        suma = 0;
    }

    return 0;
}