結果

問題 No.529 帰省ラッシュ
ユーザー しらっ亭しらっ亭
提出日時 2017-06-11 01:22:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 400 ms / 4,500 ms
コード長 8,716 bytes
コンパイル時間 2,191 ms
コンパイル使用メモリ 190,596 KB
実行使用メモリ 36,080 KB
最終ジャッジ日時 2023-08-22 10:42:20
合計ジャッジ時間 7,890 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 6 ms
4,376 KB
testcase_05 AC 6 ms
4,380 KB
testcase_06 AC 6 ms
4,376 KB
testcase_07 AC 6 ms
4,376 KB
testcase_08 AC 289 ms
17,220 KB
testcase_09 AC 295 ms
17,812 KB
testcase_10 AC 327 ms
23,428 KB
testcase_11 AC 321 ms
23,536 KB
testcase_12 AC 263 ms
18,596 KB
testcase_13 AC 174 ms
36,080 KB
testcase_14 AC 286 ms
21,092 KB
testcase_15 AC 400 ms
26,148 KB
testcase_16 AC 399 ms
26,308 KB
testcase_17 AC 351 ms
33,840 KB
testcase_18 AC 354 ms
34,076 KB
testcase_19 AC 359 ms
31,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T>bool amax(T&a,const T&b){return a<b?a=b,1:0;}
template<class T>bool amin(T&a,const T&b){return a>b?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

struct BICC {
  const int N;
  const vector<vector<int> > &E;
  vector<pair<int, int> > bridges;
  vector<int> ord;
  vector<int> comp;
  int count;

  BICC(const vector<vector<int> > &E) : N(E.size()), E(E), ord(N, -1), comp(N), count(0) {
    inS.resize(N);
    int time = 0;
    for (int v = 0; v < N; v++) {
      if (ord[v] == -1) {
        dfs(v, -1, time);
        bridges.pop_back();
      }
    }
  }

  private:
  vector<int> inS;
  stack<int> S, roots;

  void dfs(int cur, int pre, int &time) {
    ord[cur] = time++;
    S.push(cur); inS[cur] = true;
    roots.push(cur);
    for (auto &nex : E[cur]) {
      if (ord[nex] == -1) dfs(nex, cur, time);
      else if (pre != nex && inS[nex]) while (ord[roots.top()] > ord[nex]) roots.pop();
    }
    if (cur == roots.top()) {
      bridges.emplace_back(pre, cur);
      while (1) {
        int w = S.top(); S.pop(); inS[w] = false;
        comp[w] = count;
        if (cur == w) break;
      }
      roots.pop();
      ++count;
    }
  }
};

struct HLDecomposition {
  using Edge = int;
  using Graph = vector<vector<Edge>>;

  const int n;
  const vector<vector<int>> &G;
  vector<int> vid, head, heavy, parent, depth, inv;

  HLDecomposition(const Graph &G, const int root = 0) : n(G.size()), G(G), vid(n, -1), head(n), heavy(n, -1), parent(n), depth(n), inv(n) {
    dfs(root, -1);
    bfs(root);
  }

  // 頂点属性の for_each
  void for_each(int u, int v, function<void(int, int)> f) {
    if (vid[u] > vid[v]) swap(u, v);
    f(max(vid[head[v]], vid[u]), vid[v]);
    if (head[u] != head[v]) for_each(u, parent[head[v]], f);
  }


private:
  int dfs(int cur, int pre) {
    parent[cur] = pre;
    int size = 1;
    int max_size = 0;
    for (auto nex : G[cur]) if (nex != pre) {
      depth[nex] = depth[cur] + 1;
      int nex_size = dfs(nex, cur);
      size += nex_size;
      if (max_size < nex_size) max_size = nex_size, heavy[cur] = nex;
    }
    return size;
  }

  void bfs(int root) {
    int k = 0;
    queue<int> q({ root });
    while (!q.empty()) {
      int h = q.front(); q.pop();
      for (int i = h; i != -1; i = heavy[i]) {
        vid[i] = k++;
        inv[vid[i]] = i;
        head[i] = h;
        for (int j : G[i]) if (j != parent[i] && j != heavy[i]) q.push(j);
      }
    }
  }
};

template<class V, class Merge> struct SegmentTree {
  const int n;
  const V unit_value;
  vector<V> val;

  SegmentTree(int _n) : n(1 << (33-__builtin_clz(_n-1))), unit_value(Merge::unit()), val(n, unit_value) {}

  V get(int i) const { return val[i + n / 2]; }
  void set(int i, const V &v) { val[i + n / 2] = v; }

  void build() {
    for (int i = n / 2 - 1; i > 0; i--) val[i] = Merge::merge(val[i * 2 + 0], val[i * 2 + 1]);
  }

  void update(int i, const V &v) {
    i += n / 2;
    val[i] = v;
    while (i > 1) {
      i >>= 1;
      val[i] = Merge::merge(val[i * 2 + 0], val[i * 2 + 1]);
    }
  }

  // [l, r)
  V query(int l, int r) const {
    l = max(0, min(n / 2, l)) + n / 2;
    r = max(0, min(n / 2, r)) + n / 2;
    V ret = unit_value;
    for (; l < r; l >>= 1, r >>= 1) {
      if (l & 1) ret = Merge::merge(ret, val[l++]);
      if (r & 1) ret = Merge::merge(ret, val[--r]);
    }
    return ret;
  }
};
template <class V> struct MergeRangeMaxQ {
  static V merge(const V &l, const V &r) { return l > r ? l : r; }
  static V unit() { return {-1, -1}; }
};

void Main() {
  int n = ri();
  int m = ri();
  int q = ri();

  vvi E(n);

  rep(i, m) {
    int u = ri()-1;
    int v = ri()-1;
    E[u].push_back(v);
    E[v].push_back(u);
  }

  BICC bicc(E);

  vvi T(bicc.count);
  forr(uv, bicc.bridges) {
    int u = bicc.comp[uv.fst];
    int v = bicc.comp[uv.snd];
    T[u].push_back(v);
    T[v].push_back(u);
  }

  vi g_to_t(n);
  rep(i, n) {
    g_to_t[i] = bicc.comp[i];
  }

  int l = bicc.count;

  out(T);
  HLDecomposition hld(T);
  SegmentTree<pii, MergeRangeMaxQ<pii>> seg(l);

  out(hld.vid);



  vector<priority_queue<int>> pq(l);

  while(q--) {
    int t = ri();
    if (t == 1) {
      int u = ri()-1;
      int w = ri();
      int t = g_to_t[u];
      out(u, t, w);
      pq[t].emplace(w);
      if (pq[t].top() == w) {
        seg.update(hld.vid[t], {w, t});
      }
    }
    else {
      int u = ri()-1;
      int v = ri()-1;
      u = g_to_t[u];
      v = g_to_t[v];
      out(u, v);

      pii ma = {-1, -1};

      hld.for_each(u, v, [&](int l, int r) {
          out(l, r);
          pii cand = seg.query(l, r+1);
          out(cand);
          amax(ma, cand);
          });

      out(ma);
      cout << ma.fst << endl;

      if (ma.fst != -1) {
        int t = ma.snd;
        pq[t].pop();
        out(pq[t]);
        int w = -1;
        if (pq[t].size()) w = pq[t].top();
        seg.update(hld.vid[t], {w, t});
        out(seg.get(hld.vid[t]));
      }
    }
  }
}

signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }
0