Language: C++

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#define FOR(i, n, m) for(ll i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-9;
 
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}
 
struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
 
#define MAX_N 3030303
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
 
using mi = modint;
 
mi mod_pow(mi a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}
 
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

ll tonum(vector<int> v, int l = 0, int r = 30) {
    ll ret = 0, tmp = 1;
    for(int i = l; i < r; i++) {
        ret += tmp * v[i];
        tmp *= 3;
    }
    return ret;
}




int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    ll tmp = 1;
    REP(i, 30) tmp *= 3;
    REP(i, q) {
        P x, y;
        cin >> x.first >> x.second >> y.first >> y.second;
        x.first--; x.second--;
        y.first--; y.second--;
        if(x.first > y.first) {
            x.first = tmp - 1 - x.first;
            y.first = tmp - 1 - y.first;
        }
        if(x.second > y.second) {
            x.second = tmp - 1 - x.second;
            y.second = tmp - 1 - y.second;
        }
        ll ans = (y.first - x.first) + (y.second - x.second);
        vector<int> x1(30), x2(30), y1(30), y2(30);
        REP(i, 30) {
            x1[i] = x.first % 3;
            x2[i] = y.first % 3;
            y1[i] = x.second % 3;
            y2[i] = y.second % 3;
            x.first /= 3; x.second /= 3;
            y.first /= 3; y.second /= 3;
        }
        int d1 = inf, d2 = inf;
        for(int i = 29; i >= 0; i--) {
            if(x1[i] == 1 && x2[i] == 1) {
                d1 = i;
                break;
            } else if(x1[i] == x2[i]) continue;
            else break;
        }
        for(int i = 29; i >= 0; i--) {
            if(y1[i] == 1 && y2[i] == 1) {
                d2 = i;
                break;
            } else if(y1[i] == y2[i]) continue;
            else break;
        }
        if(d1 < d2) {
            swap(x1[i], y1[i]);
            swap(x2[i], y2[i]);
        }
        for(int i = 29; i >= 0; i--) {
            if(y1[i] == 1 && y2[i] == 1) {
                ll num1 = tonum(x1, i + 1, 30);
                ll num2 = tonum(x2, i + 1, 30);
                bool ok = false;
                if(num2 - num1 >= 2) ok = true;
                else if(num2 - num1 == 1) {
                    if(x1[i] == 0 || x2[i] >= 1) ok = true;
                } else {
                    if(x1[i] == 0 && x2[i] >= 1) ok = true;
                }
                if(ok) {
                    vector<int> y3 = y1, y4 = y2;
                    y3[i] = 0;
                    y4[i] = 2;
                    for(int j = i - 1; j >= 0; j--) {
      #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#define FOR(i, n, m) for(ll i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-9;
 
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}
 
struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
 
#define MAX_N 3030303
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
 
using mi = modint;
 
mi mod_pow(mi a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}
 
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

ll tonum(vector<int> v, int l = 0, int r = 30) {
    ll ret = 0, tmp = 1;
    for(int i = l; i < r; i++) {
        ret += tmp * v[i];
        tmp *= 3;
    }
    return ret;
}




int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    ll tmp = 1;
    REP(i, 30) tmp *= 3;
    REP(i, q) {
        P x, y;
        cin >> x.first >> x.second >> y.first >> y.second;
        x.first--; x.second--;
        y.first--; y.second--;
        if(x.first > y.first) {
            x.first = tmp - 1 - x.first;
            y.first = tmp - 1 - y.first;
        }
        if(x.second > y.second) {
            x.second = tmp - 1 - x.second;
            y.second = tmp - 1 - y.second;
        }
        ll ans = (y.first - x.first) + (y.second - x.second);
        vector<int> x1(30), x2(30), y1(30), y2(30);
        REP(i, 30) {
            x1[i] = x.first % 3;
            x2[i] = y.first % 3;
            y1[i] = x.second % 3;
            y2[i] = y.second % 3;
            x.first /= 3; x.second /= 3;
            y.first /= 3; y.second /= 3;
        }
        int d1 = inf, d2 = inf;
        for(int i = 29; i >= 0; i--) {
            if(x1[i] == 1 && x2[i] == 1) {
                d1 = i;
                break;
            } else if(x1[i] == x2[i]) continue;
            else break;
        }
        for(int i = 29; i >= 0; i--) {
            if(y1[i] == 1 && y2[i] == 1) {
                d2 = i;
                break;
            } else if(y1[i] == y2[i]) continue;
            else break;
        }
        if(d1 < d2) {
            swap(x1[i], y1[i]);
            swap(x2[i], y2[i]);
        }
        for(int i = 29; i >= 0; i--) {
            if(y1[i] == 1 && y2[i] == 1) {
                ll num1 = tonum(x1, i + 1, 30);
                ll num2 = tonum(x2, i + 1, 30);
                bool ok = false;
                if(num2 - num1 >= 2) ok = true;
                else if(num2 - num1 == 1) {
                    if(x1[i] == 0 || x2[i] >= 1) ok = true;
                } else {
                    if(x1[i] == 0 && x2[i] >= 1) ok = true;
                }
                if(ok) {
                    vector<int> y3 = y1, y4 = y2;
                    y3[i] = 0;
                    y4[i] = 2;
                    for(int j = i - 1; j >= 0; j--) {
                        y3[j] = 2;
                        y4[j] = 0;
                    }
                    ans += min(abs(tonum(y1) - tonum(y3)), abs(tonum(y2) - tonum(y4)));
                }
                break;
            } else if(y1[i] == y2[i]) continue;
            else break;
        }
        cout << ans << endl;
    }
    return 0;
}
                  y3[j] = 2;
                        y4[j] = 0;
                    }
                    ans += min(abs(tonum(y1) - tonum(y3)), abs(tonum(y2) - tonum(y4)));
                }
                break;
            } else if(y1[i] == y2[i]) continue;
            else break;
        }
        cout << ans << endl;
    }
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:257:1: error: a template declaration cannot appear at block scope
  257 | template<typename T1, typename T2>
      | ^~~~~~~~
a.cc:288:17: error: cannot define friend function 'operator==' in a local class definition
  288 |     friend bool operator==(const modint& lhs, const modint& rhs) {
      |                 ^~~~~~~~
a.cc:288:17: error: 'bool main()::modint::operator==(const main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:291:17: error: cannot define friend function 'operator<' in a local class definition
  291 |     friend bool operator<(const modint& lhs, const modint& rhs) {
      |                 ^~~~~~~~
a.cc:291:17: error: 'bool main()::modint::operator<(const main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:294:17: error: cannot define friend function 'operator>' in a local class definition
  294 |     friend bool operator>(const modint& lhs, const modint& rhs) {
      |                 ^~~~~~~~
a.cc:294:17: error: 'bool main()::modint::operator>(const main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:297:20: error: cannot define friend function 'operator+=' in a local class definition
  297 |     friend modint &operator+=(modint& lhs, const modint& rhs) {
      |                    ^~~~~~~~
a.cc:297:20: error: 'main()::modint& main()::modint::operator+=(main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:302:20: error: cannot define friend function 'operator-=' in a local class definition
  302 |     friend modint &operator-=(modint& lhs, const modint& rhs) {
      |                    ^~~~~~~~
a.cc:302:20: error: 'main()::modint& main()::modint::operator-=(main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:307:20: error: cannot define friend function 'operator*=' in a local class definition
  307 |     friend modint &operator*=(modint& lhs, const modint& rhs) {
      |                    ^~~~~~~~
a.cc:307:20: error: 'main()::modint& main()::modint::operator*=(main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:311:20: error: cannot define friend function 'operator/=' in a local class definition
  311 |     friend modint &operator/=(modint& lhs, const modint& rhs) {
      |                    ^~~~~~~~
a.cc:311:20: error: 'main()::modint& main()::modint::operator/=(main()::modint&, const main()::modint&)' must have exactly one argument
a.cc:315:19: error: cannot define friend function 'operator+' in a local class definition
  315 |     friend modint operator+(const modint& lhs, const modint& rhs) {
      |                   ^~~~~~~~
a.cc:315:19: error: 'main()::modint main()::modint::operator+(const main()::modint&, const main()::modint&)' must have either zero or one argument
a.cc:318:19: error: cannot define friend function 'operator-' in a local class definition
  318 |     friend modint operator-(const modint& lhs, const modint& rhs) {
      |                   ^~~~~~~~
a.cc:318:19: error: 'main()::modint main()::modint::operator-(const main()::modint&, const main()::modint&)' must have either zero or one argument
a.cc:321:19: error: cannot define friend function 'operator*' in a local class definition
  321 |     friend modint operator*(const modint& lhs, const modint& rhs) {
      |                   ^~~~~~~~
a.cc:321:19: error: 'main()::modint main()::modint::operator*(const main()::modint&, const main()::modint&)' must have either zero or one argument
a.cc:324:19: error: cannot define friend function 'operator/' in a local class definition
  324 |     friend modint operator/(const modint& lhs, const modint& rhs) {
      |                   ^~~~~~~~
a.cc:324:19: error: 'main()::modint main()::modint::operator/(const main()::modint&, const main()::modint&)' must have exactly one argument
a.cc: In static member function 'static main()::modint main()::modint::pow(main()::modint, int)':
a.cc:278:27: error: no match for 'operator*=' (operand types are 'main()::modint' and 'main()::modint')
  278 |             if(m & 1) { r *= a; }
      |                         ~~^~~~
a.cc:279:20: error: no match for 'operator*' (operand types are 'main()::modint' and 'main()::modint')
  279 |             a = (a * a); m /= 2;
      |                  ~ ^ ~
      |                  |   |
      |                  |   main()::modint
      |                  main()::modint
a.cc: In member function 'main()::modint& main()::modint::operator++()':
a.cc:283:34: error: no match for 'operator+=' (operand types are 'main()::modint' and 'int')
  283 |     modint &operator++() { *this += 1; return *this; }
      |                            ~~~~~~^~~~
a.cc: In member function 'main()::modint& main()::modint::operator--()':
a.cc:284:34: error: no match for 'operator-=' (operand types are 'main()::modint' and 'int')
  284 |     modint &operator--() { *this -= 1; return *this; }
      |                            ~~~~~~^~~~
a.cc: In member function 'main()::modint main()::modint::operator++(int)':
a.cc:285:56: error: no match for 'operator+=' (operand types are 'main()::modint' and 'int')
  285 |     modint operator++(int) { modint ret = *this; *this += 1; return ret; }
      |                                                  ~~~~~~^~~~
a.cc: In member function 'main()::modint main()::modint::operator--(int)':
a.cc:286:56: error: no match for 'operator-=' (operand types are 'main()::modint' and 'int')
  286 |     modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
      |                                                  ~~~~~~^~~~
a.cc: In function 'int main()':
a.cc:328:44: error: a function-definition is not allowed here before '{' token
  328 | istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
      |                                            ^
a.cc:329:44: error: a function-definition is not allowed here before '{' token
  329 | ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
      |                                            ^
a.cc:332:72: error: a function-definition is not allowed here before '{' token
  332 | long long extgcd(long long a, long long b, long long& x, long long& y) {
      |                                                                        ^
a.cc:342:49: error: a function-definition is not allowed here before '{' token
  342 | long long mod_inverse(long long a, long long m) {
      |                                                 ^
a.cc:348:47: error: a function-definition is not allowed here before '{' token
  348 | long long mod_fact(long long n, long long& e) {
      |                                               ^
a.cc:364:46: error: a function-definition is not allowed here before '{' token
  364 | long long mod_comb(long long n, long long k) {
      |                                              ^
a.cc:374:24: error: a function-definition is not allowed here before '{' token
  374 | mi mod_pow(mi a, ll n) {
      |                        ^
a.cc:385:20: error: a function-definition is not allowed here before '{' token
  385 | ll gcd(ll a, ll b) {
      |                    ^
a.cc:390:48: error: a function-definition is not allowed here before '{' token
  390 | ll tonum(vector<int> v, int l = 0, int r = 30) {
      |                                                ^
a.cc:402:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
  402 | int main() {
      |         ^~
a.cc:402:9: note: remove parentheses to default-initialize a variable
  402 | int main() {
      |         ^~
      |         --
a.cc:402:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:402:12: error: a function-definition is not allowed here before '{' token
  402 | int main() {
      |            ^