Submission #3373702


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>

#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n'
#define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n'

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef vector<int> vint;
typedef vector<ll> vll;
const ull INF = ULLONG_MAX;
const ll MOD = 998244353;

typedef ll Weight;
struct Edge {
    int src, dst;
    Weight weight;
    Edge(int src, int dst, Weight weight) :
    src(src), dst(dst), weight(weight) { }
};
bool operator < (const Edge &e, const Edge &f) {
    return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
    e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

pair<Weight, Graph> Prim(const Graph &g, int r = 0) {
	int n = g.size();
	Graph T(n);
	Weight total = 0;
	vector<bool> visited(n);
	priority_queue<Edge> Q;
	Q.push(Edge(-1, r, 0));
	while (!Q.empty()) {
		Edge e = Q.top();
		Q.pop();
		if (visited[e.dst])
			continue;
    if(e.src>=0){
  		T[e.src].push_back(e);
      T[e.dst].push_back({e.dst,e.src,e.weight});
    }
		total += e.weight;
		visited[e.dst] = true;
		for (Edge f:g[e.dst])
			if (!visited[f.dst])
				Q.push(f);
	}
	return pair<Weight, Graph>(total, T);
}



inline int get_min2pow(int n) {
	int res = 1;
	while (res < n)
		res *= 2;
	return res;
}

///Segment Tree////////

template<typename T,T dval>
struct segtree {
	int N;
	vector<T> node;
	//例外値 ex)INF,0
	T default_value = dval;
	static inline T merge(const T& l, const T& r) {
		//RMQ
		return max(l,r);
		//RSQ
		//return l+r;
	}
	segtree(int n) {
		N = get_min2pow(n);
		node.resize(2 * N, default_value);
	}
	segtree(vector<int> v) {
		int sz = v.size();
		N = get_min2pow(sz);
		node.resize(2 * N, default_value);
		for (int i = 0; i < sz; i++)
			node[i + N - 1] = v[i];
		for (int i = N - 2; i >= 0; i--)
			node[i] = merge(node[2 * i + 1], node[2 * i + 2]);
	}
	// update k th element
	void update(int k, T val) {
		k += N - 1; // leaf
		node[k] = val;
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = merge(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	// [a, b)
	T query(int a, int b) {
		return query(a, b, 0, 0, N);
	}
	T query(int a, int b, int k, int l, int r) {
		if (r <= a or b <= l)
			return default_value;
		if (a <= l and r <= b)
			return node[k];
		int m = (l + r) / 2;
		T vl = query(a, b, k * 2 + 1, l, m);
		T vr = query(a, b, k * 2 + 2, m, r);
		return merge(vl, vr);
	}
};


struct HLDecomposition{
  int V;
  vint dep,par,heavy,head,id,size,dat;
  segtree<ll,0> RMQ;
  HLDecomposition(const Graph &g,int root=0)
  :V(g.size()),dep(V,0),par(V,-1),heavy(V,-1),head(V),id(V),size(V,1),dat(V,-1),RMQ(V){
    //make par
    par[root]=0;
    vint q(V);
    int l=0,r=0;
    q[r++]=root;
    while(l<r){
      int v=q[l++];
      for(const Edge &w:g[v])
      if(par[w.dst]<0){
        q[r++]=w.dst;
        par[w.dst]=v;
        dat[w.dst]=w.weight;
        dep[w.dst]=dep[v]+1;
      }
    }
    par[root]=-1;
    //calculate heavy
    reverse(q.begin(),q.end());
    repeat(i,V){
      int v=q[i];
      if(par[v]<0)continue;
      size[par[v]]+=size[v];
      if(heavy[par[v]]<0||size[v]>size[heavy[par[v]]])heavy[par[v]]=v;
    }
    //calculate id
    int idx=0;
    repeat(v,V){
      if(par[v]<0||heavy[par[v]]!=v){
        for(int w=v;w!=-1;w=heavy[w]){
          head[w]=v;
          id[w]=idx++;
          RMQ.update(id[w],dat[w]);
        }
      }
    }
  }
  // [u,v]
  ll query(int u,int v){
    ll ret=0;
    while(1){
      if(id[u]>id[v])swap(u,v);
      if(head[u]!=head[v]){
        ret = max(ret,RMQ.query(id[head[v]],id[v]+1));
        v=par[head[v]];
      }else{
        if(u!=v)ret = max(ret,RMQ.query(id[u]+1,id[v]+1));
        return ret;
      }
    }
  }

  int lca(int u,int v){
    while(1){
      if(id[u]>id[v])swap(u,v);
      if(head[u]==head[v])return u;
      v=par[head[v]];
    }
  }

  int distance(int u,int v){
    return dep[u]+dep[v]-2*dep[lca(u,v)];
  }
};

int main(){
  int N,M;cin>>N>>M;
  Graph g(N);
  repeat(i,M){
    int a,b;
    Weight c;
    cin>>a>>b>>c;
    a--;b--;
    g[a].push_back({a,b,c});
    g[b].push_back({b,a,c});
  }
  pair<Weight, Graph> tree=Prim(g,0);
  HLDecomposition hld(tree.second,0);
  int Q;cin>>Q;
  repeat(q,Q){
    int s,t;cin>>s>>t;
    s--;t--;
    ll ans=tree.first-hld.query(s,t);
    cout << ans << endl;
  }
  return 0;
}

Submission Info

Submission Time
Task A - Graph
User hashiryo
Language C++14 (GCC 5.4.1)
Score 200
Code Size 5106 Byte
Status WA
Exec Time 787 ms
Memory 28268 KB

Judge Result

Set Name Sample subtask1 subtask2 All
Score / Max Score 0 / 0 200 / 200 0 / 300 0 / 200
Status
AC × 2
AC × 12
AC × 14
WA × 7
AC × 16
WA × 15
Set Name Test Cases
Sample sample_1.txt, sample_2.txt
subtask1 sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt
All sample_1.txt, sample_2.txt, sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt
Case Name Status Exec Time Memory
sample_1.txt AC 2 ms 384 KB
sample_2.txt AC 1 ms 256 KB
subtask_1_1.txt AC 2 ms 384 KB
subtask_1_10.txt AC 229 ms 15344 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_2.txt AC 47 ms 3704 KB
subtask_1_3.txt AC 465 ms 26604 KB
subtask_1_4.txt AC 7 ms 1152 KB
subtask_1_5.txt AC 8 ms 1152 KB
subtask_1_6.txt AC 114 ms 7156 KB
subtask_1_7.txt AC 462 ms 27756 KB
subtask_1_8.txt AC 7 ms 1152 KB
subtask_1_9.txt AC 14 ms 1536 KB
subtask_2_1.txt WA 473 ms 28140 KB
subtask_2_2.txt WA 475 ms 28268 KB
subtask_2_3.txt WA 472 ms 27500 KB
subtask_2_4.txt WA 472 ms 26476 KB
subtask_2_5.txt WA 16 ms 1152 KB
subtask_2_6.txt WA 35 ms 2044 KB
subtask_2_7.txt AC 129 ms 7156 KB
subtask_2_8.txt WA 473 ms 27372 KB
subtask_3_1.txt WA 771 ms 26604 KB
subtask_3_2.txt WA 769 ms 26860 KB
subtask_3_3.txt WA 318 ms 2432 KB
subtask_3_4.txt WA 327 ms 2596 KB
subtask_3_5.txt WA 540 ms 14960 KB
subtask_3_6.txt WA 662 ms 26092 KB
subtask_3_7.txt WA 787 ms 27244 KB
subtask_3_8.txt WA 778 ms 27628 KB