답안 #568699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568699	2022-05-26T05:38:25 Z	maomao90	Reconstruction Project (JOI22_reconstruction)	C++17	0 / 100	5000 ms	3372 KB

reconstruction

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXM = 100005;
const int MAXN = 505;

int n, m;
iii edges[MAXM];
int q;

int rp[MAXN], rnk[MAXN];
void init() {
    REP (i, 1, n + 1) {
        rnk[i] = 1;
        rp[i] = i;
    }
}
int findp(int i) {
    if (rp[i] == i) return i;
    return rp[i] = findp(rp[i]);
}
bool join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    if (pa == pb) return 0;
    if (rnk[pa] < rnk[pb]) swap(pa, pb);
    if (rnk[pa] == rnk[pb]) rnk[pa]++;
    rp[pb] = pa;
    return 1;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, m) {
        int a, b, w; cin >> a >> b >> w;
        edges[i] = {a, b, w};
    }
    cin >> q;
    while (q--) {
        int x; cin >> x;
        sort(edges, edges + m, [&] (iii l, iii r) {
                return abs(get<2>(l) - x) < abs(get<2>(r) - x);
                });
        init();
        int ans = 0;
        REP (i, 0, m) {
            auto [a, b, w] = edges[i];
            if (join(a, b)) {
                ans += abs(w - x);
            }
        }
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Incorrect	0 ms	324 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Incorrect	0 ms	324 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Execution timed out	5045 ms	3372 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-