제출 #685586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685586		stanislavpolyn	Viruses (BOI20_viruses)	C++17	11 / 100	1 ms	376 KiB

Viruses

#include <bits/stdc++.h>

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pw(x) (1LL << (x))

using namespace std;

mt19937_64 rng(228);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int N = 105;

int G, n, m;
ve<ve<int>> from[N];

ll dp[N];
bool vis[N];

ll go(int v) {
    if (vis[v]) {
        return dp[v];
    }
    vis[v] = 1;

    ll best = 1e18;
    fe (x, from[v]) {
        ll sum = 0;
        fe (to, x) {
            if (to == v) {
                sum = 1e18;
                break;
            }

            sum += go(to);
            umn(sum, ll(1e18));
        }

        umn(best, sum);
    }

    dp[v] = best;
    return best;
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif

    cin >> G >> n >> m;

    fr (i, 1, n) {
        int a, k;
        cin >> a >> k;
        assert(a != 0 && a != 1);
        ve<int> v;
        bool bad = 0;
        fr (j, 1, k) {
            int x;
            cin >> x;
            v.pb(x);
            bad |= x == a;
        }
        if (!bad) {
            from[a].pb(v);
        }
    }

    fr (i, 2, G - 1) {
        dp[i] = 1e18;
    }

    vis[0] = vis[1] = 1;
    dp[0] = dp[1] = 1;

    bool changed = 1;
    while (changed) {
        changed = 0;
        fr (i, 0, G - 1) {
            fe (to, from[i]) {
                ll sum = 0;
                fe (x, to) {
                    sum += dp[x];
                    umn(sum, ll(1e18));
                }
                if (umn(dp[i], sum)) {
                    changed = 1;
                }
            }
        }
    }

    fr (i, 2, G - 1) {
        if (dp[i] == 1e18) {
            cout << "YES\n";
        } else {
            cout << "NO " << dp[i] << "\n";
        }
    }

    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 32
• Subtask 5: 0 / 18