답안 #990819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990819	2024-05-31T12:27:55 Z	stdfloat	꿈 (IOI13_dreaming)	C++17	14 / 100	32 ms	18524 KB

dreaming

#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

#define ff  first
#define ss  second
#define pii pair<int, int>

int cnt;

vector<int> v, u, vis;

vector<pii> a;

vector<vector<pii>> E;

int dfsv(int x, int p = -1) {
    for (auto [i, w] : E[x])
        if (i != p) v[x] = max(v[x], w + dfsv(i, x));

    return v[x];
}

void dfsu(int x) {
    vis[x] = cnt;

    for (auto [i, w] : E[x])
        if (!vis[i]) a.push_back({w + v[i], i});

    sort(a.rbegin(), a.rend());

    for (auto [i, w] : E[x])
        if (!vis[i]) u[i] = w + max(u[x], (a[0].ss != i ? a[0].ff : (1 < (int)a.size() ? a[1].ff : 0)));

    a.clear();
    for (auto [i, w] : E[x])
        if (!vis[i]) dfsu(i);
}

int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
    E.assign(n, {});
    for (int i = 0; i < m; i++) {
        E[A[i]].push_back({B[i], T[i]});
        E[B[i]].push_back({A[i], T[i]});
    }

    vis.assign(n, 0);
    v.assign(n, 0); u.assign(n, 0);
    for (int i = 0; i < n; i++) {
        if (!vis[i]) {
            cnt++;
            dfsv(i); dfsu(i);
        }
    }

    int mx = 0;
    vector<int> mn(n, INT_MAX);
    for (int i = 0; i < n; i++) {
        mx = max({mx, v[i], u[i]});
        mn[vis[i]] = min(mn[vis[i]], max(v[i], u[i]));
    }

    sort(mn.begin(), mn.end());
    while (mn.back() == INT_MAX) mn.pop_back();
    reverse(mn.begin(), mn.end());

    set<int> s(vis.begin(), vis.end());
    assert((int)s.size() == 2);

    if (1 < (int)mn.size()) mx = max(mx, mn[0] + L + mn[1]);
    if (2 < (int)mn.size()) mx = max(mx, mn[1] + (L << 1) + mn[2]);

    return mx;
}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	13396 KB	Output is correct
2	Correct	30 ms	12884 KB	Output is correct
3	Correct	22 ms	10840 KB	Output is correct
4	Correct	5 ms	2140 KB	Output is correct
5	Correct	4 ms	1416 KB	Output is correct
6	Correct	9 ms	3164 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	17 ms	5896 KB	Output is correct
9	Correct	22 ms	8796 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	30 ms	9820 KB	Output is correct
12	Correct	32 ms	11528 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	360 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Incorrect	348 KB	Output isn't correct
16	Halted	0 KB	-

Subtask #3
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	13396 KB	Output is correct
2	Correct	30 ms	12884 KB	Output is correct
3	Correct	22 ms	10840 KB	Output is correct
4	Correct	5 ms	2140 KB	Output is correct
5	Correct	4 ms	1416 KB	Output is correct
6	Correct	9 ms	3164 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	17 ms	5896 KB	Output is correct
9	Correct	22 ms	8796 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	30 ms	9820 KB	Output is correct
12	Correct	32 ms	11528 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	360 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Incorrect	0 ms	348 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	30 ms	18524 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	360 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Incorrect	348 KB	Output isn't correct
16	Halted	0 KB	-

Subtask #6
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	13396 KB	Output is correct
2	Correct	30 ms	12884 KB	Output is correct
3	Correct	22 ms	10840 KB	Output is correct
4	Correct	5 ms	2140 KB	Output is correct
5	Correct	4 ms	1416 KB	Output is correct
6	Correct	9 ms	3164 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	17 ms	5896 KB	Output is correct
9	Correct	22 ms	8796 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	30 ms	9820 KB	Output is correct
12	Correct	32 ms	11528 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	360 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Incorrect	0 ms	348 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

답안 #990819

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 0 / 10.0

Subtask #3 0 / 23.0

Subtask #4 0 / 18.0

Subtask #5 0 / 12.0

Subtask #6 0 / 23.0

Subtask #1
14.0 / 14.0

Subtask #2
0 / 10.0

Subtask #3
0 / 23.0

Subtask #4
0 / 18.0

Subtask #5
0 / 12.0

Subtask #6
0 / 23.0