Submission #1674606

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;
int n, m;
//p > q?
bool cmp(vector<int> p, vector<int> q){
    rep(i, 0, m){
        if(p[i] > q[i]) return true;
        if(p[i] < q[i]) return false;
        if(i == m - 1 && p[i] == q[i]) return false;
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    vector<vector<int> > a(n, vector<int> (m, 0));
    rep(i, 0, n){
        rep(j, 0, m){
            cin >> a[i][j];
        }
    }
    int ans = 0;
    rep(i, 1, n){
        while(1){
            bool f = true;
            f = cmp(a[i], a[i - 1]);
            if(f) break;
            ans++;
            rep(j, 1, m){
                a[i][j] += a[i][j - 1];
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result