結果

問題 No.918 LISGRID
ユーザー furuya1223furuya1223
提出日時 2019-10-26 11:12:22
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 245 ms / 2,000 ms
コード長 11,146 bytes
コンパイル時間 2,791 ms
コンパイル使用メモリ 155,300 KB
実行使用メモリ 62,664 KB
最終ジャッジ日時 2023-10-12 03:47:20
合計ジャッジ時間 8,234 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 135 ms
38,268 KB
testcase_02 AC 52 ms
14,536 KB
testcase_03 AC 61 ms
19,596 KB
testcase_04 AC 57 ms
15,464 KB
testcase_05 AC 178 ms
46,240 KB
testcase_06 AC 159 ms
43,048 KB
testcase_07 AC 234 ms
59,836 KB
testcase_08 AC 138 ms
36,660 KB
testcase_09 AC 181 ms
47,280 KB
testcase_10 AC 183 ms
47,092 KB
testcase_11 AC 183 ms
47,172 KB
testcase_12 AC 199 ms
51,112 KB
testcase_13 AC 160 ms
42,308 KB
testcase_14 AC 221 ms
56,600 KB
testcase_15 AC 245 ms
62,664 KB
testcase_16 AC 88 ms
25,020 KB
testcase_17 AC 95 ms
26,956 KB
testcase_18 AC 88 ms
25,352 KB
testcase_19 AC 27 ms
9,880 KB
testcase_20 AC 127 ms
34,164 KB
testcase_21 AC 34 ms
12,140 KB
testcase_22 AC 21 ms
8,760 KB
testcase_23 AC 73 ms
21,608 KB
testcase_24 AC 5 ms
4,376 KB
testcase_25 AC 2 ms
4,348 KB
testcase_26 AC 1 ms
4,352 KB
testcase_27 AC 2 ms
4,352 KB
testcase_28 AC 1 ms
4,352 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 1 ms
4,348 KB
testcase_31 AC 1 ms
4,372 KB
testcase_32 AC 2 ms
4,352 KB
testcase_33 AC 2 ms
4,348 KB
testcase_34 AC 6 ms
4,444 KB
testcase_35 AC 11 ms
5,892 KB
testcase_36 AC 4 ms
4,348 KB
testcase_37 AC 122 ms
32,912 KB
testcase_38 AC 79 ms
23,212 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/timeb.h>
#include <vector>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define chmin(mi, value) mi = min(mi, value)
#define chmax(ma, value) ma = max(ma, value)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
//#define MOD 998244353
#define PI 3.141592653589793238
#define RMAX 4294967295

using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vvs = vector<vector<string>>;
using Pi = pair<int, int>;
using vPi = vector<Pi>;
using vvPi = vector<vector<Pi>>;
using vvvPi = vector<vector<vector<Pi>>>;
using vvvvPi = vector<vector<vector<vector<Pi>>>>;
using Pll = pair<ll, ll>;
using vPll = vector<Pll>;
using Pd = pair<double, double>;
using vPd = vector<Pd>;
template <class T>
using vec = vector<T>;
template <class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
using Comp = complex<double>;

// vvvvvvvvvvvvvvvvvvvvvvv debug output vvvvvvvvvvvvvvvvvvvvvvv
// vector input
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// deque
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// multiset
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

#define DUMPOUT cerr

void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

// ^^^^^^^^^^^^^^^^^^^^^^^ debug output ^^^^^^^^^^^^^^^^^^^^^^^

string YN(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "YES" : "NO");
}
string yn(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "Yes" : "No");
}
string ON(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "OK" : "NG");
}

int dir4[4][2] = {{0, -1}, {-1, 0}, {1, 0}, {0, 1}};
int dir8[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0},
                  {1, 0},   {-1, 1}, {0, 1},  {1, 1}};
char dirchar[4] = {'<', '^', '>', 'v'};

// [a,b)
int irand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_int_distribution<int> dist(a, b - 1);
    return dist(Rand);
}

// [a,b)
double drand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_real_distribution<double> dist(a, b);
    return dist(Rand);
}

// https://qiita.com/IgnorantCoder/items/3101d6276e9bdddf872c
template <typename A, typename F>
inline auto transform(const A &v, F &&f) {
    using result_type =
        decltype(std::declval<F>()(std::declval<typename A::value_type>()));
    vector<result_type> y(v.size());
    std::transform(std::cbegin(v), std::cend(v), std::begin(y), f);
    return y;
}

// generate vector which has multiple dimension
template <class T>
vector<T> make_v(size_t size, const T &init) {
    return vector<T>(size, init);
}
template <class... Ts>
auto make_v(size_t size, Ts... rest) {
    return vector<decltype(make_v(rest...))>(size, make_v(rest...));
}

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>
T Sum(vector<T> a) {
    return accumulate(all(a), (T)0);
}

// for counting using map
template <typename T>
void Add(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
        m[item] = 1;
    } else {
        m[item]++;
    }
}

