From 60214bc8d0cfa68c1e3b74b62d9dcd1f548390eb Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 24 Sep 2023 21:04:29 +0300 Subject: Solved 5 problem in the last Div.4 --- contests/Round896/B/main.cpp | 176 +++++++++++++++++++++++++++++++++++ contests/Round896/B/main_input0.txt | 28 ++++++ contests/Round896/B/main_input1.txt | 9 ++ contests/Round896/B/main_output0.txt | 5 + contests/Round896/B/main_output1.txt | 1 + 5 files changed, 219 insertions(+) create mode 100755 contests/Round896/B/main.cpp create mode 100644 contests/Round896/B/main_input0.txt create mode 100644 contests/Round896/B/main_input1.txt create mode 100644 contests/Round896/B/main_output0.txt create mode 100644 contests/Round896/B/main_output1.txt (limited to 'contests/Round896/B') diff --git a/contests/Round896/B/main.cpp b/contests/Round896/B/main.cpp new file mode 100755 index 0000000..e029c65 --- /dev/null +++ b/contests/Round896/B/main.cpp @@ -0,0 +1,176 @@ +#include +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) \ + sort(all((x))); \ + (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b)-1) / (b) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(vals...); +} + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +// (-1, 3) -> (-3, -3) = 2 + 6 = 8 +// (-1, 3) -> (-2, 3) -> (-3, -3) = 1 + 0 + 1 + 6 = 8 + +void solve() { + int n, k, a, b; + cin >> n >> k >> a >> b; + vector> v(n, vector(2)); + for (int i = 0; i < n; i++) { + cin >> v[i][0] >> v[i][1]; + } + if (a <= k && b <= k) { + cout << 0 << '\n'; + return; + } + a--; + b--; + int idx_e = 0; + ll mn_end = INT_MAX; + for (int i = 0; i < n; i++) { + if (i != b && mn_end > abs(v[b][0] - v[i][0]) + abs(v[b][1] - v[i][1])) { + idx_e = i; + mn_end = min(mn_end, abs(v[b][0] - v[i][0]) + abs(v[b][1] - v[i][1])); + } + } + int idx_a = 0; + ll mn = INT_MAX; + for (int i = 0; i < k; i++) { + if (i != idx_e && + mn > abs(v[idx_e][0] - v[i][0]) + abs(v[idx_e][1] - v[i][1])) { + idx_a = i; + mn = min(mn, abs(v[idx_e][0] - v[i][0]) + abs(v[idx_e][1] - v[i][1])); + } + } + ll ans = 0; + if (idx_a + 1 <= k && idx_e + 1 <= k) { + if (idx_a + 1 > k || a + 1 > k) { + ans += abs(v[idx_a][0] - v[a][0]) + abs(v[idx_a][1] - v[a][1]); + } + } else { + ans += abs(v[a][0] - v[idx_e][0]) + abs(v[a][1] - v[idx_e][1]); + } + + if (idx_e + 1 > k || b + 1 > k) { + ans += abs(v[b][0] - v[idx_e][0]) + abs(v[b][1] - v[idx_e][1]); + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round896/B/main_input0.txt b/contests/Round896/B/main_input0.txt new file mode 100644 index 0000000..e71b84a --- /dev/null +++ b/contests/Round896/B/main_input0.txt @@ -0,0 +1,28 @@ +5 +6 2 3 5 +0 0 +1 -2 +-2 1 +-1 3 +2 -2 +-3 -3 +2 0 1 2 +-1000000000 -1000000000 +1000000000 1000000000 +7 5 4 2 +154 147 +-154 -147 +123 456 +20 23 +43 20 +998 244 +353 100 +3 1 3 1 +0 10 +1 20 +2 30 +4 3 2 4 +0 0 +-100 100 +-1 -1 +-1 0 diff --git a/contests/Round896/B/main_input1.txt b/contests/Round896/B/main_input1.txt new file mode 100644 index 0000000..551cc43 --- /dev/null +++ b/contests/Round896/B/main_input1.txt @@ -0,0 +1,9 @@ +1 +7 2 3 5 +0 0 +1 -2 +-2 1 +-1 3 +1 -2 +2 -2 +-3 -3 \ No newline at end of file diff --git a/contests/Round896/B/main_output0.txt b/contests/Round896/B/main_output0.txt new file mode 100644 index 0000000..d434c75 --- /dev/null +++ b/contests/Round896/B/main_output0.txt @@ -0,0 +1,5 @@ +4 +4000000000 +0 +22 +1 diff --git a/contests/Round896/B/main_output1.txt b/contests/Round896/B/main_output1.txt new file mode 100644 index 0000000..56a6051 --- /dev/null +++ b/contests/Round896/B/main_output1.txt @@ -0,0 +1 @@ +1 \ No newline at end of file -- cgit v1.2.3