Submission #54845159

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<numeric>
#include<bitset>
#include<queue>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(x)  cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(x,a) for(auto& (x) : (a) )
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<numeric>
#include<bitset>
#include<queue>

#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(x)  cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(x,a) for(auto& (x) : (a) )
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECCOUT(x) for(auto&youso_: (x) )cout<<youso_<<" ";cout<<endl
#define pb(a) push_back(a)
#define mp make_pair
#define mt make_tuple

#define mll map<long long,long long>
#define msl map<string,long long>
#define pll pair<long long, long long>
#define qll queue<long long>
#define pqll priority_queue<long long>
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vvll vector<vector<long long>>

using ll = long long;
using ull = unsigned long long;
using namespace std;

const ll MOD = 998244353;
const ll INF = 1e18;

int main() {
    ll sx, sy, tx, ty, ans = 0;
    cin >> sx >> sy >> tx >> ty;
    ll st = (sx + sy) % 2, tt = (tx + ty) % 2;
    //cout << st << tt << endl;
    ll dx = tx - sx, dy = ty - sy;
    if (dx < 0) {
        swap(sx, tx);
        swap(sy, ty);
        swap(st, tt);
    }
    if (!st && sx != tx)sx++;
    if (tt && sx != tx)tx--;
    //cout << sx << " " << sy << " " << tx << " " << ty << endl;
    dx = tx - sx, dy = ty - sy;
    ll diag = min(abs(dx), abs(dy));
    //cout << diag << endl;
    ans += diag;
    sx += diag;
    sy += ((dy > 0) - (dy < 0)) * diag;
    //cout << sx << " " << sy << " " << tx << " " << ty << endl;
    if (sx == tx)ans += abs(ty - sy);
    else ans += abs(tx - sx) / 2 + 1;
    cout << ans;
    return 0;
}

Submission Info

Judge Result