Submission #2369254
Source Code Expand
//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
//debug
#define DEBUG
#define DUMPOUT cout
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<" "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
void dump_func() {DUMPOUT << endl;};
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) DUMPOUT << " ";
else DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "[";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
os << "[";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
int n, m;
int q;
struct edge{int cost, u, v;};
vector<edge> edges;
bool comp(const edge& e1, const edge& e2) {
return e1.cost < e2.cost;
}
int ans[4000][4000];
struct UnionFind {
vector<int> par, rank;
vector<vector<int>> cmp;
UnionFind(int size) : par(size), rank(size), cmp(size)
{
rep(i, size) {
par[i] = i;
cmp[i].push_back(i);
}
}
int find_root(int x) {
if (par[x] != x) return par[x] = find_root(par[x]);
else return x;
}
bool same(int x, int y) {
return find_root(x) == find_root(y);
}
void unite(int x, int y, int c) {
int u = find_root(x);
int v = find_root(y);
for (auto uu : cmp[u]) {
for (auto vv : cmp[v]) {
ans[uu][vv] = c;
ans[vv][uu] = c;
}
}
if (rank[u] > rank[v]) swap(u, v);
par[u] = v;
for (auto uu : cmp[u]) cmp[v].push_back(uu);
if (rank[u] == rank[v]) rank[v]++;
}
};
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
edges.push_back({c, a, b});
}
sort(all(edges), comp);
UnionFind uf(n);
int sum_cost = 0LL;
rep(i, m) {
edge e = edges[i];
if (uf.same(e.u, e.v)) continue;
uf.unite(e.u, e.v, e.cost);
sum_cost += e.cost;
}
cin >> q;
rep(i, q) {
int s, t;
cin >> s >> t;
s--; t--;
cout << sum_cost - ans[s][t] << endl;
}
}
Submission Info
Submission Time |
|
Task |
A - Graph |
User |
roto_37 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4894 Byte |
Status |
AC |
Exec Time |
671 ms |
Memory |
138088 KB |
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
300 / 300 |
200 / 200 |
Status |
|
|
|
|
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 |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
subtask_1_1.txt |
AC |
2 ms |
2688 KB |
subtask_1_10.txt |
AC |
430 ms |
130540 KB |
subtask_1_11.txt |
AC |
1 ms |
256 KB |
subtask_1_2.txt |
AC |
377 ms |
126580 KB |
subtask_1_3.txt |
AC |
480 ms |
136168 KB |
subtask_1_4.txt |
AC |
395 ms |
125824 KB |
subtask_1_5.txt |
AC |
349 ms |
125760 KB |
subtask_1_6.txt |
AC |
389 ms |
127984 KB |
subtask_1_7.txt |
AC |
481 ms |
136040 KB |
subtask_1_8.txt |
AC |
392 ms |
125824 KB |
subtask_1_9.txt |
AC |
354 ms |
125948 KB |
subtask_2_1.txt |
AC |
496 ms |
135656 KB |
subtask_2_2.txt |
AC |
500 ms |
137064 KB |
subtask_2_3.txt |
AC |
499 ms |
136552 KB |
subtask_2_4.txt |
AC |
504 ms |
135016 KB |
subtask_2_5.txt |
AC |
397 ms |
125824 KB |
subtask_2_6.txt |
AC |
358 ms |
126200 KB |
subtask_2_7.txt |
AC |
385 ms |
127984 KB |
subtask_2_8.txt |
AC |
501 ms |
135272 KB |
subtask_3_1.txt |
AC |
663 ms |
138088 KB |
subtask_3_2.txt |
AC |
671 ms |
136552 KB |
subtask_3_3.txt |
AC |
565 ms |
127104 KB |
subtask_3_4.txt |
AC |
532 ms |
127100 KB |
subtask_3_5.txt |
AC |
584 ms |
132716 KB |
subtask_3_6.txt |
AC |
634 ms |
135144 KB |
subtask_3_7.txt |
AC |
667 ms |
137832 KB |
subtask_3_8.txt |
AC |
662 ms |
136296 KB |