Submission #3316562
Source Code Expand
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)
int n;
int m;
struct edge { int from, to, cost; };
struct edge2 { LL to, cost; };
typedef pair<int, int> PP;
vector<edge> e;
vector<edge2> G[4040];
int Par[100000];
int Rank[100000];
void init(int n) {
for (int i = 0; i < n; i++) {
Par[i] = i;
Rank[i] = 0;
}
}
int find(int x) {
if (Par[x] == x) {
return x;
}
else {
return Par[x] = find(Par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (Rank[x] < Rank[y]) {
Par[x] = y;
}
else {
Par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
// ソート時に比較するための関数
bool comp(const edge& e1, const edge& e2) {
return e1.cost < e2.cost;
}
LL kruskal() {
init(n);
sort(e.begin(), e.end(), comp);
LL ans = 0;
for (int i = 0; i < m; i++) {
if (!same(e[i].from, e[i].to)) {
unite(e[i].from, e[i].to);
G[e[i].from].emplace_back(edge2{ e[i].to,e[i].cost });
G[e[i].to].emplace_back(edge2{ e[i].from,e[i].cost });
ans += e[i].cost;
}
}
return ans;
}
LL ans[4040][4040];
int main() {
cin >> n >> m;
REP(i, m) {
int a, b, c;
cin >> a >> b >> c;
a--, b--;
e.emplace_back(edge{ a,b,c });
}
LL num = kruskal();
REP(i, n) {
stack<pair<int, int>> q;
q.push(make_pair(i, -1));
while (!q.empty()) {
pair<int, int> cur = q.top();
q.pop();
REP(j, G[cur.first].size()) {
if (G[cur.first][j].to != cur.second) {
ans[i][G[cur.first][j].to] = max(ans[i][cur.first], G[cur.first][j].cost);
q.push(make_pair(G[cur.first][j].to, cur.first));
}
}
}
}
int q;
cin >> q;
REP(qqq, q) {
int s, t;
cin >> s >> t;
s--, t--;
cout << num - ans[s][t] << endl;
}
}
Submission Info
Submission Time |
|
Task |
A - Graph |
User |
M3_cp |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
3301 Byte |
Status |
AC |
Exec Time |
1130 ms |
Memory |
134508 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 |
384 KB |
sample_2.txt |
AC |
1 ms |
384 KB |
subtask_1_1.txt |
AC |
3 ms |
2688 KB |
subtask_1_10.txt |
AC |
701 ms |
130288 KB |
subtask_1_11.txt |
AC |
1 ms |
384 KB |
subtask_1_2.txt |
AC |
553 ms |
127992 KB |
subtask_1_3.txt |
AC |
908 ms |
132204 KB |
subtask_1_4.txt |
AC |
484 ms |
127616 KB |
subtask_1_5.txt |
AC |
534 ms |
127616 KB |
subtask_1_6.txt |
AC |
599 ms |
128756 KB |
subtask_1_7.txt |
AC |
911 ms |
132204 KB |
subtask_1_8.txt |
AC |
479 ms |
127616 KB |
subtask_1_9.txt |
AC |
538 ms |
127680 KB |
subtask_2_1.txt |
AC |
908 ms |
132972 KB |
subtask_2_2.txt |
AC |
903 ms |
132332 KB |
subtask_2_3.txt |
AC |
908 ms |
133228 KB |
subtask_2_4.txt |
AC |
910 ms |
133356 KB |
subtask_2_5.txt |
AC |
490 ms |
127616 KB |
subtask_2_6.txt |
AC |
542 ms |
127868 KB |
subtask_2_7.txt |
AC |
617 ms |
128756 KB |
subtask_2_8.txt |
AC |
927 ms |
132204 KB |
subtask_3_1.txt |
AC |
1114 ms |
134508 KB |
subtask_3_2.txt |
AC |
1124 ms |
133356 KB |
subtask_3_3.txt |
AC |
699 ms |
129024 KB |
subtask_3_4.txt |
AC |
755 ms |
128960 KB |
subtask_3_5.txt |
AC |
924 ms |
131056 KB |
subtask_3_6.txt |
AC |
1067 ms |
133612 KB |
subtask_3_7.txt |
AC |
1130 ms |
133612 KB |
subtask_3_8.txt |
AC |
1115 ms |
133740 KB |