#394685 (C++14) No.918 LISGRID

提出ソース

結果

問題	No.918 LISGRID
ユーザー	jell
提出日時	2019-10-29 16:32:51
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	47 ms / 2,000 ms
コード長	11,468 bytes
コンパイル時間	2,055 ms
コンパイル使用メモリ	140,316 KB
実行使用メモリ	13,724 KB
最終ジャッジ日時	2024-09-14 21:31:49
合計ジャッジ時間	5,609 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 8,008 KB
testcase_01	AC	24 ms 11,792 KB
testcase_02	AC	12 ms 9,432 KB
testcase_03	AC	14 ms 9,824 KB
testcase_04	AC	12 ms 9,520 KB
testcase_05	AC	32 ms 12,244 KB
testcase_06	AC	29 ms 11,884 KB
testcase_07	AC	43 ms 13,432 KB
testcase_08	AC	25 ms 11,484 KB
testcase_09	AC	32 ms 12,400 KB
testcase_10	AC	31 ms 12,332 KB
testcase_11	AC	32 ms 12,404 KB
testcase_12	AC	38 ms 12,616 KB
testcase_13	AC	30 ms 11,804 KB
testcase_14	AC	41 ms 13,120 KB
testcase_15	AC	47 ms 13,724 KB
testcase_16	AC	18 ms 10,504 KB
testcase_17	AC	19 ms 10,552 KB
testcase_18	AC	18 ms 10,496 KB
testcase_19	AC	9 ms 8,812 KB
testcase_20	AC	24 ms 11,220 KB
testcase_21	AC	10 ms 9,120 KB
testcase_22	AC	8 ms 9,116 KB
testcase_23	AC	16 ms 10,416 KB
testcase_24	AC	5 ms 8,416 KB
testcase_25	AC	4 ms 7,968 KB
testcase_26	AC	5 ms 8,096 KB
testcase_27	AC	5 ms 7,984 KB
testcase_28	AC	5 ms 8,760 KB
testcase_29	AC	5 ms 7,948 KB
testcase_30	AC	6 ms 7,972 KB
testcase_31	AC	5 ms 8,040 KB
testcase_32	AC	4 ms 8,060 KB
testcase_33	AC	5 ms 8,112 KB
testcase_34	AC	6 ms 8,300 KB
testcase_35	AC	7 ms 8,356 KB
testcase_36	AC	5 ms 8,060 KB
testcase_37	AC	23 ms 11,024 KB
testcase_38	AC	17 ms 10,052 KB

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

コンパイルメッセージ

main.cpp:317:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  317 | main()
      | ^~~~

ソースコード

raw source code

#ifdef stderr_path
    #define LOCAL
#endif
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#else
    #pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>

// #define NDEBUG
#define __precision__ 10
#define debug_stream std::cerr
#define iostream_untie true

#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
#define __odd(n) ((n) & 1)
#define __even(n) (not __odd(n))
#define __popcount(n) __builtin_popcountll(n)
#define __clz32(n) __builtin_clz(n)
#define __clz64(n) __builtin_clzll(n)
#define __ctz32(n) __builtin_ctz(n)
#define __ctz64(n) __builtin_ctzll(n)

using i32 = int_least32_t;
using i64 = int_least64_t;
using ui32 = uint_least32_t;
using ui64 = uint_least64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
template <class T> using heap = std::priority_queue<T>;
template <class T> using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T> constexpr T inf = std::numeric_limits<T>::max() / T(2) - T(1123456);

namespace execution
{
    std::chrono::system_clock::time_point start_time, end_time;
    void print_elapsed_time()
    {
        end_time = std::chrono::system_clock::now();
        std::cerr << "\n----- Exec time : ";
        std::cerr << std::chrono::duration_cast<std::chrono::milliseconds>(
                         end_time - start_time)
                         .count();
        std::cerr << " ms -----\n\n";
    }
    struct setupper
    {
        setupper()
        {
            if(iostream_untie)
            {
                std::ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
            }
            std::cout << std::fixed << std::setprecision(__precision__);
#ifdef stderr_path
            if(freopen(stderr_path, "a", stderr))
            {
                std::cerr << std::fixed << std::setprecision(__precision__);
            }
#endif
#ifdef stdout_path
            if(not freopen(stdout_path, "w", stdout))
            {
                freopen("CON", "w", stdout);
                std::cerr << "Failed to open the stdout file\n\n";
            }
            std::cout << "";
#endif
#ifdef stdin_path
            if(not freopen(stdin_path, "r", stdin))
            {
                freopen("CON", "r", stdin);
                std::cerr << "Failed to open the stdin file\n\n";
            }
#endif
#ifdef LOCAL
            std::cerr << "----- stderr at LOCAL -----\n\n";
            atexit(print_elapsed_time);
            start_time = std::chrono::system_clock::now();
#else
            fclose(stderr);
#endif
        }
    } __setupper;
} // namespace execution

