Submission #8241973

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
  ll a[30][30],max_a,vx[]={1,0,-1,0},vy[]={0,1,0,-1};
  ll x,y,nx,ny,n=30,next_a,gx,gy;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      cin >> a[i][j];
    }
  }
  while(true){
    max_a = 0;
    for(int i=0;i<n;i++){
      for(int j=0;j<n;j++){
        if(max_a < a[i][j]){
          x = i;
          y = j;
          max_a = a[i][j];
        }
      }
    }
    if(max_a==0){
      break;
    }
    cout << x+1<<" "<<y+1<<endl;
    a[x][y]--;
    while(true){
      next_a = 0;
      for(int i=0;i<4;i++){
        nx = x+vx[i];
        ny = y+vy[i];
        if(nx>=0&&ny>=0&&nx<n&&ny<n&&next_a<a[nx][ny]){
          next_a = a[nx][ny];
          gx = nx;
          gy = ny;
        }
      }
      if(next_a==0||next_a<a[x][y]){
        break;
      }else{
        cout << gx+1 <<" "<<gy+1 <<endl;
        a[gx][gy]--;
        x = gx;
        y = gy;
      }
    }
  }
}

Submission Info

Judge Result