結果

問題 No.1676 Coin Trade (Single)
コンテスト
ユーザー hamath
提出日時 2021-09-10 22:53:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 42 ms / 2,000 ms
コード長 4,204 bytes
コンパイル時間 2,980 ms
コンパイル使用メモリ 228,908 KB
最終ジャッジ日時 2025-01-24 12:00:40
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/functional:59,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53,
                 from main.cpp:8:
In copy constructor ‘std::function<_Res(_ArgTypes ...)>::function(const std::function<_Res(_ArgTypes ...)>&) [with _Res = bool; _ArgTypes = {std::pair<long long int, long long int>, std::pair<long long int, long long int>}]’,
    inlined from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<long long int, long long int>; _Sequence = std::vector<std::pair<long long int, long long int> >; _Compare = std::function<bool(std::pair<long long int, long long int>, std::pair<long long int, long long int>)>]’ at /usr/include/c++/13/bits/stl_queue.h:566:28,
    inlined from ‘void dijkstra(std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)’ at main.cpp:115:6:
/usr/include/c++/13/bits/std_function.h:391:17: warning: ‘<anonymous>’ may be used uninitialized [-Wmaybe-uninitialized]
  391 |             __x._M_manager(_M_functor, __x._M_functor, __clone_functor);
      |             ~~~~^~~~~~~~~~
/usr/include/c++/13/bits/std_function.h: In function ‘void dijkstra(std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)’:
/usr/include/c++/13/bits/std_function.h:267:7: note: by argument 2 of type ‘const std::_Any_data&’ to ‘static bool std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_manager(std::_Any_data&, const std::_Any_data&, std::_Manager_operation) [with _Res = bool; _Functor = dijkstra(std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)::<lambda(P, P)>; _ArgTypes = {std::pair<long long int, long long int>, std::pair<long long int, long long int>}]’ declared here
  267 |       _M_manager(_Any_data& __dest, const _Any_data& __source,
      |       ^~~~~~~~~~
main.cpp:115:6: note: ‘<anonymous>’ declared here
  115 |     });
      |

ソースコード

diff # 

#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a, b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n, arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a, b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>
bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if(b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>
istream &operator>>(istream &i, vector<T> &v) {
    rep(j, v.size())i>>v[j];
    return i;
}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len = v.size();
    for(int i = 0; i < len; ++i) {
        s<<v[i];
        if(i < len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    s<<endl;
    int len = vv.size();
    for(int i = 0; i < len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}


void dijkstra(vector<VP> &g, ll start, Vec &dist) {
    priority_queue<P, vector<P>, function<bool(P, P)>> q([](P a, P b)->ll {
        return a.second > b.second;
    });
    dist[start] = 0;
    q.push(mp(start, 0));
    while (!q.empty()) {
        P now = q.top();
        q.pop();
        if(dist[now.fi] < now.se) continue;
        Each(nxt, g[now.fi]) {
            if(chmin(dist[nxt.fi], now.se+nxt.se)) {
                q.push(mp(nxt.fi, dist[nxt.fi]));
            }
        }
    }
}


int solve() {
    ll n;
    cin>>n;
    ll k;
    cin>>k;
    Vec A(n);
    VV g(n);

    rep(i, n) {
        cin>>A[i];
        ll m;
        cin>>m;
        rep(j, m) {
            ll b;
            cin>>b;
            b--;
            g[i].pb(b);
        }
    }
    dbg(g);
    dbg(A);
    Vec dp(n+1,-INF);
    dp[0] = 0;
    rep(i, n) {
        chmax(dp[i+1], dp[i]);
        Each(j, g[i]) {
            //交換
            chmax(dp[i+1], dp[j+1] + A[i]-A[j]);
        }
    }
    ll ans = 0;
    rep(i,n){
        chmax(ans, dp[i+1]);
    }
    dbg(dp);
    out(ans);
    return 0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
0