結果

問題 No.416 旅行会社
ユーザー tancahn2380
提出日時 2018-04-06 05:53:13
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 706 ms / 4,000 ms
コード長 2,190 bytes
コンパイル時間 1,423 ms
コンパイル使用メモリ 116,060 KB
実行使用メモリ 28,400 KB
最終ジャッジ日時 2024-12-14 20:29:08
合計ジャッジ時間 8,780 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
# include <bitset>
# include <random>
# include <chrono>
# include <cstdlib>
# include <tuple>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2147483647;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr double HDINF = 50000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
# define ALL(x)      (x).begin(),(x).end()
# define UNIQ(c)     (c).erase(unique(ALL((c))),(c).end())
# define LOWER(s)    transform(ALL((s)),(s).begin(),TL<char>)
# define UPPER(s)    transform(ALL((s)),(s).begin(),TU<char>)
# define FOR(i,a,b)  for(LL i=(a);i<(b);i++)
# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)
# define REP(i,n)    FOR(i,0,n)
# define INIT        std::ios::sync_with_stdio(false);std::cin.tie(0)
int n, m, q;
map<int, int> G[101010];
int ans[101010];
bool used[101010];
int main() {
    cin >> n >> m >> q;
    REP(i, m) {
        int a, b;
        cin >> a >> b;
        G[a][b] = HINF;
        G[b][a] = HINF;
    }
    REP(i, q) {
        int c, d;
        cin >> c >> d;
        G[c][d] = i + 1;
        G[d][c] = i + 1;
    }
    priority_queue<pair<int, int> > que;
    ans[1] = HINF;
    que.push(make_pair(HINF, 1));
    while (!que.empty()) {
        auto q = que.top();
        que.pop();
        int c = q.first;
        int i = q.second;
        if (used[i]) continue;
        used[i] = true;
        for (auto p : G[i]) {
            int j = p.first;
            int cc = p.second;
            if (ans[j] < min(ans[i], cc)) {
                ans[j] = min(ans[i], cc);
                que.push(make_pair(ans[j], j));
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (ans[i] == HINF)
            cout << -1 << endl;
        else
            cout << ans[i] << endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0