Language: C++

#include <bits/stdc++.h>  // clang-format off
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(s,t)     rep(i,sz(s)){in(s[i] , t[i]);}
#define in3(s,t,u)   rep(i,sz(s)){in(s[i] , t[i] , u[i]);}
#define in4(s,t,u,v) rep(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}
#ifdef ONLINE_JUDGE
  #define rep(i,N) for(int i = 0; i < (int)(N); i++)
  #define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)
  #define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)
  #define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)
#else
  #define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
  #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
  #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
  #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#endif
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}

#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);} while(0)
  #define trcc(v) do { cerr << "name : " << #v << "\n"; int cnt = 0; each(x , v){cerr << (cnt++) << " : "; trc(x); } } while(0)
#else
  #define trc(...)
  #define trca(...)
  #define trcc(...)
  int main(){solve();}
#endif

constexpr ll TEN(int n){ll ret=1,x=10;while(n){if(n&1)ret*=x;x*=x;n>>=1;}return ret;}
#define mem(a, val) memset(a, val, sizeof(a))

struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
using P = pair<int,int>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;

// clang-format on
/////////////

vl beki(32);

template <typename T>
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
using UnweightedGraph = vector<vector<int> >;

// Input of (Unweighted) Graph
UnweightedGraph graph(int N, int M = -1, bool is_directed = false,
                      bool is_1origin = true) {
  UnweightedGraph g(N);
  if (M == -1) M = N - 1;
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    if (is_1origin) x--, y--;
    g[x].pb(y);
    if (!is_directed) g[y].pb(x);
  }
  return g;
}

// Input of Weighted Graph
template <typename T>
WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,
                        bool is_1origin = true) {
  WeightedGraph<T> g(N);
  if (M == -1) M = N - 1;
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    T c;
    cin >> c;
    if (is_1origin) x--, y--;
    g[x].eb(x, y, c);
    if (!is_directed) g[y].eb(y, x, c);
  }
  return g;
}

// Depth of Rooted Tree
// unvisited nodes : d = -1
vector<int> Depth(UnweightedGraph &g, int start = 0) {
  vector<int> d(g.size(), -1);
  auto dfs = [&](auto rec, int cur, int par = -1) -> void {
    d[cur] = par == -1 ? 0 : d[par] + 1;
    each(dst, g[cur]) {
      if (dst == par) continue;
      rec(rec, dst, cur);
    }
  };
  dfs(dfs, start);
  return d;
}

// Diameter of Tree
pair<int, int> Diameter(UnweightedGraph &g, int start = 0) {
  auto d = Depth(g, start);
  int u = max_element(begin(d), end(d)) - begin(d);
  d = Depth(g, u);
  int v = max_element(begin(d), end(d)) - begin(d);
  return make_pair(u, v);
}

// dijkstra 到達不可能な場合はINFを返す
template<typename T>
vector<T> dijkstra(WeightedGraph<T> &g, int start = 0){ 
  using P = pair<T , int>;
  int N = (int)g.size();
  T INF = numeric_limits<T>::max() / 2;
  vector<T> d(N , INF);
  priority_queue<P , vector<P> , greater<P> > Q;
  d[start] = 0;
  Q.emplace(0 , start);
  while(!Q.empty()){
    P p = Q.top(); Q.pop();
    int cur = p.second;
    if(d[cur] < p.first) continue;
    for(auto dst : g[cur]){
      if( d[cur] + dst.cost < d[dst]){
        d[dst] = d[cur] + dst.cost;
        Q.emplace(d[dst] , dst);
      }
    }
  }
  return d;
}

ll q(){
  inl(a,b,c,d);
  a--,b--,c--,d--;
  //
  trc(a,b,c,d);
  ll x[2][2] = {}, y[2][2] = {};

  vl s , t , u , v;
  auto func=[](ll a,vl &s){
    // 下から
    rep(i , 32){
      s.push_back(a % 3);
      a /= 3;
    }
  };
  func(a , s);
  func(b , t);
  func(c , u);
  func(d , v);
  //trc(s,t,u,v);

  // lastはどこ？
  int last = 31;
  while(s[last] == u[last] && t[last] == v[last]) last--;
  //trc(last);
if(s[last]+u[last]!=2||t[last]+v[last]!=2){
out(abs(a-c)+abs(b-d));
return;
}


  rep(i , last){
    // 四隅への距離は？
    rep(j,2)rep(k,2){
      x[j][k] += 
        ( (j ? 2 - s[i] : s[i]) + (k ? 2 - t[i] : t[i]) ) * beki[i];
      
      y[j][k] += 
        ( (j ? 2 - u[i] : u[i]) + (k ? 2 - v[i] : v[i]) ) * beki[i];
    }
  }

  trc(x[0][0],x[0][1],x[1][0],x[1][1]);
  trc(y[0][0],y[0][1],y[1][0],y[1][1]);

  // s[last - 1],t[last - 1]からu[last-1],v[last-1]へ

  WeightedGraph<ll> g(36);
  auto idx=[](int a,int b,int c,int d){
    return a * 12 + b * 4 + c * 2 + d;
  };
  auto ok=[](int a,int b){
    if(a==1&&b==1)return false;
    return 0<=a&&a<3&&0<=b&&b<3;
  };
  auto add =[&g](int a,int b,ll val){
    g[a].eb(a,b,val);
    g[b].eb(b,a,val);
  };
  rep(j,3)rep(k,3) {
    if(!ok(j,k))continue;
    {
      int dj = j+1,dk=k;
      if(ok(j,k)&&ok(dj,dk)){
        add(idx(j,k,1,0),idx(dj,dk,0,0),1);
        add(idx(j,k,1,1),idx(dj,dk,0,1),1);
      }
    }
    {
      int dj = j,dk=k+1;
      if(ok(j,k)&&ok(dj,dk)){
        add(idx(j,k,0,1),idx(dj,dk,0,0),1);
        add(idx(j,k,1,1),idx(dj,dk,1,0),1);
      }
    }
    add(idx(j,k,1,0),idx(j,k,1,1),beki[last-1]*2);
    add(idx(j,k,0,0),idx(j,k,0,1),beki[last-1]*2);
    add(idx(j,k,0,1),idx(j,k,1,1),beki[last-1]*2);
    add(idx(j,k,0,0),idx(j,k,1,0),beki[last-1]*2);
  }

  ll ans = 1LL<<62;
  trc(s[last],t[last],u[last],v[last]);
  rep(j,2)rep(k,2){
    auto d = dijkstra(g,idx(s[last],t[last],j,k));
    trc(d);
    rep(l,2)rep(m,2){
      amin(ans,d[idx(u[last],v[last],l,m)] + x[j][k] + y[l][m]);
    }
    //trc(j,k,ans);
  }
  return ans;
  

  

}

void solve(){
  beki[0] = 1;
  rep1(i , 31) beki[i] = beki[i - 1] * 3;
  ini(Q);
  rep(i,Q) out(q());
}


Compiler output:
a.cc: In function 'll q()':
a.cc:196:1: error: return-statement with no value, in function returning 'll' {aka 'long long int'} [-fpermissive]
  196 | return;
      | ^~~~~~