結果

問題 No.1480 Many Complete Graphs
コンテスト
ユーザー ningenMe
提出日時 2021-04-16 21:59:46
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 4,362 bytes
コンパイル時間 3,593 ms
コンパイル使用メモリ 211,796 KB
最終ジャッジ日時 2025-01-20 19:55:55
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    vector<vector<int>> edges(N+1+M);
    vector<int64> C(M);
    for(int i=0;i<M;++i) {
        int K; cin >> K;
        cin >> C[i];
        for(int j=0;j<K;++j) {
            int s; cin >> s;
            edges[s].push_back(i+N+1);
            edges[i+N+1].push_back(s);
        }
    }
    priority_queue_reverse<pair<pair<double,int>,int>> pq;
    vector<double> dp(N+1+M,HIGHINF);
    dp[1] = 0;
    pq.push({{0,0},1}); 
    while(pq.size()) {
        auto p = pq.top(); pq.pop();
        double cost = p.first.first;
        int pre = p.first.second;
        int from = p.second;
        if(dp[from] < cost) continue;
        if(N+1<=from) {
            for(int to:edges[from]) {
                double new_cost = dp[from] + (double)to/2.;
                new_cost = ceil(new_cost);
                if(dp[to] > new_cost) {
                    dp[to] = new_cost;
                    pq.push({{dp[to],0},to});
                }
            }
        }
        else {
            for(int to:edges[from]) {
                double new_cost = dp[from] + C[to-(N+1)] + (double)from / 2.;
                if(dp[to] > new_cost) {
                    dp[to] = new_cost;
                    pq.push({{dp[to],from},to});
                }
            }
        }
    }
    int64 ans = dp[N];
    if(ans >= HIGHINF) ans = -1;
    cout << ans << endl;
    return 0;
}
0