oj.uz

Submission #976653

# Submission time Handle Problem Language Result Execution time Memory
976653 2024-05-07T00:25:40 Z phcbaka Relay Marathon (NOI20_relaymarathon) C++17
17 / 100
 160 ms 7588 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
using ii = pair <int, int>;

int n, m, k;


void read()
{
    cin >> n >> m >> k;
}

struct vet
{
    bool spec[511] = {false};
    int a[511][511];
    ii dp[511][511];

    void calc()
    {
        memset(a, 0x3f3f, sizeof(a));
        for (int i = 1; i <= n; ++i) a[i][i] = 0;

        for (int i = 1; i <= m; ++i)
        {
            int u, v, L;
            cin >> u >> v >> L;
            a[u][v] = min(a[u][v], L);
            a[v][u] = min(a[v][u], L);
        }

        for (int i = 1; i <= k; ++i)
        {
            int u;
            cin >> u;
            spec[u] = 1;
        }

        for (int k = 1; k <= n; ++k)
            for (int i = 1; i <= n; ++i)
                for (int j = 1; j <= n; ++j)
                    a[i][j] = min(a[i][j], a[i][k]+a[k][j]);

        for (int i = 1; i <= n; ++i)
        {
            for (int j = 1; j <= n; ++j)
                if (spec[i] == 0 or spec[j] == 0 or i == j)
                {
                    dp[i][j] = ii(1e9, j);
                }
                else dp[i][j] = ii(a[i][j], j);

            sort (dp[i]+1, dp[i]+n+1);
        }

        int ans = LLONG_MAX;

        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                for (int t = 1; t <= min(5ll, n); ++t)
                    for (int c = 1; c <= min(5ll, n); ++c)
                        if (i != j and i != dp[i][t].second and i != dp[j][c].second
                            and j != dp[i][t].second and j != dp[j][c].second
                            and dp[i][t].second != dp[j][c].second)
                        {
                            ans = min(ans, dp[i][t].first + dp[j][c].first);
                        }

        cout << ans;
        exit(0);
    }
}Vetcan;

signed main()
{
    cin.tie(0)->sync_with_stdio(0);

    #define task "cities"
    if (fopen(task ".inp", "r"))
    {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }

    read ();

    if (n <= 500)
    {
        Vetcan.calc();
    }

    return 0;
}

Compilation message

RelayMarathon.cpp: In function 'int main()':
RelayMarathon.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen(task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
RelayMarathon.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen(task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6744 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6572 KB Output is correct
30 Correct 2 ms 6488 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6744 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6572 KB Output is correct
30 Correct 2 ms 6488 KB Output is correct
31 Correct 120 ms 6572 KB Output is correct
32 Correct 120 ms 6576 KB Output is correct
33 Correct 122 ms 6492 KB Output is correct
34 Correct 117 ms 6488 KB Output is correct
35 Correct 129 ms 6744 KB Output is correct
36 Correct 128 ms 6492 KB Output is correct
37 Correct 130 ms 6640 KB Output is correct
38 Correct 120 ms 6744 KB Output is correct
39 Correct 130 ms 7208 KB Output is correct
40 Correct 125 ms 6760 KB Output is correct
41 Correct 117 ms 6644 KB Output is correct
42 Correct 160 ms 6748 KB Output is correct
43 Correct 124 ms 6744 KB Output is correct
44 Correct 115 ms 6576 KB Output is correct
45 Correct 128 ms 6568 KB Output is correct
46 Correct 148 ms 7332 KB Output is correct
47 Correct 141 ms 6708 KB Output is correct
48 Correct 134 ms 7256 KB Output is correct
49 Correct 137 ms 7332 KB Output is correct
50 Correct 116 ms 6492 KB Output is correct
51 Correct 125 ms 6580 KB Output is correct
52 Correct 126 ms 6488 KB Output is correct
53 Correct 125 ms 7072 KB Output is correct
54 Correct 130 ms 7328 KB Output is correct
55 Correct 118 ms 6488 KB Output is correct
56 Correct 120 ms 6488 KB Output is correct
57 Correct 120 ms 6492 KB Output is correct
58 Correct 141 ms 7588 KB Output is correct
59 Correct 122 ms 6568 KB Output is correct
60 Correct 124 ms 6492 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 2 ms 6744 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6572 KB Output is correct
30 Correct 2 ms 6488 KB Output is correct
31 Correct 120 ms 6572 KB Output is correct
32 Correct 120 ms 6576 KB Output is correct
33 Correct 122 ms 6492 KB Output is correct
34 Correct 117 ms 6488 KB Output is correct
35 Correct 129 ms 6744 KB Output is correct
36 Correct 128 ms 6492 KB Output is correct
37 Correct 130 ms 6640 KB Output is correct
38 Correct 120 ms 6744 KB Output is correct
39 Correct 130 ms 7208 KB Output is correct
40 Correct 125 ms 6760 KB Output is correct
41 Correct 117 ms 6644 KB Output is correct
42 Correct 160 ms 6748 KB Output is correct
43 Correct 124 ms 6744 KB Output is correct
44 Correct 115 ms 6576 KB Output is correct
45 Correct 128 ms 6568 KB Output is correct
46 Correct 148 ms 7332 KB Output is correct
47 Correct 141 ms 6708 KB Output is correct
48 Correct 134 ms 7256 KB Output is correct
49 Correct 137 ms 7332 KB Output is correct
50 Correct 116 ms 6492 KB Output is correct
51 Correct 125 ms 6580 KB Output is correct
52 Correct 126 ms 6488 KB Output is correct
53 Correct 125 ms 7072 KB Output is correct
54 Correct 130 ms 7328 KB Output is correct
55 Correct 118 ms 6488 KB Output is correct
56 Correct 120 ms 6488 KB Output is correct
57 Correct 120 ms 6492 KB Output is correct
58 Correct 141 ms 7588 KB Output is correct
59 Correct 122 ms 6568 KB Output is correct
60 Correct 124 ms 6492 KB Output is correct
61 Incorrect 2 ms 6232 KB Output isn't correct
62 Halted 0 ms 0 KB -