// for counting using map
template <typename T>
void Erase(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
    } else {
        if (m[item] == 1) {
            m.erase(item);
        } else {
            m[item]--;
        }
    }
}

// get method for map with default value
template <typename T, typename U>
U Get(map<T, U> m, T key, U def) {
    if (m.find(key) == m.end()) {
        return def;
    } else {
        return m[key];
    }
}

template <typename T>
inline bool Contains(const set<T> &t, const T &key) {
    return t.find(key) != t.end();
}

template <typename T, typename U>
inline bool Contains(const map<T, U> &t, const T &key) {
    return t.find(key) != t.end();
}

template <class T>
struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
};
template <class T>
bool operator<(const Edge<T> e1, const Edge<T> e2) {
    return e1.cost < e2.cost || (e1.cost == e2.cost && e1.from < e2.from) ||
           (e1.cost == e2.cost && e1.from == e2.from && e1.to < e2.to);
}

template <class T>
ostream &operator<<(ostream &os, const Edge<T> &edge) {
    os << "(" << edge.from << "->" << edge.to << ":" << edge.cost << ")";
    return os;
}

template <class T = int>
class Graph {
    int n;
    bool directed;
    vector<vector<Edge<T>>> edges;

  public:
    Graph(int n, bool directed)
        : n(n), directed(directed), edges(vector<vector<Edge<T>>>(n)) {}

    void add_edge(int s, int t, T cost) {
        edges[s].emplace_back(s, t, cost);
        if (!directed) {
            edges[t].emplace_back(t, s, cost);
        }
    }
    Graph() {}

    vector<Edge<T>> &operator[](size_t i) {
        return edges[i];
    }

    int size() const {
        return n;
    }
};

//======================================================
class SCCD {
  public:
    stack<int> post;
    vb used;

    inline void dfs(int pos, int par, Graph<int> &g) {
        used[pos] = true;
        for (const auto &e : g[pos]) {
            if (used[e.to]) continue;
            dfs(e.to, pos, g);
        }
        post.push(pos);
    }

    inline void dfsrev(int pos, int par, Graph<int> &rev, vi &group) {
        used[pos] = true;
        group.push_back(pos);
        for (const auto &e : rev[pos]) {
            if (used[e.to]) continue;
            dfsrev(e.to, pos, rev, group);
        }
    }

    Graph<int> SCC(Graph<int> &G, vvi &scc, vi &n2g, Graph<int> &dag) {
        int n = G.size();
        Graph<int> rev(n, true);
        // 逆辺グラフの作成
        rep(i, n) {
            rep(j, G[i].size()) {
                auto e = G[i][j];
                rev.add_edge(e.to, e.from, 1);
            }
        }

        // 1 回目の DFS
        used = vb(n, false);
        rep(i, n) {
            if (!used[i]) dfs(i, -1, G);
        }

        // 2 回目の DFS
        fill(all(used), false);
        while (!post.empty()) {
            int pos = post.top();
            post.pop();
            if (used[pos]) continue;
            vi group;
            dfsrev(pos, -1, rev, group);
            scc.push_back(group);
        }

        // 頂点番号から強連結成分の番号を得る辞書の作成
        rep(i, scc.size()) {
            rep(j, scc[i].size()) {
                n2g[scc[i][j]] = i;
            }
        }

        dag = Graph<int>(scc.size(), true);
        set<pair<int, int>> usedEdges;

        // DAG を作成
        rep(i, n) {
            for (const auto &e : G[i]) {
                int s = n2g[e.from];
                int t = n2g[e.to];
                if (usedEdges.find(mp(s, t)) == usedEdges.end() && s != t) {
                    dag.add_edge(s, t, 1);
                    usedEdges.insert(mp(s, t));
                }
            }
        }
        return dag;
    }
};

int main() {
    int H, W;
    cin >> H >> W;
    vi A(H), B(W);
    cin >> A >> B;
    sort(rall(A));
    sort(rall(B));
    Graph<int> G(H * W, true);

    rep(i, H) {
        rep(j, A[i] - 1) {
            G.add_edge(i * W + j, i * W + j + 1, 1);
        }
        repr(j, A[i] - 1, W - 1) {
            G.add_edge(i * W + j + 1, i * W + j, 1);
        }
    }
    rep(j, W) {
        rep(i, B[j] - 1) {
            G.add_edge(i * W + j, (i + 1) * W + j, 1);
        }
        repr(i, B[j] - 1, H - 1) {
            G.add_edge((i + 1) * W + j, i * W + j, 1);
        }
    }

    vvi scc;
    vi n2g(H * W);
    Graph<int> dag;
    SCCD sccd;
    sccd.SCC(G, scc, n2g, dag);
    rep(i, H) {
        rep(j, W) {
            cout << n2g[i * W + j] + 1 << " ";
        }
        cout << endl;
    }

    return 0;
}
0