#620962 (C++17) No.1393 Median of Walk

提出ソース

結果

問題	No.1393 Median of Walk
ユーザー	rniya
提出日時	2021-02-21 18:10:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	39 ms / 2,000 ms
コード長	5,562 bytes
コンパイル時間	2,299 ms
コンパイル使用メモリ	223,772 KB
実行使用メモリ	26,112 KB
最終ジャッジ日時	2024-09-19 15:58:43
合計ジャッジ時間	4,352 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,948 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	12 ms 6,944 KB
testcase_09	AC	12 ms 6,940 KB
testcase_10	AC	11 ms 6,940 KB
testcase_11	AC	27 ms 6,944 KB
testcase_12	AC	25 ms 6,944 KB
testcase_13	AC	20 ms 6,940 KB
testcase_14	AC	39 ms 6,944 KB
testcase_15	AC	26 ms 6,944 KB
testcase_16	AC	26 ms 6,944 KB
testcase_17	AC	28 ms 6,944 KB
testcase_18	AC	9 ms 6,940 KB
testcase_19	AC	26 ms 6,940 KB
testcase_20	AC	37 ms 6,944 KB
testcase_21	AC	37 ms 6,940 KB
testcase_22	AC	38 ms 6,944 KB
testcase_23	AC	36 ms 6,944 KB
testcase_24	AC	32 ms 6,944 KB
testcase_25	AC	24 ms 6,944 KB
testcase_26	AC	15 ms 6,940 KB
testcase_27	AC	15 ms 6,940 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	4 ms 6,944 KB
testcase_30	AC	31 ms 26,112 KB
testcase_31	AC	31 ms 26,112 KB
testcase_32	AC	15 ms 6,940 KB
testcase_33	AC	17 ms 6,944 KB
testcase_34	AC	16 ms 6,944 KB
testcase_35	AC	21 ms 6,940 KB
testcase_36	AC	26 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	24 ms 21,760 KB
testcase_39	AC	7 ms 6,944 KB
testcase_40	AC	7 ms 6,940 KB
testcase_41	AC	6 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<int> w(M);
    vector<vector<pair<int, int>>> G(N);
    vector<tuple<int, int, int>> es;
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v >> w[i];
        u--, v--;
        G[u].emplace_back(v, i);
        es.emplace_back(w[i], u, v);
    }
    sort(es.begin(), es.end());

    queue<int> que;
    vector<int> dp(N, INF);
    dp[0] = 0;
    que.emplace(0);

    while (!que.empty()) {
        int v = que.front();
        que.pop();
        for (auto e : G[v]) {
            int u = e.first;
            if (dp[u] != INF) continue;
            dp[u] = dp[v] + 1;
            que.emplace(u);
        }
    }

    auto dfs = [&](auto self, int v, int x) -> void {
        for (auto e : G[v]) {
            int u = e.first, c = (w[e.second] <= x ? -1 : 1);
            if (max(-N, dp[v] + c) < dp[u]) {
                dp[u] = max(-N, dp[v] + c);
                self(self, u, x);
            }
        }
    };

    auto update = [&](int u, int v, int x) {
        if (max(-N, dp[u] - 1) < dp[v]) {
            dp[v] = max(-N, dp[u] - 1);
            dfs(dfs, v, x);
        }
    };

    vector<int> ans(N, INF);
    for (int i = 0; i < M; i++) {
        int x, u, v;
        tie(x, u, v) = es[i];
        update(u, v, x);
        for (int j = 0; j < N; j++) {
            if (dp[j] <= 0) {
                ans[j] = min(ans[j], x);
            }
        }
    }

    for (int i = 1; i < N; i++) cout << (ans[i] == INF ? -1 : ans[i]) << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード