Submission #1046918

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;

int main(){
    int N,M;
    cin>>N>>M;
    int64_t A[1000][1000]={};
    for(int i=0;i<N;i++){
        for(int j=0;j<M;j++){
            cin>>A[i][j];
        }
    }
    int res=0;
    for(int i=1;i<N;i++){
        int z=1;
        bool flag=true;
        for(int j=0;j<M;j++){
            if(A[i][j] < A[i-1][j]){
                z=j;
                flag=false;
                break;
            }else if(A[i][j] > A[i-1][j]){
                z=1;
                break;
            }
        }
        if(z==0){
            cout<<-1<<endl;
            return 0;
        }
        if(!flag){
            for(int j=1;j<M;j++){
                A[i][j]=A[i][j]+A[i][j-1];
            }
            i--;
            res++;
        }/*
        for(int j=0;j<M;j++){
            cout<<A[i][j]<<' ';
        }cout<<endl;*/
    }
    
    cout<<res<<endl;
    
    
    
    
    return 0;
}

Submission Info

Judge Result