Hypyt

#include <bits/stdc++.h>
using namespace std;
typedef vector<bitset<55>> VK;
typedef vector<bitset<222>> VS;
typedef vector<pair<int, int>> VA;

bool hau(int x, int y, int n, int m, VS &siirtyma, VK &kautu, VA &A) {
  bool ok = true;
  vector<pair<int, int>> W;
  int mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (kautu[i][j])
        continue;
      ok = false;
      if (siirtyma[i - x + 50][j - y + 50])
        continue;
      int lk = max(abs(i - x), abs(j - y));
      if (lk > mx) {
        W.clear();
        mx = lk;
      }
      if (lk == mx)
        W.push_back({i, j});
    }
  }
  for (auto &u : W) {
    int i = u.first;
    int j = u.second;
    siirtyma[i - x + 50][j - y + 50] = 1;
    kautu[i][j] = 1;
    if (hau(i, j, n, m, siirtyma, kautu, A)) {
      A.push_back({i - x, j - y});
      return true;
    }
    kautu[i][j] = 0;
    siirtyma[i - x + 50][j - y + 50] = 0;
  }
  if (ok) {
    return true;
  }
  return false;
}

void solve(int n, int m) {
  VS siirtyma(222);
  VK kautu(55);
  VA a;
  kautu[0][0] = 1;
  if(!hau(0, 0, n, m, siirtyma, kautu, a)) {
    cout << "QAQ" << endl;
    exit(1);
  }
  reverse(a.begin(), a.end());
  for (auto u : a)
    cout << u.first << " " << u.second << "\n";
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    solve(n, m);
  }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED