Submission #2119230

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int v[1000][1000];
ll sum[1000][1000]={};

int main(void) {
  int i,j;
  int h,w;
  cin>>h>>w;
  vector< pair<int,pii> > p(h*w);
  rep(i,h)rep(j,w){
    cin>>v[i][j];
    p[i*w+j].first=v[i][j];
    p[i*w+j].second.first=i;
    p[i*w+j].second.second=j;
  }
  sort(all(p));
  int dx[4]={0,1,0,-1};
  int dy[4]={1,0,-1,0};
  int n=h*w;
  rep(i,n){
    int x=p[n-1-i].second.first;
    int y=p[n-1-i].second.second;
    cout<<v[x][y]<<endl;
    sum[x][y]++;
    rep(j,4){
      int nx=x+dx[j];
      int ny=y+dy[j];
      if(nx<0 || nx>=h || ny<0 || ny>=w)continue;
      if(v[x][y]<v[nx][ny])sum[x][y]=(sum[x][y]+sum[nx][ny])%MOD;
    }
  }
  ll ans=0;
  rep(i,h)rep(j,w)ans=(ans+sum[i][j])%MOD;
  cout<<ans<<endl;
}

Submission Info

Judge Result