oj.uz

Submission #978881

# Submission time Handle Problem Language Result Execution time Memory
978881 2024-05-09T23:39:24 Z lucas Race (IOI11_race) C++17
21 / 100
 1857 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define F0R(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i <= b; i++)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define FORd(i,a,b) for (int i = (b); i >= (a); i--)
#define trav(a, x) for (auto& a : x)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const char nl = '\n';
const int MAX_N = 100011;
const ll INF = (1<<29) + 123;
const ll MOD = 1000000007; // 998244353
const ld PI = 4*atan((ld)1);

template <typename T> bool ckmin(T& a, const T& b) { return a > b ? a=b, 1 : 0; }
template <typename T> bool ckmax(T& a, const T& b) { return b > a ? a=b, 1 : 0; }

/**** Credit to chatgpt 4.0 ****/

// Stream operator for std::pair
template<typename T1, typename T2>
ostream& operator<<(ostream &out, const pair<T1, T2> &v) {
    out << "(" << v.first << ", " << v.second << ")"; 
    return out;
}

// Trait to check if a type is iterable
template<typename T, typename = void>
struct is_iterable : false_type {};

template<typename T>
struct is_iterable<T, void_t<decltype(begin(declval<T>())), decltype(end(declval<T>()))>> : true_type {};

// Stream operator for iterable types excluding std::string
template<typename TT>
typename enable_if<is_iterable<TT>::value && !is_same<TT, string>::value, ostream&>::type
operator<<(ostream& out, const TT& c) {
    out << "{ ";
    for (const auto& x : c) out << x << " ";
    out << "}"; 
    return out;
}

template<typename T>
ostream& operator<<(ostream& out, std::stack<T> container) {
    std::vector<T> elements;
    while (!container.empty()) {
        elements.push_back(container.top());
        container.pop();
    }
    std::reverse(elements.begin(), elements.end()); // Reverse to maintain order
    return out << elements;
}

template<typename T>
ostream& operator<<(ostream& out, std::queue<T> container) {
    std::vector<T> elements;
    while (!container.empty()) {
        elements.push_back(container.front());
        container.pop();
    }
    return out << elements;
}

// Helper function to print std::priority_queue
template<typename T, typename Container, typename Compare>
ostream& operator<<(ostream& out, std::priority_queue<T, Container, Compare> pq) {
    out << "{";
    while (!pq.empty()) {
        out << " " << pq.top();
        pq.pop();
    }
    out << " }";
    return out;
}

#ifdef DBG
void dbg_out() { cerr << endl; }

template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
    cerr << ' ' << H;
    dbg_out(T...);
}

#define dbg(...) cerr << #__VA_ARGS__ << ":", dbg_out(__VA_ARGS__);
#define dbg_array(a, n) cerr << #a << ": { "; for(int i = 0; i < n; i++) cerr << a[i] << " "; cerr << "}\n";
#else
#define dbg(...)
#define dbg_array(a, n)
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MX = 2e5+5;

int n;
vpi adj[MX];
vector<bool> dead(MX, 0);
int subtree_size[MX];

int get_subtree_size(int node, int parent = -1) {
    if (dead[node]) {
        subtree_size[node] = 0;
        return 0;
    }
	int &res = subtree_size[node];
	res = 1;
	for (pi i : adj[node]) {
		if (i.f == parent) { continue; }
		res += get_subtree_size(i.f, node);
	}
	return res;
}

int get_centroid(int node, int parent = -1) {
    if (dead[node]) assert(0);
	for (pi i : adj[node]) {
		if (i.f == parent) { continue; }

		if (subtree_size[i.f] * 2 > subtree_size[node]) { return get_centroid(i.f, node); }
	}
	return node;
}

array<int, 3> dist[MX]; // dist, length, child root
vi comp;
void calc_dist(int node, int depth, int par, int d, int root = -1) {
    dbg("calc_dist", node, depth, par, d, root, dead[node]);
    if (dead[node]) return;
    comp.pb(node);
    dist[node] = {d, depth, root};
    trav(u, adj[node]) {
        if (u.f == par) continue;
        int newRoot = root;
        if (root == -1) newRoot = u.f;
        calc_dist(u.f, depth+1, node, d+u.s, newRoot);
    }
}

int k;
int ans = MX;
void solve(int node) {
    if (dead[node]) return;
    get_subtree_size(node);
    int cent = get_centroid(node);
    dbg(node, cent);
    // dfs on cent and store all the lengths
    comp.clear();
    calc_dist(cent, 0, -1, 0);
    dbg(comp);
    // now two sum the component
    map<int, vpi> cnt; // map from dist to pair of depth, childNode
    trav(v, comp) {
        if (v == cent) continue;
        dbg(dist[v][0], dist[v][1], dist[v][2])
        cnt[dist[v][0]].pb({dist[v][1], dist[v][2]});
    }
    trav(p, cnt) {
        sort(all(p.s));
        vpi tmp;
        int taken = -1;
        // find the first two not from the same childNode
        trav(x, p.s) {
            if (taken == -1) {
                tmp.pb(x);
                taken = x.s;
            } else if (taken != x.s) {
                tmp.pb(x);
                break;
            }
        }
        p.s = tmp;
        dbg(p.f, p.s);
    }
    // now two sum on this
    trav(p, cnt) {
        if (p.f == k) {
            ckmin(ans, p.s[0].f);
        }
        if (!cnt.count(k-p.f)) continue;
        trav(x, p.s) {
            trav(y, cnt[k-p.f]) {
                if (x.s != y.s) {
                    ckmin(ans, x.f+y.f);
                }
            }
        }
    }
    dbg("marking dead", cent);
    dead[cent] = 1;
    trav(u, adj[cent]) {
        solve(u.f);
    }
}

int best_path(int N, int K, int H[][2], int L[]) {
    n = N;
    k = K;
    F0R(i, N-1) {
        adj[H[i][0]].pb({H[i][1], L[i]});
        adj[H[i][1]].pb({H[i][0], L[i]});
    }
    solve(0);
    if (ans == MX) return -1;
    return ans;
}

// int main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(0); cout.tie(0);
//     int n, k; cin >> n >> k;
//     int H[n-1][2]; F0R(i, n-1) cin >> H[i][0] >> H[i][1];
//     int L[n-1]; F0R(i, n-1) cin >> L[i];
//     cout << best_path(n, k, H, L) << nl;
//     return 0;
// }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12120 KB Output is correct
9 Correct 3 ms 11960 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12184 KB Output is correct
15 Correct 3 ms 11868 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12120 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12120 KB Output is correct
9 Correct 3 ms 11960 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12184 KB Output is correct
15 Correct 3 ms 11868 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12120 KB Output is correct
19 Correct 2 ms 11868 KB Output is correct
20 Correct 2 ms 11864 KB Output is correct
21 Correct 4 ms 11936 KB Output is correct
22 Correct 5 ms 12380 KB Output is correct
23 Correct 5 ms 12796 KB Output is correct
24 Correct 4 ms 12124 KB Output is correct
25 Correct 4 ms 12124 KB Output is correct
26 Correct 4 ms 11952 KB Output is correct
27 Correct 4 ms 11868 KB Output is correct
28 Correct 5 ms 12380 KB Output is correct
29 Correct 4 ms 12124 KB Output is correct
30 Correct 4 ms 12324 KB Output is correct
31 Correct 4 ms 12244 KB Output is correct
32 Correct 4 ms 12124 KB Output is correct
33 Correct 7 ms 13404 KB Output is correct
34 Correct 12 ms 15196 KB Output is correct
35 Correct 17 ms 17244 KB Output is correct
36 Correct 30 ms 23388 KB Output is correct
37 Correct 21 ms 18776 KB Output is correct
38 Correct 14 ms 15464 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12120 KB Output is correct
9 Correct 3 ms 11960 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12184 KB Output is correct
15 Correct 3 ms 11868 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12120 KB Output is correct
19 Correct 497 ms 35516 KB Output is correct
20 Correct 347 ms 26320 KB Output is correct
21 Correct 334 ms 23408 KB Output is correct
22 Correct 179 ms 21708 KB Output is correct
23 Correct 255 ms 23088 KB Output is correct
24 Correct 123 ms 21044 KB Output is correct
25 Runtime error 1857 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12120 KB Output is correct
9 Correct 3 ms 11960 KB Output is correct
10 Correct 3 ms 12120 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12124 KB Output is correct
14 Correct 3 ms 12184 KB Output is correct
15 Correct 3 ms 11868 KB Output is correct
16 Correct 3 ms 12124 KB Output is correct
17 Correct 3 ms 12124 KB Output is correct
18 Correct 3 ms 12120 KB Output is correct
19 Correct 2 ms 11868 KB Output is correct
20 Correct 2 ms 11864 KB Output is correct
21 Correct 4 ms 11936 KB Output is correct
22 Correct 5 ms 12380 KB Output is correct
23 Correct 5 ms 12796 KB Output is correct
24 Correct 4 ms 12124 KB Output is correct
25 Correct 4 ms 12124 KB Output is correct
26 Correct 4 ms 11952 KB Output is correct
27 Correct 4 ms 11868 KB Output is correct
28 Correct 5 ms 12380 KB Output is correct
29 Correct 4 ms 12124 KB Output is correct
30 Correct 4 ms 12324 KB Output is correct
31 Correct 4 ms 12244 KB Output is correct
32 Correct 4 ms 12124 KB Output is correct
33 Correct 7 ms 13404 KB Output is correct
34 Correct 12 ms 15196 KB Output is correct
35 Correct 17 ms 17244 KB Output is correct
36 Correct 30 ms 23388 KB Output is correct
37 Correct 21 ms 18776 KB Output is correct
38 Correct 14 ms 15464 KB Output is correct
39 Correct 497 ms 35516 KB Output is correct
40 Correct 347 ms 26320 KB Output is correct
41 Correct 334 ms 23408 KB Output is correct
42 Correct 179 ms 21708 KB Output is correct
43 Correct 255 ms 23088 KB Output is correct
44 Correct 123 ms 21044 KB Output is correct
45 Runtime error 1857 ms 262144 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -