Simplified Sudoku

#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int t[n][n];
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> t[i][j];
      t[i][j]--;
    }
  }
  for (int i = 0; i < n; ++i) {
    vector<int> a(n), b(n);
    for (int j = 0; j < n; ++j) {
      #define FAIL {cout << "NO" << endl; return 0;}
      if (a[t[i][j]]) FAIL
      a[t[i][j]] = 1;
      if (b[t[j][i]]) FAIL
      b[t[j][i]] = 1;
      #undef FAIL
    }
  }
  cout << "YES" << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED