제출 #1025045

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025045		c2zi6	장난감 기차 (IOI17_train)	C++14	27 / 100	16 ms	3792 KiB

train

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "train.h"

struct SCCF {
    int n;
    VVI gpa;
    VVI trans;
    VI vis;

    VVI comp;
    VI group;
    VI order;
    void dfs1(int u) {
        vis[u] = true;
        for (int v : gpa[u]) if (!vis[v]) dfs1(v);
        order.pb(u);
    }
    void dfs2(int u) {
        comp.back().pb(u);
        group[u] = comp.size()-1;
        vis[u] = true;
        for (int v : trans[u]) if (!vis[v]) dfs2(v);
    }

    tuple<VVI, VVI, VI, VI> operator()(VVI& GPA) {
        gpa = GPA;
        n = gpa.size();
        trans = VVI(n);
        rep(u, n) for (int v : gpa[u]) trans[v].pb(u);

        vis = VI(n);
        rep(u, n) if (!vis[u]) dfs1(u);
        reverse(all(order));

        vis = VI(n);
        group = VI(n);
        comp = VVI();
        for (int u : order) if (!vis[u]) {
            comp.pb(VI());
            dfs2(u);
        }

        VVI gpb(comp.size());
        VI cycle(comp.size());
        rep(u, n) for (int v : gpa[u]) if (group[u] != group[v]) {
            gpb[group[u]].pb(group[v]);
        } else cycle[group[u]] = true;
        return make_tuple(gpb, comp, group, cycle);
    }
} SCC;

namespace TEST1 {
    bool check(VI U, VI V) {
        rep(i, U.size()) if (V[i] != U[i] && V[i] != U[i]+1) return false;
        return true;
    }
    VI solve(VVI gp, VI owner, VI charge) {
        int n = gp.size();
        VI ans(n);
        reprl(u, n-1, 0) {
            if (gp[u].size() == 2) {
                if (owner[u] == 1) {
                    ans[u] = 0;
                    if (charge[u] == 1) ans[u] = 1;
                    else for (int v : gp[u]) if (v != u) {
                        if (ans[v] == 1) ans[u] = 1;
                    }
                } else {
                    ans[u] = 1;
                    if (charge[u] == 0) ans[u] = 0;
                    else for (int v : gp[u]) if (v != u) {
                        if (ans[v] == 0) ans[u] = 0;
                    }
                }
            } else if (gp[u].size()) {
                if (gp[u][0] == u) {
                    ans[u] = (charge[u]);
                } else {
                    ans[u] = ans[gp[u][0]];
                }
            }
        }
        return ans;
    }
};
namespace TEST2 {
};
namespace TEST3 {
    bool check(VI owner) {
        for (int x : owner) if (x == 0) return false;
        return true;
    }
    VI solve(VVI GP, VI OWNER, VI charge) {
        int n = GP.size();
        auto[gp, comp, group, cycle] = SCC(GP);
        int g = gp.size();
        VI ansg(g);
        rep(u, n) if (charge[u] && cycle[group[u]]) {
            ansg[group[u]] = true;
        }
        reprl(u, g-1, 0) {
            for (int v : gp[u]) {
                ansg[u] |= ansg[v];
            }
        }
        VI ans(n);
        rep(u, n) ans[u] = ansg[group[u]];
        return ans;
    }
};
namespace TEST4 {
    bool check(VI owner) {
        for (int x : owner) if (x == 1) return false;
        return true;
    }
    VI solve(VVI GP, VI OWNER, VI charge) {
        int n = GP.size();
        VI krox(n);
        if (true) {
            VVI gpa(n);
            rep(u, n) for (int v : GP[u]) {
                if (charge[u] || charge[v]) continue;
                gpa[u].pb(v);
            }
            auto[_, __, group, cycle] = SCC(gpa);
            rep(u, n) if (!charge[u]) {
                if (cycle[group[u]]) krox[u] = true;
            }
        }
        auto[gp, comp, group, cycle] = SCC(GP);
        int g = gp.size();
        VI ansg(g);
        rep(u, n) if (krox[u]) {
            ansg[group[u]] = true;
        }
        reprl(u, g-1, 0) {
            for (int v : gp[u]) {
                ansg[u] |= ansg[v];
            }
        }
        VI ans(n);
        rep(u, n) ans[u] = ansg[group[u]];
        for (int& x : ans) x = !x;
        return ans;
    }
};

VI who_wins(VI owner, VI charge, VI U, VI V) {
    int n = owner.size();
    int m = U.size();
    VVI gp(n);
    rep(i, m) gp[U[i]].pb(V[i]);
    if (TEST1::check(U, V)) return TEST1::solve(gp, owner, charge);
    if (TEST3::check(owner)) return TEST3::solve(gp, owner, charge);
    if (TEST4::check(owner)) return TEST4::solve(gp, owner, charge);
	return {3, 1, 4};
}

컴파일 시 표준 에러 (stderr) 메시지

train.cpp: In function 'VI TEST3::solve(VVI, VI, VI)':
train.cpp:125:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  125 |         auto[gp, comp, group, cycle] = SCC(GP);
      |             ^
train.cpp: In function 'VI TEST4::solve(VVI, VI, VI)':
train.cpp:155:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  155 |             auto[_, __, group, cycle] = SCC(gpa);
      |                 ^
train.cpp:160:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  160 |         auto[gp, comp, group, cycle] = SCC(GP);
      |             ^

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51