結果

問題 No.416 旅行会社
ユーザー hibit_at
提出日時 2025-05-28 13:02:34
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,315 bytes
コンパイル時間 2,174 ms
コンパイル使用メモリ 124,520 KB
実行使用メモリ 19,528 KB
最終ジャッジ日時 2025-05-28 13:02:45
合計ジャッジ時間 10,890 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 5 WA * 6 TLE * 1 -- * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    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>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

struct UnionFind{
    vector<int> par;
    vector<int> connect;
    vector<set<int>> child;
    UnionFind(int n){
        par.resize(n,-1);
        connect.resize(n,1e9);
        connect[0] = 0;
        child.resize(n);
        rep(i,n){
            child[i].insert(i);
        }
    }
    int root(int x){
        if(par[x]<0){
            return x;
        }
        return par[x] = root(par[x]);
    }
    int size(int x){
        return -par[root(x)];
    }
    int merge(int x,int y,int turn){
        int rx = root(x);
        int ry = root(y);
        if(rx==ry){
            return rx;
        }
        if(rx>ry){
            swap(rx,ry);
        }
        par[rx] += par[ry];
        par[ry] = rx;
        for(int c:child[ry]){
            // debug(c);
            child[rx].insert(c);
            connect[c] = turn;
        }
        child[ry].clear();
        return rx;
    }

};

int main(){
    int n,m,q;
    cin >> n >> m >> q;
    UnionFind uf(n);
    vector<pair<int,int>> vp(m);
    cin >> vp;
    set<pair<int,int>> use;
    vector<pair<int,int>> vq(q);
    cin >> vq;
    rep(i,q){
        use.insert(vq[i]);
    }
    // debug(vp);
    // debug(vq);
    // debug(use);
    for(auto [a,b] : vp){
        if(use.count({a,b})){
            continue;
        }
        a--;
        b--;
        uf.merge(a,b,1e9);
    }
    // debug(uf.connect);
    reverse(all(vq));
    // debug(vq);
    int cnt = q;
    for(auto [a,b] : vq){
        a--;
        b--;
        uf.merge(a,b,cnt);
        cnt--;
    }
    // debug(uf.connect);
    for(int i=1;i<n;i++){
        int ans = uf.connect[i];
        if(ans<1e9){
            cout << ans << endl;
        }else{
            cout << -1 << endl;
        }
    }
}
0