oj.uz

Submission #575508

# Submission time Handle Problem Language Result Execution time Memory
575508 2022-06-10T19:49:46 Z Elias Shortcut (IOI16_shortcut) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>

#ifndef _DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include "shortcut.h"
#endif

using namespace std;

vector<vector<pair<int, int>>> adj;

vector<int> dijkstra(int s)
{
    vector<int> dist(adj.size(), -1);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, s});

    while (!pq.empty())
    {
        auto [d, i] = pq.top();
        pq.pop();

        if (dist[i] != -1)
            continue;

        dist[i] = d;

        for (auto [c, p] : adj[i])
        {
            if (dist[c] == -1)
                pq.push({d + p, c});
        }
    }

    return dist;
}

long long dia()
{
    vector<int> dists;
    dists = dijkstra(0);

    dists = dijkstra(max_element(dists.begin(), dists.end()) - dists.begin());

    return *max_element(dists.begin(), dists.end());
}

long long find_shortcut(int n, vector<int> l, vector<int> d, int c)
{
    adj = vector<vector<pair<int, int>>>(2 * n);

    for (int i = 0; i < n - 1; i++)
    {
        adj[i].push_back({i + 1, l[i]});
        adj[i + 1].push_back({i, l[i]});
    }

    for (int i = 0; i < n; i++)
    {
        adj[i].push_back({i + n, d[i]});
        adj[i + n].push_back({i, d[i]});
    }

    long long best = dia();

    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
        {
            adj[i].push_back({j, c});
            adj[j].push_back({i, c});

            best = min(best, dia());

            adj[i].pop_back();
            adj[j].pop_back();
        }

    return best;
}

#ifdef _DEBUG

int main()
{
    int n, c;
    cin >> n >> c;

    vector<int> l(n - 1);
    vector<int> d(n);

    for (int &x : l)
        cin >> x;

    for (int &x : d)
        cin >> x;

    cout << plan_roller_coaster(n, l, d, c);
}

#endif

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 4, 80 is a correct answer
2 Incorrect 0 ms 212 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -