CCHESS_COSTLY_CHESS.md

Algorithm: Graph

Problem: CCHESS COSTLY CHESS

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vb vector<bool>
#define vs vector<string>
///............x...........///
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ff first
#define ss second
#define bg begin()
#define UNIQUE(X) (X).erase(unique(all(X)), (X).end())
#define ft cout << "for test"<<endl;
#define read(v, a, n) for (int i = a; i<n; i++)cin>>v[i];
#define print(v) for (auto it : v)cout << it<<' ';cout << endl;
#define PI acos(-1.0)
#define yes cout <<"Yes"<< endl
#define no cout<<"No"<<endl
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define t_c int test, cs = 1;cin>>test;while (test--)
#define casep cout<<"Case "<< cs++<<": ";
///................function.....................///

#define D(a) (double)(a)
#define sqr(a) (a * a)
#define siz(s) (int)(s.size())
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Min(a) *min_element(all(a))
///#define mod 1000000007
///.........Graph.........///
///..........King.........///
//int X[] = {1, -1, 0, 0};
//int Y[] = {0, 0, 1, -1};
///.........Knight........///
int X[] = {1, 1,-1,-1,2,-2, 2,-2};
int Y[] = {2,-2, 2,-2,1, 1,-1,-1};
///........constant........///
const ll N = 1e6+5;
int main(){
    FIO;
    int a,b,c,d;
    while(cin>>a>>b>>c>>d){
        queue<pii>q;
        q.push({a,b});
        vvi cost(9,vi(9,1000000));
        cost[a][b]=0;
        while(!q.empty()){
            pii u = q.front();q.pop();
            for(int i=0; i<8; i++){
                int x = X[i]+u.ff, y = Y[i]+u.ss;
                if(0<=x and x<8 and 0<=y and y<8){
                    int tmp = u.ff*x+u.ss*y;
                    if(cost[x][y]>tmp+cost[u.ff][u.ss]){
                        cost[x][y]=tmp+cost[u.ff][u.ss];
                        q.push({x,y});
                    }
                }
            }
        }
        cout<<((cost[c][d]==INT_MAX)?-1:cost[c][d])<<endl;
    }
}