Submission #9889273

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <random>
#include <chrono>

using namespace std;
const int N = 30;
int A[30][30];
int ans_size = 0;
int h_moves[4] = {-1, 1, 0, 0};
int w_moves[4] = {0, 0, -1, 1};
vector <pair<int, int> > ans;
chrono::system_clock::time_point start;
chrono::system_clock::time_point cur_time;
void input(){
  for(int i = 0; i < N; i++){
    for(int j = 0; j < N; j++){
      cin >> A[i][j];
    }
  }
}

void solve(){
  for(int i = 0; i < N; i++){
    for(int j = 0; j < N; j++){
      while(A[i][j] != 0){
        ans.push_back(make_pair(i + 1, j + 1));
        ans_size ++;
        A[i][j] --;
        int cur_i = i;
        int cur_j = j;
        while(true){
          bool changed = false;
          for(int k = 0; k < 4; k++){
            int next_i = cur_i + h_moves[k];
            int next_j = cur_j + w_moves[k];
            if(0 <= next_i && next_i < N && 0 <= next_j && next_j < N){
              if(A[cur_i][cur_j] == A[next_i][next_j] && A[next_i][next_j] != 0){
                ans.push_back(make_pair(next_i + 1, next_j + 1));
                ans_size ++;
                A[next_i][next_j] --;
                changed = true;
                cur_i = next_i;
                cur_j = next_j;
                break;
              }
            }
          }
          if(!changed){
            break;
          }
        }

      }
    }
  }
}

void output(){
  for(int i = 0; i < ans.size(); i++){
    cout << ans[i].first << " " << ans[i].second << endl;
  }
}

int main(void){
  start = chrono::system_clock::now();
  input();
  solve();
  output();
  return 0;
}

Submission Info

Judge Result