#900920 (C++23) No.2411 Reverse Directions

提出ソース
結果

問題	No.2411 Reverse Directions
ユーザー	👑 seekworser
提出日時	2023-08-11 22:57:51
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	16,611 bytes
コンパイル時間	3,522 ms
コンパイル使用メモリ	280,420 KB
実行使用メモリ	9,984 KB
最終ジャッジ日時	2024-11-18 18:12:22
合計ジャッジ時間	6,458 ms
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	9 ms 6,820 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,820 KB
testcase_07	AC	12 ms 9,984 KB
testcase_08	AC	2 ms 6,816 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	23 ms 9,824 KB
testcase_11	RE	-
testcase_12	RE	-
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	9 ms 6,820 KB
testcase_15	AC	4 ms 6,816 KB
testcase_16	AC	3 ms 6,816 KB
testcase_17	AC	10 ms 6,820 KB
testcase_18	AC	5 ms 6,816 KB
testcase_19	AC	2 ms 6,816 KB
testcase_20	AC	8 ms 6,816 KB
testcase_21	AC	8 ms 6,820 KB
testcase_22	RE	-
testcase_23	AC	2 ms 6,816 KB
testcase_24	RE	-
testcase_25	AC	2 ms 6,820 KB
testcase_26	AC	3 ms 6,820 KB
testcase_27	AC	7 ms 6,820 KB
testcase_28	RE	-
testcase_29	AC	25 ms 7,936 KB
testcase_30	AC	19 ms 6,816 KB
testcase_31	AC	17 ms 6,820 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
// line 1 "answer.cpp"
#if !__INCLUDE_LEVEL__
#include __FILE__
int main() {
    ll h,w,k,l,r;
    input(h,w,k,l,r);
    if ((r-l) % 2 != 1) return No();
    vs s(h);
    input(s);
    BoardHelper bh({h,w});
    auto d1 = vv<ll>(h,w,INFL);
    auto dir1 = vv<char>(h,w,'$');
    auto d2 = vv<ll>(h,w,INFL);
    auto dir2 = vv<char>(h,w,'$');
    auto calcd = [&] (vvl &d, vector<vector<char>> &dir, ll sx, ll sy) {
        auto seen = vv<ll>(h,w,0);
        deque<tuple<ll,ll,ll>> q;
        q.emplace_back(0, sx, sy);
        seen[sx][sy] = true;
        d[sx][sy] = 0;
        while (sz(q)) {
            auto [di,x,y] = q.front();
            q.pop_front();
            repe(e, DXY) {
                auto [dx, dy] = e;
                ll nx = x+dx, ny = y + dy;
                if (!bh.in_board(nx, ny)) continue;;
                if (!seen[nx][ny] && s[nx][ny] != '#') {
                    seen[nx][ny] = true;
                    d[nx][ny] = di + 1;
                    q.emplace_back(di+1, nx, ny);
                    if (dx == 1 && dy == 0) dir[nx][ny] = 'D';
                    if (dx == -1 && dy == 0) dir[nx][ny] = 'U';
                    if (dx == 0 && dy == 1) dir[nx][ny] = 'R';
                    if (dx == 0 && dy == -1) dir[nx][ny] = 'L';
                }
            }
        }
        return;
    };
    calcd(d1, dir1, 0, 0);
    calcd(d2, dir2, h-1, w-1);
    rep(i, h) debug(dir2[i]);
    debug("---");
    rep(i, h) debug(d2[i]);
    if (d1[h-1][w-1] > k || (k - d1[h-1][w-1]) % 2 != 0) {
        return No();
    }
    rep(x, h) rep(y, w) {
        debug(x,y);
        repe(e, DXY) {
            auto [dx, dy] = e;
            ll nx = x+dx, ny = y + dy;
            if (!bh.in_board(nx, ny)) continue;;
            if (d1[x][y] < l && d2[nx][ny] < k - r) {
                bool valid = false;
                ll dir = 1;

                if (in_range<ll>(x, 1, h-1) && s[x-1][y] == '.' && s[x+1][y] == '.') {
                    valid = true;
                }
                if (in_range<ll>(y, 1, w-1) && s[x][y-1] == '.' && s[x][y+1] == '.') {
                    valid = true;
                    dir = 2;
                }
                if (!valid) continue;
                debug(x, y, nx, ny);
                ll xi = x, yi = y;
                string ans;
                while (xi != 0 || yi != 0) {
                    ans += dir1[xi][yi];
                    if (dir1[xi][yi] == 'D') xi--;
                    if (dir1[xi][yi] == 'U') xi++;
                    if (dir1[xi][yi] == 'R') yi--;
                    if (dir1[xi][yi] == 'L') yi++;
                }
                debug(ans);
                reverse(all(ans));
                if (dir == 1) {
                    rep(i, (k - d1[x][y] - d2[nx][ny]) / 2) {
                        ans += "DU";
                    }
                } else {
                    rep(i, (k - d1[x][y] - d2[nx][ny]) / 2) {
                        ans += "RL";
                    }
                }
                if (dx == 1 && dy == 0) ans += 'D';
                if (dx == -1 && dy == 0) ans += 'U';
                if (dx == 0 && dy == 1) ans += 'R';
                if (dx == 0 && dy == -1) ans += 'L';
                debug(ans);
                xi = nx, yi = ny;
                while (xi != h-1 || yi != w-1) {
                    if (dir2[xi][yi] == 'D') {
                        ans += 'U';
                        xi--;
                    } else if (dir2[xi][yi] == 'U') {
                        ans += "D";
                        xi++;
                    } else if (dir2[xi][yi] == 'R') {
                        ans += 'L';
                        yi--;
                    } else if (dir2[xi][yi] == 'L') {
                        ans += 'R';
                        yi++;
                    } else {
                        assert(false);
                    }
                }
                debug(ans);
                assert(sz(ans) == k);
                Yes();
                return print(ans);
            }
        }
    }
    No();
}
#else
// line 2 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// shorten typenames
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// define CONSTANTS
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-10;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return (abs(x - y) < EPSL * x || abs(x - y) < EPSL); }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS * x; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// fasten io
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// define macros
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // iterate over all elements in v
#define smod(n, m) ((((n) % (m)) + (m)) % (m))
#define sdiv(n, m) (((n) - smod(n, m)) / (m))
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());}
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };

template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

ll powm(ll a, ll n, ll mod=INFL) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res;
}
ll sqrtll(ll x) {
    assert(x >= 0);
    ll rev = sqrt(x);
    while(rev * rev > x) --rev;
    while((rev+1) * (rev+1)<=x) ++rev;
    return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; }
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; }
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; }
/**
 * @brief std.hpp
 * @docs docs/std/std.md
 */
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/helper/board_helper.hpp"
const vector<pii> DXY = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
const vector<pii> DDXY = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};
const vector<tuple<int, int, int>> DXYZ = {{-1, 0, 0}, {1, 0, 0}, {0, -1, 0}, {0, 1, 0}, {0, 0, -1}, {0, 0, 1}};
class BoardHelper{
    private:
    ll oned_size;
    vector<ll> mul_for_dim;

    public:
    int dimension;
    vector<ll> board_size;

    BoardHelper (vector<ll> bs) : mul_for_dim(bs.size()), dimension(bs.size()), board_size(bs) {
        mul_for_dim[dimension-1] = 1;
        for (int i=dimension - 2; i >= 0; i--) {
            mul_for_dim[i] = mul_for_dim[i+1] * board_size[i+1];
        }
        oned_size = mul_for_dim[0] * board_size[0];
    }

    template<typename... Arg> ll to_1d(Arg... ind) {
        int count = 0;
        ll rev = 0;
        for (ll i : initializer_list<ll>{ind...}) {
            assert(count < dimension);
            assert(0 <= i && i < board_size[count]);
            rev += i * mul_for_dim[count];
            count++;
        }
        assert(count == dimension);
        return rev;
    }
    vector<ll> to_nd(ll ind) {
        assert(0 <= ind && ind < oned_size);
        vector<ll> rev;
        for (int i=0; i<dimension; i++) {
            rev.push_back(ind / mul_for_dim[i]);
            ind %= mul_for_dim[i];
        }
        return rev;
    }
    bool in_board(const vector<ll> &ind) {
        if (sz(ind) != dimension) return false;
        bool rev = true;
        for (int i=0; i<dimension; i++) {
            if (ind[i] < 0 || board_size[i] <= ind[i]) {
                rev = false;
                break;
            }
        }
        return rev;
    }
    template<typename... Arg> bool in_board(Arg... ind) {
        int count = 0;
        for (ll i : initializer_list<ll>{ind...}) {
            if (count >= dimension) return false;
            if (i < 0 || board_size[count] <= i) {
                return false;
            }
            count++;
        }
        return true;
    }
};
/**
 * @brief board_helper.hpp
 * @docs docs/helper/board_helper.md
 */
// line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp"
// overload operators (prototypes)
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);

// overload operators
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }

template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };
template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {
    cout << val << sep;
    print_sep_end(sep, end, remain...);
    return 0;
};
template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };
template <typename... T> void flush() { cout << flush; };
template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };
#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
template <typename T> void input(T &a) { cin >> a; };
template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };
#ifdef LOCAL_TEST
template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(T &...) {}
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
 * @brief io.hpp
 * @docs docs/std/io.md
 */
// line 123 "answer.cpp"
#endif
yukicoder

結果

テストケース

ソースコード
