Submission #1756392

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define p pair<int,int>
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
using namespace std;
#define m 30
vector<vector<int>> a(m+2);
int x,y;
int nall0(void){
	FOR(i,1,m+1) FOR(j,1,m+1) if(a[i][j]!=0){
		x=i;y=j;
		return 1;
	}
	return 0;
}

int main(){
	
	rep(i,m+2){
		a[i].resize(m+2);
		rep(j,m+2){
			if(i*j==0 || i==m+1 || j==m+1) a[i][j]=0;
			else cin>>a[i][j];
		}
	}
	bool re=1;
	int ans=0;
	while(nall0()){
		re=1;
		while(re){
			re=0;
			a[x][y]--;
			printf("%d %d\n",x,y);
			rep(i,4){
				if(a[x+dx[i]][y+dy[i]]==a[x][y] && a[x+dx[i]][y+dy[i]]!=0){
					x=x+dx[i],y=y+dy[i];
					re=1;
					break;
				}
			}
		}
		ans++;
	}
	//cout<<ans<<endl;


	return 0;
}

Submission Info

Judge Result