Submission #2979162

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
#define N 30
int s[35][35],m,dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
int main(void){
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            cin>>s[i][j];
        }
    }
    while(1){
        m=0;
        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                m=max(m,s[i][j]);
            }
        }
        if(m==0)break;
        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                if(s[i][j]==m){
                    int x=j,y=i;
                    bool o=true;
                    cout<<y+1<<' '<<x+1<<endl;
                    while(o&&s[y][x]){
                        s[y][x]--;
                        o=false;
                        for(int k=0;k<4;k++){
                            int a=x+dx[k],b=y+dy[k];
                            if(0<=a&&a<N&&0<=b&&b<N&&s[b][a]==s[y][x]){
                                y=b;
                                x=a;
                                o=true;
                                break;
                            }
                        }
                    }
                }
            }
        }
    }
}

Submission Info

Judge Result