結果
| 問題 |
No.416 旅行会社
|
| ユーザー |
 はむこ
|
| 提出日時 | 2017-08-16 11:05:17 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 684 ms / 4,000 ms |
| コード長 | 8,595 bytes |
| コンパイル時間 | 2,358 ms |
| コンパイル使用メモリ | 199,268 KB |
| 実行使用メモリ | 33,776 KB |
| 最終ジャッジ日時 | 2024-12-14 20:23:59 |
| 合計ジャッジ時間 | 9,967 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 21 |
ソースコード
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
#define ZERO(a) memset(a,0,sizeof(a))
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
#define exists find_if
#define forall all_of
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using Pos = complex<double>;
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
string bits_to_string(ll input, ll n=64) { string s; rep(i, n) s += '0' + !!(input & (1ll << i)); reverse(all(s)); return s; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
struct ci : public iterator<forward_iterator_tag, ll> { ll n; ci(const ll n) : n(n) { } bool operator==(const ci& x) { return n == x.n; } bool operator!=(const ci& x) { return !(*this == x); } ci &operator++() { n++; return *this; } ll operator*() const { return n; } };
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
namespace myhash{ const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81}; const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2}; const int hash_key=xor_nums[rand()%20]; const int mod_key=xor_nums[rand()%20]; template <typename T> struct myhash{ std::size_t operator()(const T& val) const { return (hash<T>{}(val)%mod_key)^hash_key; } }; };
template <typename T> class uset:public std::unordered_set<T,myhash::myhash<T>> { using SET=std::unordered_set<T,myhash::myhash<T>>; public: uset():SET(){SET::rehash(myhash::Bsizes[rand()%20]);} };
template <typename T,typename U> class umap:public std::unordered_map<T,U,myhash::myhash<T>> { public: using MAP=std::unordered_map<T,U,myhash::myhash<T>>; umap():MAP(){MAP::rehash(myhash::Bsizes[rand()%20]);} };
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ gettimeofday(&start, NULL); ios::sync_with_stdio(false); cin.tie(0); srand((unsigned int)time(NULL)); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40)
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
// x, yをマージ, O(A^-1)
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
// x, yが同じ集合なら1, O(A^-1)
bool find(int x, int y) {
return root(x) == root(y);
}
// xの根を探す。同じ集合なら同じ根が帰る, O(A^-1)
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
// xが含まれる集合の大きさを返す, O(A^-1)
int size(int x) {
return -data[root(x)];
}
// 分離されている集合の数を返す, O(n)
int getSetNum(void) {
unordered_map<int, int> c;
rep(i, data.size()) {
c[root(i)]++;
}
return c.size();
}
// 頂点vと連結な集合を返す, O(n)
vector<int> getContainingSet(int v) {
vector<int> ret;
for (int i = 0; i < data.size(); i++)
if (root(i) == root(v))
ret.push_back(i);
return ret;
}
// 集合ごとに全部の要素を出力, O(n)
vector<vector<int>> getUnionList(void) {
map<int, vector<int>> c;
for (int i = 0; i < data.size(); i++)
c[root(i)].pb(i);
vector<vector<int>> v;
for (auto x : c)
v.push_back(x.second);
return v;
}
};
ostream &operator<<(ostream &o, struct UnionFind v) { v.getUnionList(); int i = 0; for (auto x : v.getUnionList()) { o << i << "\t"; for (auto y : x) o << y << " "; o << endl; i++;} return o; }
#define MAXN 100010
ll ret[MAXN];
vvll g;
void dfs(ll v, ll c) {
if (ret[v] != -2) return;
ret[v] = c;
for (auto x : g[v]) {
dfs(x, c);
}
}
int main(void) {
ll n,m,q;cin>>n>>m>>q;
g=vvll(n);
rep(i, MAXN) ret[i] = -2;
vvll g_all(n);
set<P> edges;
rep(i, m) {
ll u, v; cin>>u>>v;u--,v--;
g_all[u].pb(v),g_all [v].pb(u);
edges.insert(P(u, v));
}
vll c(q),d(q);
rep(i, q) {
cin >> c[i] >> d[i]; c[i]--, d[i]--;
edges.erase(P(c[i], d[i]));
}
for (auto x : edges) {
g[x.fi].pb(x.se);
g[x.se].pb(x.fi);
}
{
UnionFind uf(n);
rep(i, n) for (auto u : g_all[i]) {
uf.unite(i, u);
}
rep(i, n) if (uf.find(0, i) == 0) {
ret[i] = 0;
}
}
UnionFind uf(n);
for (auto x : edges) uf.unite(x.fi, x.se);
rep(i, n) if (uf.find(0, i) == 1) {
ret[i] = -1;
}
reverse(all(c)), reverse(all(d));
rep(i, q) {
ll u = c[i], v = d[i];
if (uf.find(0, u) && uf.find(0, v)) {
} else if (!uf.find(0, u) && !uf.find(0, v)) {
} else {
// uが0と連結、vが0と非連結とする
if (!uf.find(0, u) && uf.find(0, v)) {
swap(u, v);
}
dfs(v, q-i);
}
uf.unite(u, v);
g[v].pb(u);
g[u].pb(v);
}
repi(i, 1, n) {
cout << ret[i] << endl;
}
return 0;
}