Labyrintti

input/code.cpp: In function 'int main()':
input/code.cpp:89:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < jo.size(); ++i) {
                      ^

#include <iostream>
#include <vector>
#include <unordered_map>
#define F first
#define S second
using namespace std;
typedef long long ll;
unordered_map<ll, unordered_map<ll,ll> > t;
int main() {
    ll ux, uy, mx, my;
    cin>>uy>>ux>>my>>mx;
    uy = -uy;
    my = -my;
    //cin>>ux>>uy>>mx>>my;
    ll x = 0;
    ll y = 0;
    ll x2 = -1;
    ll y2 = -1;
    t[x][y] = 1;
    ll len = 2;
    for(ll i = 0; i < 6; ++i) {
        for(ll j = 0; j < len; ++j) {
            if(i%4 == 0) ++x;
            if(i%4 == 1) ++y;
            if(i%4 == 2) --x;
            if(i%4 == 3) --y; 
            t[x][y] = 1;
        }
        len *= 2;
    }
    x = 0;
    y = 0;
    len = 2;
    vector<ll> v;
    vector<pair<ll, ll> > v2;
    for(ll i = 0; i < 62; ++i) {
        if(i%2 == 0) {
            v.push_back(y);
        }
        else {
            v.push_back(x);
        }
        v2.push_back({x2, y2});
        if(i%4 == 0) x += len, x2 += len+2;
        if(i%4 == 1) y += len, y2 += len+2;
        if(i%4 == 2) x -= len, x2 -= len+2;
        if(i%4 == 3) y -= len, y2 -= len+2; 
        len *= 2;
        //cout<<x<<' '<<y<<'\n';
    }
    ll ans = 0;
    for(ll i = (int)v.size()-5; i >= 1; --i) {
        bool q = 0;
        bool w = 0;
        if(i % 2 == 1) {
            q = ux > min(v[i], v[i+4]) && ux < max(v[i], v[i+4]);
            w = mx > min(v[i], v[i+4]) && mx < max(v[i], v[i+4]);
        }
        else {
            q = uy > min(v[i], v[i+4]) && uy < max(v[i], v[i+4]);
            w = my > min(v[i], v[i+4]) && my < max(v[i], v[i+4]);
        }
        //cout<<i<<' '<<q<<' '<<w<<' '<<ux<<' '<<uy<<' '<<mx<<' '<<my<<' '<<v[i]<<' '<<v[i+4]<<'\n';
        if(q && w) {
            cout<<ans + abs(mx-ux) + abs(my-uy)<<'\n';
            return 0;
        }
        if(i % 2 == 1) {
            if(uy > min(v[i-1], v[i+3]) && uy < max(v[i-1], v[i+3])) q = 0;
            if(my > min(v[i-1], v[i+3]) && my < max(v[i-1], v[i+3])) w = 0;
        }
        else {
            if(ux > min(v[i-1], v[i+3]) && ux < max(v[i-1], v[i+3])) q = 0;
            if(mx > min(v[i-1], v[i+3]) && mx < max(v[i-1], v[i+3])) w = 0;
        }
        if(q) {
            ans += abs(v2[i].F-ux) + abs(v2[i].S-uy);
            ux = v2[i].F;
            uy = v2[i].S;
        }
        if(w) {
            ans += abs(v2[i].F-mx) + abs(v2[i].S-my);
            mx = v2[i].F;
            my = v2[i].S;
        }
    }
    vector<pair<pair<ll, ll>, ll> > jo;
    jo.push_back({{mx, my}, ans});
    for(int i = 0; i < jo.size(); ++i) {
        if(jo[i].F.F == ux && jo[i].F.S == uy) {
            cout<<jo[i].S<<'\n';
            return 0;
        }
        for(int j = 0; j < 4; ++j) {
            ll ux = jo[i].F.F;
            ll uy = jo[i].F.S;
            if(j == 0) ++ux;
            if(j == 1) --ux;
            if(j == 2) ++uy;
            if(j == 3) --uy;
            if(t[ux][uy] == 0) {
                jo.push_back({{ux, uy}, jo[i].S+1});
                t[ux][uy] = 2;
            }
        }
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED