#648551 (C++17) No.1480 Many Complete Graphs

提出ソース

結果

問題	No.1480 Many Complete Graphs
ユーザー	otera
提出日時	2021-04-16 20:55:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	70 ms / 2,000 ms
コード長	5,928 bytes
コンパイル時間	2,531 ms
コンパイル使用メモリ	213,980 KB
実行使用メモリ	12,160 KB
最終ジャッジ日時	2024-07-03 04:11:07
合計ジャッジ時間	6,177 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	12 ms 6,912 KB
testcase_14	AC	9 ms 5,504 KB
testcase_15	AC	24 ms 7,784 KB
testcase_16	AC	14 ms 6,912 KB
testcase_17	AC	13 ms 6,400 KB
testcase_18	AC	5 ms 5,760 KB
testcase_19	AC	15 ms 6,528 KB
testcase_20	AC	20 ms 6,352 KB
testcase_21	AC	13 ms 6,272 KB
testcase_22	AC	8 ms 5,376 KB
testcase_23	AC	28 ms 9,216 KB
testcase_24	AC	31 ms 7,336 KB
testcase_25	AC	44 ms 9,408 KB
testcase_26	AC	52 ms 11,336 KB
testcase_27	AC	31 ms 7,472 KB
testcase_28	AC	40 ms 11,484 KB
testcase_29	AC	41 ms 11,484 KB
testcase_30	AC	41 ms 11,488 KB
testcase_31	AC	41 ms 11,616 KB
testcase_32	AC	42 ms 11,612 KB
testcase_33	AC	40 ms 11,480 KB
testcase_34	AC	40 ms 11,612 KB
testcase_35	AC	40 ms 11,512 KB
testcase_36	AC	41 ms 11,508 KB
testcase_37	AC	40 ms 11,508 KB
testcase_38	AC	40 ms 11,640 KB
testcase_39	AC	39 ms 11,636 KB
testcase_40	AC	40 ms 11,628 KB
testcase_41	AC	40 ms 11,508 KB
testcase_42	AC	41 ms 11,612 KB
testcase_43	AC	40 ms 11,484 KB
testcase_44	AC	40 ms 11,484 KB
testcase_45	AC	41 ms 11,484 KB
testcase_46	AC	40 ms 11,480 KB
testcase_47	AC	68 ms 12,160 KB
testcase_48	AC	70 ms 12,160 KB
testcase_49	AC	70 ms 12,160 KB
testcase_50	AC	40 ms 11,776 KB
testcase_51	AC	70 ms 12,160 KB
testcase_52	AC	54 ms 11,892 KB
testcase_53	AC	55 ms 11,772 KB
testcase_54	AC	56 ms 11,888 KB
testcase_55	AC	57 ms 11,760 KB
testcase_56	AC	56 ms 11,760 KB
testcase_57	AC	33 ms 11,008 KB
testcase_58	AC	32 ms 10,212 KB
evil_aftercontest.txt	AC	63 ms 16,720 KB

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

ソースコード

raw source code

/**
 *    author:  otera
 *    created: 16.04.2021 20:31:06 
**/
#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define repa(i, n) for(int i = 0; i < n; ++ i)
#define repb(i, a, b) for(int i = a; i < b; ++ i)
#define repc(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 0; i <= n; ++ i)
#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)
#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>=1;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define tpow(n) (1LL<<(n))
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

#define int long long

void solve() {
    INT(n, m);
    vc<int> k(m);
    vc<ll> c(m);
    vvc<int> s(m);
    vvc<int> g(n);
    rep(i, m) {
        in(k[i], c[i]);
        s[i].resize(k[i]);
        rep(j, k[i]) {
            in(s[i][j]); 
            -- s[i][j];
            g[s[i][j]].pb(i);
        }
    }
    pqg<LP> pque;
    vc<ll> di(n, INF);
    vc<LP> val(m, {INF, INF});
    di[0] = 0;
    pque.push({0, 0});
    vc<int> used(m, 0);
    while(pque.size()) {
        auto p = pque.top(); pque.pop();
        int v = p.sc; ll d = p.fr;
        if(v < n) {
            if(di[v] > d) continue;
            for(int i: g[v]) {
                if(val[i].fr + val[i].sc > d + (v + 1)) {
                    val[i].fr = d, val[i].sc = v + 1;
                    pque.push({d + (v + 1) , i + n});
                } else if(val[i].fr + val[i].sc == d + (v + 1)) {
                    if((v + 1) % 2 == 0) {
                        val[i].fr = d, val[i].sc = v + 1;
                        pque.push({(d + v + 1) , i + n});
                    }
                }
            }
        } else {
            int i = v - n;
            if(used[i]) continue;
            used[i] = 1;
            for(int nv: s[i]) {
                if(chmin(di[nv], val[i].fr + ((val[i].sc + nv + 1 + 1) / 2) * 2 + 2 * c[i])) {
                    pque.push({di[nv], nv});
                }
            }
        }
    }
    out(di[n - 1] == INF ? -1 : di[n - 1] / 2);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << fixed << setprecision(20);
    // INT(t); rep(i, t)solve();
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード