제출 #757273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757273		Seb	Shortcut (IOI16_shortcut)	C++17	23 / 100	2083 ms	340 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define f first
#define s second

const ll MAXN = 3e3+5;
const ll INF = 1e15;

vector <int> L,D;
ll C,dist[MAXN],ans = INF;

void diametro(ll a, ll b, ll n) {
    ll di = 0;
    for (int i=1;i<n;i++) {
        for (int j=0;j<i;j++) {
            ll aux = abs(dist[i]-dist[j]);
            aux = min(aux , abs(dist[a] - dist[j]) + abs(dist[i] - dist[b]) + C);
            di = max(aux + D[i] + D[j] , di);
        }
    }
    ans = min(ans,di);
    return;
}

void bruta(ll n) {
    for (int i=1;i<n;i++)
        for (int j=0;j<i;j++)
            diametro(j,i,n);
    return;
}

void crea(ll n) {
    dist[0] = 0;
    for (int i=1;i<n;i++) dist[i] = dist[i-1] + L[i-1];
    return;
}

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
    swap(l,L);
    swap(d,D);
    C = c;
    crea(n);
    bruta(n);
    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 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