Submission #66138

#	Time	Username	Problem	Language	Result	Execution time	Memory
66138		Eae02	Shortcut (IOI16_shortcut)	C++14	0 / 100	3 ms	432 KiB

shortcut

#include "shortcut.h"

#include <bits/stdc++.h>

using ll = long long;

std::vector<ll> distBefore;

ll mainLineDist(int a, int b)
{
    if (a > b)
        std::swap(a, b);
    if (a == b)
        return 0;
    return distBefore[b - 1] - ((a == 0) ? 0 : distBefore[a - 1]);
}

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    distBefore.resize(n - 1);
    ll distAcc = 0;
    for (int i = 0; i < l.size(); i++)
    {
        distAcc += l[i];
        distBefore[i] = distAcc;
    }
    
    ll ans = INT64_MAX;
    
    ll md0 = 0;
    for (ll u = 0; u < n; u++)
    {
        for (ll v = u + 1; v < n; v++)
        {
            ll e = d[u] + d[v];
            ll minThis = INT64_MAX;
            minThis = std::min(minThis, mainLineDist(u, v) + e);
            md0 = std::max(md0, minThis);
        }
    }
    ans = std::min(ans, md0);
    
    for (ll a = 0; a < n; a++)
    {
        for (ll b = a + 2; b < n; b++)
        {
            ll md = 0;
            
            for (ll u = 0; u < n; u++)
            {
                for (ll v = u + 1; v < n; v++)
                {
                    ll e = d[u] + d[v];
                    ll minThis = INT64_MAX;
                    minThis = std::min(minThis, mainLineDist(u, v) + e);
                    minThis = std::min(minThis, mainLineDist(u, a) + mainLineDist(v, b) + e + c);
                    minThis = std::min(minThis, mainLineDist(u, b) + mainLineDist(v, a) + e + c);
                    md = std::max(md, minThis);
                }
            }
            
            ans = std::min(ans, md);
        }
    }
    
    return ans;
}

Compilation message (stderr)

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < l.size(); i++)
                     ~~^~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3