結果

問題 No.1480 Many Complete Graphs
ユーザー rniyarniya
提出日時 2021-04-16 21:15:38
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 86 ms / 2,000 ms
コード長 6,186 bytes
コンパイル時間 2,087 ms
コンパイル使用メモリ 207,904 KB
実行使用メモリ 16,564 KB
最終ジャッジ日時 2023-09-16 02:52:55
合計ジャッジ時間 6,411 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 14 ms
8,488 KB
testcase_14 AC 9 ms
6,652 KB
testcase_15 AC 20 ms
9,640 KB
testcase_16 AC 13 ms
8,120 KB
testcase_17 AC 12 ms
7,384 KB
testcase_18 AC 5 ms
6,204 KB
testcase_19 AC 13 ms
7,456 KB
testcase_20 AC 18 ms
8,184 KB
testcase_21 AC 16 ms
8,340 KB
testcase_22 AC 9 ms
5,864 KB
testcase_23 AC 33 ms
13,256 KB
testcase_24 AC 29 ms
10,672 KB
testcase_25 AC 40 ms
12,860 KB
testcase_26 AC 48 ms
13,744 KB
testcase_27 AC 31 ms
10,852 KB
testcase_28 AC 39 ms
14,384 KB
testcase_29 AC 40 ms
14,500 KB
testcase_30 AC 38 ms
14,068 KB
testcase_31 AC 37 ms
14,036 KB
testcase_32 AC 40 ms
14,476 KB
testcase_33 AC 39 ms
14,168 KB
testcase_34 AC 40 ms
14,504 KB
testcase_35 AC 38 ms
14,116 KB
testcase_36 AC 38 ms
14,000 KB
testcase_37 AC 37 ms
14,064 KB
testcase_38 AC 38 ms
14,080 KB
testcase_39 AC 38 ms
14,032 KB
testcase_40 AC 38 ms
14,080 KB
testcase_41 AC 38 ms
14,304 KB
testcase_42 AC 40 ms
14,516 KB
testcase_43 AC 40 ms
14,392 KB
testcase_44 AC 39 ms
14,040 KB
testcase_45 AC 41 ms
14,480 KB
testcase_46 AC 39 ms
14,152 KB
testcase_47 AC 80 ms
16,388 KB
testcase_48 AC 86 ms
16,564 KB
testcase_49 AC 82 ms
16,444 KB
testcase_50 AC 47 ms
16,128 KB
testcase_51 AC 82 ms
16,468 KB
testcase_52 AC 61 ms
16,068 KB
testcase_53 AC 63 ms
16,032 KB
testcase_54 AC 59 ms
15,948 KB
testcase_55 AC 62 ms
16,032 KB
testcase_56 AC 61 ms
16,072 KB
testcase_57 AC 41 ms
15,500 KB
testcase_58 AC 43 ms
15,696 KB
evil_aftercontest.txt AC 86 ms
28,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief Dijkstra
 * @docs docs/graph/Dijkstra.md
 */
template <typename T> struct Dijkstra {
    struct edge {
        int to;
        T cost;
        edge(int to, T cost) : to(to), cost(cost) {}
        bool operator<(const edge& e) const { return cost > e.cost; }
    };
    vector<vector<edge>> G;
    vector<T> dp;
    vector<int> pre;
    Dijkstra(int n) : G(n), dp(n), pre(n) {}
    void add_edge(int u, int v, T c) { G[u].emplace_back(v, c); }
    void build(int s) {
        int n = G.size();
        fill(dp.begin(), dp.end(), numeric_limits<T>::max());
        fill(pre.begin(), pre.end(), -1);
        priority_queue<edge> pq;
        dp[s] = 0;
        pq.emplace(s, dp[s]);
        while (!pq.empty()) {
            auto p = pq.top();
            pq.pop();
            int v = p.to;
            if (dp[v] < p.cost) continue;
            for (auto e : G[v]) {
                if (dp[v] + e.cost < dp[e.to]) {
                    dp[e.to] = dp[v] + e.cost;
                    pre[e.to] = v;
                    pq.emplace(e.to, dp[e.to]);
                }
            }
        }
    }
    vector<int> restore(int t) {
        vector<int> res;
        if (pre[t] < 0) return res;
        while (~t) {
            res.emplace_back(t);
            t = pre[t];
        }
        reverse(res.begin(), res.end());
        return res;
    }
    T operator[](int to) { return dp[to]; }
};

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    Dijkstra<ll> D(N + 2 * M);
    for (int i = 0; i < M; i++) {
        int k, c;
        cin >> k >> c;
        int even = N + i * 2 + 0, odd = N + i * 2 + 1;
        for (; k--;) {
            int s;
            cin >> s;
            if (!(s & 1)) {
                D.add_edge(s - 1, even, s / 2 + c);
                D.add_edge(even, s - 1, s / 2);
                D.add_edge(odd, s - 1, s / 2 + 1);
            } else {
                D.add_edge(s - 1, odd, s / 2 + c);
                D.add_edge(even, s - 1, (s + 1) / 2);
                D.add_edge(odd, s - 1, (s + 1) / 2);
            }
        }
    }

    D.build(0);
    ll ans = D[N - 1];
    cout << (ans >= IINF ? -1 : ans) << '\n';
    return 0;
}
0