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

提出ソース

結果

問題	No.918 LISGRID
ユーザー	hitonanode
提出日時	2019-10-25 22:35:22
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	85 ms / 2,000 ms
コード長	6,088 bytes
コンパイル時間	2,045 ms
コンパイル使用メモリ	184,340 KB
実行使用メモリ	22,508 KB
最終ジャッジ日時	2024-09-13 04:51:56
合計ジャッジ時間	5,656 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	41 ms 14,656 KB
testcase_02	AC	17 ms 7,040 KB
testcase_03	AC	20 ms 8,576 KB
testcase_04	AC	16 ms 7,296 KB
testcase_05	AC	61 ms 17,328 KB
testcase_06	AC	59 ms 16,204 KB
testcase_07	AC	80 ms 21,584 KB
testcase_08	AC	48 ms 14,228 KB
testcase_09	AC	65 ms 17,720 KB
testcase_10	AC	61 ms 17,660 KB
testcase_11	AC	65 ms 17,524 KB
testcase_12	AC	68 ms 18,996 KB
testcase_13	AC	56 ms 15,808 KB
testcase_14	AC	78 ms 20,568 KB
testcase_15	AC	85 ms 22,508 KB
testcase_16	AC	30 ms 10,496 KB
testcase_17	AC	33 ms 11,132 KB
testcase_18	AC	30 ms 10,624 KB
testcase_19	AC	9 ms 6,940 KB
testcase_20	AC	43 ms 13,376 KB
testcase_21	AC	13 ms 6,944 KB
testcase_22	AC	8 ms 6,944 KB
testcase_23	AC	25 ms 9,344 KB
testcase_24	AC	3 ms 6,944 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,940 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	3 ms 6,940 KB
testcase_35	AC	5 ms 6,940 KB
testcase_36	AC	3 ms 6,944 KB
testcase_37	AC	43 ms 13,076 KB
testcase_38	AC	27 ms 9,856 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/


struct DirectedGraph
{
    int V; // 頂点数
    vector<vector<int> > to;
    vector<vector<int> > from;

    vector<bool> used;
    vector<int> vs;

    void dfs(int v)
    {
        used[v] = true;
        for (auto t : to[v]) if (!used[t]) dfs(t);
        vs.push_back(v);
    }
    void rdfs(int v, int k)
    {
        used[v] = true;
        cmp[v] = k;
        for (auto t : from[v]) if (!used[t]) rdfs(t, k);
    }

    vector<int> cmp;
    DirectedGraph(int V) : V(V),
                           to(vector<vector<int> >(V)), 
                           from(vector<vector<int> >(V)),
                           cmp(vector<int>(V))
                           {}
    void add_edge(int from_, int to_)
    {
        to[from_].push_back(to_);
        from[to_].push_back(from_);
    }

    int scc_num = -1;
    int scc()
    {
        used = vector<bool>(V, false);
        vs.clear();
        for (int v = 0; v < V; v++) if (!used[v]) dfs(v);

        used = vector<bool>(V, false);
        scc_num = 0;
        for (int i = vs.size() - 1; i >= 0; i--) if (!used[vs[i]]) rdfs(vs[i], scc_num++);
        return scc_num; // 強連結成分の個数を返却
    }

    // scc()を実行したあと，強連結成分を潰したトポロジカル順序のグラフを生成
    DirectedGraph generateTopologicalGraph()
    {
        DirectedGraph newgraph(scc_num);
        REP(s, V) for (auto t : to[s])
        {
            if (cmp[s] != cmp[t]) newgraph.add_edge(cmp[s], cmp[t]);
        }
        return newgraph;
    }
};

    // DirectedGraph g(12);
    // g.add_edge(0, 1);
    // g.add_edge(6, 8);
    // g.add_edge(6, 9);
    // g.add_edge(9, 8);
    // g.add_edge(8, 10);
    // g.add_edge(10, 8);
    // g.add_edge(9, 11);
    // cout << g.scc() << endl;
    // for (auto e : g.cmp) cout << e << endl;
int main()
{
    int H, W;
    cin >> H >> W;
    vector<int> A(H), B(W);
    cin >> A >> B;
    sort(A.rbegin(), A.rend());
    sort(B.rbegin(), B.rend());
    DirectedGraph g(H * W);
    REP(h, H)
    {
        int a = A[h];
        REP(i, a - 1) g.add_edge(h * W + i, h * W + (i + 1));
        FOR(i, a, W) g.add_edge(h * W + i, h * W + i - 1);
    }
    REP(w, W)
    {
        int b = B[w];
        REP(i, b - 1) g.add_edge(i * W + w, (i + 1) * W + w);
        FOR(i, b, H) g.add_edge(i * W + w, (i - 1) * W + w);
    }
    int t = g.scc();
    if (t < H * W) exit(8);
    vector<vector<int>> ret(H, vector<int>(W));
    REP(i, H * W) ret[i / W][i % W] = g.cmp[i];
    REP(h, H)
    {
        REP(w, W) cout << ret[h][w] + 1 << " ";
        cout << endl;
    }
}

yukicoder

結果

テストケース

ソースコード