#975923 (C++23) No.2743 Twisted Lattice

提出ソース

結果

問題	No.2743 Twisted Lattice
ユーザー	👑 hitonanode
提出日時	2024-04-20 23:56:28
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	559 ms / 3,000 ms
コード長	9,033 bytes
コンパイル時間	2,821 ms
コンパイル使用メモリ	237,824 KB
実行使用メモリ	39,124 KB
最終ジャッジ日時	2024-04-20 23:56:40
合計ジャッジ時間	8,308 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	524 ms 37,844 KB
testcase_01	AC	126 ms 9,784 KB
testcase_02	AC	99 ms 10,472 KB
testcase_03	AC	514 ms 37,884 KB
testcase_04	AC	549 ms 37,740 KB
testcase_05	AC	529 ms 39,124 KB
testcase_06	AC	559 ms 37,864 KB
testcase_07	AC	524 ms 39,056 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    lint H, W, N;
    cin >> H >> W >> N;

    vector<plint> xys;

    map<lint, vector<lint>> y2xs;

    REP(i, N) {
        lint x, y;
        cin >> x >> y;
        xys.emplace_back(x, y);

        y2xs[y].push_back(x);
    }

    vector<plint> y2minxs;
    for (auto &[y, xs] : y2xs) {
        sort(xs.begin(), xs.end());
        y2minxs.emplace_back(y, xs.front() - 1);
    }

    auto y2minxs_left = y2minxs, y2minxs_right = y2minxs;
    FOR(i, 1, y2minxs_left.size()) {
        chmin(y2minxs_left.at(i).second, y2minxs_left.at(i - 1).second + y2minxs_left.at(i).first - y2minxs_left.at(i - 1).first);
    }
    dbg(y2minxs_left);

    IREP(i, y2minxs_right.size() - 1) {
        chmin(y2minxs_right.at(i).second, y2minxs_right.at(i + 1).second + y2minxs_right.at(i + 1).first - y2minxs_right.at(i).first);
    }
    dbg(y2minxs_right);

    for (const auto [x, y] : xys) {
        lint ret = 1LL << 60;

        {
            const auto it = y2xs.find(y);
            assert(it != y2xs.end());

            const auto &near_xs = it->second;

            const int idx = arglb(near_xs, x);
            assert(near_xs.at(idx) == x);
            if (idx) {
                chmin(ret, (lint)abs(x - near_xs.at(idx - 1)));
            }
            if (idx + 1 < (int)near_xs.size()) {
                chmin(ret, (lint)abs(near_xs.at(idx + 1) - x));
            }
        }

        for (lint y2 : {y - 1, y + 1}) {
            const auto itr = y2xs.find(y2);
            if (itr == y2xs.end()) continue;
            const auto &near_xs = itr->second;
            const int idx = arglb(near_xs, x);
            if (idx) {
                lint x2 = near_xs.at(idx - 1);
                chmin(ret, abs(x - x2) + min<lint>(x, x2));
            }

            if (idx < (int)near_xs.size()) {
                lint x2 = near_xs.at(idx);
                chmin(ret, abs(x - x2) + min<lint>(x, x2));
            
            }
        }

        {
            int idx = arglb(y2minxs, plint(y, 0));
            assert(y2minxs.at(idx).first == y);
            if (idx + 1 < (int)y2minxs_right.size()) {
                chmin(ret, x - 1 + y2minxs_right.at(idx + 1).second + abs(y2minxs_right.at(idx + 1).first - y));
            }
            if (idx) {
                chmin(ret, x - 1 + y2minxs_left.at(idx - 1).second + abs(y2minxs_left.at(idx - 1).first - y));
            }
        }

        cout << ret << '\n';
    }
}

yukicoder

結果

テストケース

ソースコード