class myclock_t
{
    std::chrono::system_clock::time_point built_pt, last_pt;
    int built_ln, last_ln;
    std::string built_func, last_func;
    bool is_built;

  public:
    explicit myclock_t() : is_built(false) {}
    void build(int crt_ln, const std::string &crt_func)
    {
        is_built = true;
        last_pt = built_pt = std::chrono::system_clock::now();
        last_ln = built_ln = crt_ln, last_func = built_func = crt_func;
    }
    void set(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            last_pt = std::chrono::system_clock::now();
            last_ln = crt_ln, last_func = crt_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::set failed (yet to be built!)\n";
        }
    }
    void get(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            std::chrono::system_clock::time_point crt_pt(
                std::chrono::system_clock::now());
            int64_t diff =
                std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt -
                                                                      last_pt)
                    .count();
            debug_stream << diff << " ms elapsed from"
                         << " [ " << last_ln << " : " << last_func << " ]";
            if(last_ln == built_ln) debug_stream << " (when built)";
            debug_stream << " to"
                         << " [ " << crt_ln << " : " << crt_func << " ]"
                         << "\n";
            last_pt = built_pt, last_ln = built_ln, last_func = built_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "
                         << "myclock_t::get failed (yet to be built!)\n";
        }
    }
};
#ifdef LOCAL
myclock_t __myclock;
#define build_clock() __myclock.build(__LINE__, __func__)
#define set_clock() __myclock.set(__LINE__, __func__)
#define get_clock() __myclock.get(__LINE__, __func__)
#else
#define build_clock() ((void)0)
#define set_clock() ((void)0)
#define get_clock() ((void)0)
#endif

namespace std
{
    template <class RAitr> void rsort(RAitr __first, RAitr __last) { sort(__first, __last, greater<>()); }
    template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }
    template <class T, class U>
    struct hash<pair<T, U>>
    {
        size_t operator()(pair<T, U> const &pr) const
        {
            return hash_combine(hash_combine(0, pr.first), pr.second);
        }
    };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
    struct tuple_hash_calc
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(
                tuple_hash_calc<tuple_t, index - 1>::apply(seed, t),
                get<index>(t));
        }
    };
    template <class tuple_t>
    struct tuple_hash_calc<tuple_t, 0>
    {
        static size_t apply(size_t seed, tuple_t const &t)
        {
            return hash_combine(seed, get<0>(t));
        }
    };
    template <class... T>
    struct hash<tuple<T...>>
    {
        size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); }
    };
    template <class T, class U> istream &operator>>(std::istream &s, pair<T, U> &p) { return s >> p.first >> p.second; }
    template <class T, class U> ostream &operator<<(std::ostream &s, const pair<T, U> &p) { return s << p.first << " " << p.second; }
    template <class T> istream &operator>>(istream &s, vector<T> &v) { for(T &e : v) s >> e; return s; }
    template <class T>
    ostream &operator<<(ostream &s, const vector<T> &v)
    {
        bool is_front = true;
        for(const T &e : v)
        {
            if(not is_front) s << ' ';
            else  is_front = false;
            s << e;
        }
        return s;
    }
    template <class tuple_t, size_t index>
    struct tupleos
    {
        static ostream &apply(ostream &s, const tuple_t &t)
        {
            tupleos<tuple_t, index - 1>::apply(s, t);
            return s << " " << get<index>(t);
        }
    };
    template <class tuple_t>
    struct tupleos<tuple_t, 0>
    {
        static ostream &apply(ostream &s, const tuple_t &t) { return s << get<0>(t); }
    };
    template <class... T>
    ostream &operator<<(ostream &s, const tuple<T...> &t)
    { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s, t); }
    template <> ostream &operator<<(ostream &s, const tuple<> &t) { return s; }
    string revstr(string str) { reverse(str.begin(), str.end()); return str; }
} // namespace std

