結果

問題 No.529 帰省ラッシュ
ユーザー koprickykopricky
提出日時 2018-09-07 08:02:10
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 305 ms / 4,500 ms
コード長 8,613 bytes
コンパイル時間 2,943 ms
コンパイル使用メモリ 203,676 KB
実行使用メモリ 39,316 KB
最終ジャッジ日時 2024-05-04 00:29:58
合計ジャッジ時間 7,591 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 242 ms
23,808 KB
testcase_09 AC 226 ms
23,552 KB
testcase_10 AC 218 ms
29,744 KB
testcase_11 AC 234 ms
29,936 KB
testcase_12 AC 129 ms
21,948 KB
testcase_13 AC 151 ms
39,316 KB
testcase_14 AC 240 ms
26,112 KB
testcase_15 AC 305 ms
32,808 KB
testcase_16 AC 303 ms
32,808 KB
testcase_17 AC 223 ms
37,512 KB
testcase_18 AC 220 ms
37,636 KB
testcase_19 AC 222 ms
36,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

#define getchar getchar_unlocked
#define putchar putchar_unlocked

int in() {
    int n, c;
    while ((c = getchar()) < '0') if (c == EOF) return -1;
    n = c - '0';
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}

void out(int n) {
    int res[11], i = 0;
    do { res[i++] = n % 10, n /= 10; } while (n);
    while (i) putchar(res[--i] + '0');
    putchar('\n');
}

class HLdecomposition{
public:
    int V;
    vector<vector<int> > G;
    vector<int> stsize, parent, pathtop, in, out;
    void BuildStsize(int u, int p){
        stsize[u] = 1, parent[u] = p;
        for(int& v : G[u]){
            if(v == p) continue;
            BuildStsize(v, u);
            stsize[u] += stsize[v];
            if(stsize[v] > stsize[G[u][0]]){
                swap(v, G[u][0]);
            }
        }
    }
    void BuildPath(int u, int p, int& tm){
        in[u] = tm++;
        for(int v : G[u]){
            if(v == p) continue;
            pathtop[v] = (v == G[u][0] ? pathtop[u] : v);
            BuildPath(v, u, tm);
        }
        out[u] = tm;
    }

public:
    void add_edge(int u, int v){
        G[u].push_back(v), G[v].push_back(u);
    }
    void build(){
        int tm = 0;
        BuildStsize(0, -1), BuildPath(0, -1, tm);
    }
    //元の頂点のインデックスの配列上でのidを返す
    inline int get(int a){
        return in[a];
    }
    int lca(int a, int b){
        int pa = pathtop[a], pb = pathtop[b];
        while(pathtop[a] != pathtop[b]){
            if(in[pa] > in[pb]){
                a = parent[pa], pa = pathtop[a];
            }else{
                b = parent[pb], pb = pathtop[b];
            }
        }
        if(in[a] > in[b]) swap(a, b);
        return a;
    }
    void subtree_query(int a, const function< void(int, int) > &func){
        func(in[a], out[a]);
    }
    void path_query(int a, int b, const function< void(int, int) > &func){
        int pa = pathtop[a], pb = pathtop[b];
        while(pathtop[a] != pathtop[b]){
            if(in[pa] > in[pb]){
                func(in[pa], in[a] + 1);
                a = parent[pa], pa = pathtop[a];
            }else{
                func(in[pb], in[b] + 1);
                b = parent[pb], pb = pathtop[b];
            }
        }
        if(in[a] > in[b]) swap(a, b);
        func(in[a], in[b] + 1);
    }
    void construct(int node_size){
        V = node_size, G.resize(V), stsize.resize(V, 0), parent.resize(V, -1),
            pathtop.resize(V, -1), in.resize(V, -1), out.resize(V, -1);
    }
};

class biconnected{
public:
	using P = pair<int, int>;
	int V, kind;
	vector<vector<int> > G,tree;
	vector<vector<P> > check;
	vector<int> ord,low,cmp;
	vector<P> bridge;
	vector<bool> visit;
	biconnected(int node_size) : V(node_size), kind(0), G(V), check(V), ord(V), low(V)
									,cmp(V), visit(V, false){}
	void build(){
		int id = 0;
		for(int i = 0; i < V; i++){
			if(!visit[i]){
				dfs(i,-1,id);
			}
		}
	}
	void dfs(int u,int p,int &k)
	{
		visit[u] = true;
		ord[u] = k++;
		low[u] = ord[u];
		for(int i = 0; i < (int)G[u].size(); i++){
			int v = G[u][i];
			if(!visit[v]){
				dfs(v,u,k);
				low[u] = min(low[u],low[v]);
				if(ord[u] < low[v]){
				    bridge.push_back(P(u,v));
	                check[u][i].second = 1;
	                check[v][check[u][i].first].second = 1;
				}
			//(v,w)は後退辺
			}else if(v != p){
				low[u] = min(low[u],ord[v]);
			}
		}
	}

	void add_edge(int u,int v)
	{
	    G[u].push_back(v),G[v].push_back(u);
	    check[u].push_back(P((int)check[v].size(),0));
	    check[v].push_back(P((int)check[u].size()-1,0));
	}
	void restrict_dfs(int u,int p,int kind,queue<int>& que)
	{
	    visit[u] = true;
	    cmp[u] = kind;
	    for(int i = 0; i < (int)G[u].size(); i++){
			int v = G[u][i];
	        if(check[u][i].second){
	            if(!visit[v]){
	                que.push(v);
	            }
	        }else if(!visit[v]){
	            restrict_dfs(v,u,kind,que);
	        }
	    }
	}
    void rebuild()
    {
	    fill(visit.begin(),visit.end(),false);
	    for(int i = 0; i < V; i++){
	        if(!visit[i]){
	            queue<int> que;
	            que.push(i);
	            while(!que.empty()){
	                int p = que.front();
	                que.pop();
	                restrict_dfs(p,-1,kind,que);
	                kind++;
	            }
	        }
	    }
    }
	// 2(辺)連結成分を頂点とする木を作る
	void make_bctree(HLdecomposition& hl)
	{
        rebuild();
        hl.construct(kind);
	    for(int i = 0; i < (int)bridge.size(); i++){
	        int a = cmp[bridge[i].first], b = cmp[bridge[i].second];
            hl.add_edge(a, b);
	    }
	}
};

#define T int

class segtree {
private:
    int n,sz;
    vector<pair<T, int> > node;
public:
    segtree(vector<T>& v){
        sz = (int)v.size();
        n = 1;
        while(n < sz){
            n *= 2;
        }
        node.resize(2*n);
        rep(i,sz){
            node[i+n] = make_pair(v[i], i);
        }
        for(int i=n-1; i>=1; i--){
            node[i] = min(node[2*i], node[2*i+1]);
        }
    }
    void update(int k, T a)
    {
    	node[k+=n] = make_pair(a, k);
    	while(k>>=1){
            node[k] = min(node[2*k], node[2*k+1]);
    	}
    }
    pair<T, int> query(int a,int b,int k=0,int l=0,int r=-1)
    {
        pair<T, int> res1 = make_pair(numeric_limits<T>::max(), -1);
        pair<T, int> res2 = make_pair(numeric_limits<T>::max(), -1);
        a += n, b += n;
        while(a != b){
            if(a % 2) cmn(res1, node[a++]);
            if(b % 2) cmn(res2, node[--b]);
            a >>= 1, b>>= 1;
        }
        return min(res1, res2);
    }
    void print()
    {
        rep(i,sz){
            pair<T, int> p;
            p = query(i,i+1);
            cout << "st[" << i << "]: " << p.fi << " " << p.se << endl;
        }
    }
};

int main()
{
    int n,m,q;
    n = in(), m = in(), q = in();
    biconnected bc(n);
    rep(i,m){
        int u = in(), v = in();
        bc.add_edge(u-1,v-1);
    }
    bc.build();
    HLdecomposition hl;
    bc.make_bctree(hl);
    hl.build();
    int& kind = bc.kind;
    vi& cmp = bc.cmp;
    vi u(kind,0);
    vector<priority_queue<int> > que(kind);
    vector<int> mx(kind,0);
    vector<int> trans(kind);
    vector<int> unzip(kind);
    rep(i,kind){
        int res = hl.get(i);
        trans[i] = res;
        unzip[res] = i;
    }
    segtree seg(u);
    rep(i,q){
        int p,q,r;
        p = in(), q = in(), r = in();
        if(p == 1){
            int id = cmp[q-1];
            que[id].push(r);
            if(mx[id] < r){
                mx[id] = r;
                seg.update(trans[id],-r);
            }
        }else{
            int id1 = cmp[q-1],id2 = cmp[r-1];
            P ans = P(0,-1);
            hl.path_query(id1,id2,[&](int l, int r){ ans = min(ans,seg.query(l, r)); });
            if(ans.fi == 0){
                putchar('-'), putchar('1'), putchar('\n');
            }else{
                int real_id = unzip[ans.se];
                que[real_id].pop();
                if(que[real_id].empty()){
                    seg.update(ans.se,0);
                    mx[real_id] = 0;
                }else{
                    int res = que[real_id].top();
                    seg.update(ans.se,-res);
                    mx[real_id] = res;
                }
                out(-ans.fi);
            }
        }
    }
}
0