Submission #996812
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
using namespace std;
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cerr << #v << ": " << v << endl)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))
template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
class UnionFind
{
private:
vector<int> data;
int _groups;
public:
int n;
UnionFind(int n) : data(n, -1), _groups(n), n(n) { }
void unite(int x, int y)
{
x = root(x), y = root(y);
if (x != y)
{
--_groups;
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
}
bool same(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
int groups() const { return _groups; }
};
int main() {
fast_io();
int n, m;
cin >> n >> m;
vector<pair<int, pint>> es;
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
es.push_back(make_pair(c, pint(a, b)));
}
sort(all(es));
vector<pair<int, pint>> good_es;
{
UnionFind uf(n);
for (auto& e : es) {
int a, b;
tie(a, b) = e.second;
if (!uf.same(a, b)) {
uf.unite(a, b);
good_es.push_back(e);
}
}
}
int q;
cin >> q;
rep(qi, q) {
int s, t;
cin >> s >> t;
--s, --t;
UnionFind uf(n);
uf.unite(s, t);
ll cost = 0;
for (auto& e : good_es) {
int c = e.first;
int a, b;
tie(a, b) = e.second;
if (!uf.same(a, b)) {
uf.unite(a, b);
cost += c;
}
}
cout << cost << endl;
}
}
Submission Info
Submission Time |
|
Task |
A - Graph |
User |
takapt |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
4924 Byte |
Status |
TLE |
Exec Time |
3154 ms |
Memory |
6512 KB |
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
300 / 300 |
0 / 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, 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 |
256 KB |
sample_2.txt |
AC |
3 ms |
256 KB |
subtask_1_1.txt |
AC |
3 ms |
256 KB |
subtask_1_10.txt |
AC |
73 ms |
3444 KB |
subtask_1_11.txt |
AC |
3 ms |
256 KB |
subtask_1_2.txt |
AC |
17 ms |
1148 KB |
subtask_1_3.txt |
AC |
144 ms |
6512 KB |
subtask_1_4.txt |
AC |
4 ms |
384 KB |
subtask_1_5.txt |
AC |
4 ms |
512 KB |
subtask_1_6.txt |
AC |
37 ms |
1912 KB |
subtask_1_7.txt |
AC |
144 ms |
6512 KB |
subtask_1_8.txt |
AC |
4 ms |
384 KB |
subtask_1_9.txt |
AC |
6 ms |
512 KB |
subtask_2_1.txt |
AC |
340 ms |
6512 KB |
subtask_2_2.txt |
AC |
338 ms |
6512 KB |
subtask_2_3.txt |
AC |
341 ms |
6512 KB |
subtask_2_4.txt |
AC |
339 ms |
6512 KB |
subtask_2_5.txt |
AC |
190 ms |
512 KB |
subtask_2_6.txt |
AC |
204 ms |
832 KB |
subtask_2_7.txt |
AC |
232 ms |
1912 KB |
subtask_2_8.txt |
AC |
337 ms |
6512 KB |
subtask_3_1.txt |
TLE |
3154 ms |
6512 KB |
subtask_3_2.txt |
TLE |
3154 ms |
6512 KB |
subtask_3_3.txt |
TLE |
3154 ms |
1152 KB |
subtask_3_4.txt |
TLE |
3154 ms |
1088 KB |
subtask_3_5.txt |
TLE |
3154 ms |
3444 KB |
subtask_3_6.txt |
TLE |
3154 ms |
6512 KB |
subtask_3_7.txt |
TLE |
3154 ms |
6512 KB |
subtask_3_8.txt |
TLE |
3154 ms |
6512 KB |