Submission #27114589

---

Source Code Expand

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

#define rep(i, o) for (int i = 0; i < (o); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
#define NUM 1e5

typedef long long ll;
typedef unsigned long long ull;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }

const int MOD = 1000000007;

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

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


int main() {
    ll n;
    cin >> n;

    vector<ll> t(n), k(n); 
    vector<vector<ll>> a(n); 
    rep(i, n) {
      cin >> t[i] >> k[i];
      rep(j, k[i]) {
        ll e = 0;
        cin >> e;
        a[i].push_back(e);
      }
    }

    ll ans = t[n-1];
    map<ll, ll> c;
    rep (h, n) {
      if (k[n-1-h] == 0) continue;
      rep(i, k[n-1-h]) {
        if (c[a[n-1-h][i]]) break;
        c[a[n-1-h][i]]++;
        ans += t[a[n-1-h][i]-1];
      }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result