#ifdef LOCAL
#define dump(...)                                                              \
    debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n",       \
        dump_func(#__VA_ARGS__, __VA_ARGS__)
template <class T>
void dump_func(const char *ptr, const T &x)
{
    debug_stream << '\t';
    for(char c = *ptr; c != '\0'; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << '\n';
}
template <class T, class... rest_t>
void dump_func(const char *ptr, const T &x, rest_t... rest)
{
    debug_stream << '\t';
    for(char c = *ptr; c != ','; c = *++ptr)
    {
        if(c != ' ') debug_stream << c;
    }
    debug_stream << " : " << x << ",\n";
    dump_func(++ptr, rest...);
}
#else
#define dump(...) ((void)0)
#endif
template <class P>
void read_range(P __first, P __second) { for(P i = __first; i != __second; ++i) std::cin >> *i; }
template <class P> void write_range(P __first, P __second)
{ for(P i = __first; i != __second; std::cout << (++i == __second ? '\n' : ' ')) std::cout << *i; }

// substitue y for x if x > y.
template <class T> bool sbmin(T &x, const T &y) { return x > y ? x = y, true : false; }
// substitue y for x if x < y.
template <class T> bool sbmax(T &x, const T &y) { return x < y ? x = y, true : false; }
// binary search.
i64 bin(const std::function<bool(i64)> &f, i64 ok, i64 ng)
{
    while(std::abs(ok - ng) > 1)
    {
        i64 mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
double bin(const std::function<bool(double)> &f, double ok, double ng, const double eps)
{
    while(std::abs(ok - ng) > eps)
    {
        double mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
// be careful that val is type-sensitive.
template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }
template <class A> void reset(A &array) { memset(array, 0, sizeof(array)); }
void for_permutation(size_t n, const std::function<void(const std::vector<size_t>&)> &f)
{
    std::vector<size_t> idx(n); iota(idx.begin(), idx.end(), 0);
    do { f(idx); } while(std::next_permutation(idx.begin(), idx.end()));
}
void for_permutation(size_t n, const std::function<void(size_t*, size_t*)> &f)
{
    size_t *__begin = new size_t[n], *__end = __begin + n;
    std::iota(__begin, __end, 0);
    do { f(__begin, __end); } while(std::next_permutation(__begin, __end));
    delete[] __begin;
}

/* The main code follows. */

using namespace std;

main()
{
    void __solve();

    ui32 t = 1;

#ifdef LOCAL
    t = 1;
#endif

    // cin >> t;

    while(t--)
    {
        __solve();
    }
}

i32 ans[444][444];
vector<pii> adj[444][444];
i32 h,w;

void dfs(i32 i,i32 j,i32 &t)
{
    if(i>=h || j>=w || i<0 || j<0) return;
    if(ans[i][j]) return;
    for(auto e : adj[i][j])
    {
        dfs(e.first,e.second,t);
    }
    ans[i][j]=t--;
}

void __solve()
{
    cin>>h>>w;
    vector<i32> a(h),b(w); cin>>a>>b;
    sort(all(b));
    sort(all(a));
    for(i32 i=0; i<h; ++i)
    {
        i32 k=w-a[i];
        for(i32 j=0; j<=k; ++j)
        {
            adj[i][j].emplace_back(i,j-1);
        }
        for(i32 j=k; j<w; ++j)
        {
            adj[i][j].emplace_back(i,j+1);
        }
    }
    for(i32 i=0; i<w; ++i)
    {
        i32 k=h-b[i];
        for(i32 j=0; j<=k; ++j)
        {
            adj[j][i].emplace_back(j-1,i);
        }
        for(i32 j=k; j<h; ++j)
        {
            adj[j][i].emplace_back(j+1,i);
        }
    }
    i32 cnt=h*w;
    for(i32 i=0; i<h; ++i)
    {
        for(i32 j=0; j<w; ++j)
        {
            dfs(i,j,cnt);
            cout<<ans[i][j]<<" ";
        }
        cout << "\n";
    }
    assert(!cnt);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード