Submission #998651


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M;
int A[404040],B[404040];
ll C[404040];
vector<pair<int,int>> E[4040];
int Q;
ll D[4040][4040];

template<int um> class UF {
	public:
	vector<int> par,rank;
	UF() {rank=vector<int>(um,0); for(int i=0;i<um;i++) par.push_back(i);}
	int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
	int operator()(int x,int y) {
		if((x=operator[](x))==(y=operator[](y))) return x;
		if(rank[x]>rank[y]) return par[x]=y;
		rank[x]+=rank[x]==rank[y]; return par[y]=x;
	}
};
UF<500000> uf;

void dfs(int st,int cur,int pre,int ma) {
	D[st][cur]=ma;
	FORR(e,E[cur]) if(e.first != pre) {
		dfs(st,e.first,cur,max(ma,e.second));
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	priority_queue<pair<int,int>> EE;
	FOR(i,M) {
		cin>>A[i]>>B[i]>>C[i], A[i]--, B[i]--;
		EE.push({-C[i],i});
	}
	
	ll tot=0;
	while(EE.size()) {
		auto e=EE.top();
		x = A[e.second];
		y = B[e.second];
		EE.pop();
		if(uf[x]!=uf[y]) {
			uf(x,y);
			E[x].push_back({y,-e.first});
			E[y].push_back({x,-e.first});
			tot+=-e.first;
		}
	}
	
	FOR(i,N) dfs(i,i,-1,0);
	
	cin>>M;
	FOR(i,M) {
		cin>>x>>y;
		cout<<tot-D[x-1][y-1]<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}

Submission Info

Submission Time
Task A - Graph
User kmjp
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1887 Byte
Status AC
Exec Time 1117 ms
Memory 141292 KB

Judge Result

Set Name Sample subtask1 subtask2 All
Score / Max Score 0 / 0 200 / 200 300 / 300 200 / 200
Status
AC × 2
AC × 12
AC × 21
AC × 29
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, 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 11 ms 4468 KB
sample_2.txt AC 11 ms 4468 KB
subtask_1_1.txt AC 12 ms 4848 KB
subtask_1_10.txt AC 565 ms 135408 KB
subtask_1_11.txt AC 11 ms 4468 KB
subtask_1_2.txt AC 505 ms 132080 KB
subtask_1_3.txt AC 662 ms 140140 KB
subtask_1_4.txt AC 454 ms 130928 KB
subtask_1_5.txt AC 485 ms 130928 KB
subtask_1_6.txt AC 523 ms 134000 KB
subtask_1_7.txt AC 666 ms 140140 KB
subtask_1_8.txt AC 438 ms 130928 KB
subtask_1_9.txt AC 496 ms 131056 KB
subtask_2_1.txt AC 678 ms 140140 KB
subtask_2_2.txt AC 666 ms 140140 KB
subtask_2_3.txt AC 670 ms 140140 KB
subtask_2_4.txt AC 677 ms 140140 KB
subtask_2_5.txt AC 450 ms 130928 KB
subtask_2_6.txt AC 524 ms 131440 KB
subtask_2_7.txt AC 542 ms 134000 KB
subtask_2_8.txt AC 672 ms 140140 KB
subtask_3_1.txt AC 1117 ms 141292 KB
subtask_3_2.txt AC 1108 ms 141292 KB
subtask_3_3.txt AC 893 ms 132208 KB
subtask_3_4.txt AC 940 ms 132336 KB
subtask_3_5.txt AC 1019 ms 136816 KB
subtask_3_6.txt AC 1068 ms 139116 KB
subtask_3_7.txt AC 1114 ms 141292 KB
subtask_3_8.txt AC 1115 ms 141292 KB