Spiraali

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main() {
  ll n, t, x, y;
  cin >> n >> t;
  ll e = 4*n-6;
  for (int i = 0; i < t; i++) {
    ll v;
    cin >> x >> y;
    if (x < y) {
      if (x <= n-y) {
        ll dist = n - x;
        ll diag = dist*(e+(dist-1)*(-8)+e)/2+n;
        v = diag + n-x+1-y;
      }
      else {
        ll dist = y -1;
        ll diag = dist*(e+(dist-1)*(-8)+e)/2+n;
        v = diag - (x - (n-y+1));
      }
    }
    else {
      if (x <= n-y) {
        ll dist = y - 1;
        ll diag = dist*(e+(dist-1)*(-8)+e)/2+n;
        v = diag - (n-y+1-x);
      }
      else {
        ll dist = n -x;
        ll diag = dist*(e+(dist-1)*(-8)+e)/2+n;
        v = diag + y-(n-x+1);
      }
    }
    cout << v << endl;
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED