結果
| 問題 |
No.2213 Neq Move
|
| コンテスト | |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2023-02-10 22:50:30 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 34 ms / 2,000 ms |
| コード長 | 6,021 bytes |
| コンパイル時間 | 12,652 ms |
| コンパイル使用メモリ | 302,432 KB |
| 最終ジャッジ日時 | 2025-02-10 13:18:35 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 5 |
ソースコード
//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
// #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
// #define _GLIBCXX_DEBUG
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
cerr << " " << v[iiiiiiii]; \
cerr << endl;
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int iv = 0; iv < v.size(); iv++) { \
for (int jv = 0; jv < v[iv].size(); jv++) { \
cerr << v[iv][jv] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
// #define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
}
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'
template <typename T>
class Zaatsu {
bool is_build;
vector<T> elements;
public:
Zaatsu() : is_build(false) {}
void add(T x) {
elements.push_back(x);
}
void add(vector<T> x) {
for (int i = 0; i < (int)x.size(); i++) {
elements.push_back(x[i]);
}
}
int build() {
sort(elements.begin(), elements.end());
UNIQUE(elements);
is_build = true;
return elements.size();
}
int operator[](T x) {
assert(is_build);
return lower_bound(elements.begin(), elements.end(), x) - elements.begin();
}
T original(int i) {
assert(is_build);
return elements[i];
}
};
void solve(ll a, ll b, ll c, ll d) {
vl use;
for (int e = -4; e <= 4; e++) {
use.push_back(a + e);
use.push_back(b + e);
use.push_back(c + e);
use.push_back(d + e);
use.push_back(e);
}
sort(all(use));
reverse(all(use));
while (use.back() < 0) {
use.pop_back();
}
reverse(all(use));
UNIQUE(use);
// DEBUG_VEC(use);
Zaatsu<ll> za;
za.add(use);
int cnt = za.build();
vii dp(cnt, vi(cnt, inf));
dp[za[a]][za[b]] = 0;
queue<pii> qu;
qu.emplace(za[a], za[b]);
while (qu.size()) {
auto [u, v] = qu.front();
qu.pop();
// DEBUG(pii(u, v));
int cost = dp[u][v];
// DEBUG(cost);
if (u != 0) {
int nu = 0, nv = v;
if (nu != nv && dp[nu][nv] == inf) {
dp[nu][nv] = cost + 1;
qu.emplace(nu, nv);
}
}
if (v != 0) {
int nu = u, nv = 0;
if (nu != nv && dp[nu][nv] == inf) {
dp[nu][nv] = cost + 1;
qu.emplace(nu, nv);
}
}
if (u < cnt - 1) {
int nu = u + 1, nv = v;
if (nu != nv && dp[nu][nv] == inf) {
dp[nu][nv] = cost + za.original(nu) - za.original(u);
qu.emplace(nu, nv);
}
}
if (v < cnt - 1) {
int nu = u, nv = v + 1;
if (nu != nv && dp[nu][nv] == inf) {
dp[nu][nv] = cost + za.original(nv) - za.original(v);
qu.emplace(nu, nv);
}
}
}
// DEBUG("done");
// DEBUG(za[c]);
// DEBUG(za[d]);
cout << dp[za[c]][za[d]] << endl;
}
signed main() {
int t;
cin >> t;
while (t--) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
solve(a, b, c, d);
}
}