Submission #1233024

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233024		Lemser	Shortcut (IOI16_shortcut)	C++20	31 / 100	2095 ms	416 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
 
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
 
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i, l, r) for (auto i = l; i < r; i++)
#define fo(i, n) fore (i, 0, n)
#define forex(i, r, l) for (auto i = r-1; i >= l; i--)
#define ffo(i, n) forex (i, n, 0)
 
bool cmin(ll &a, ll b) { if (b < a) { a=b; return 1; } return 0; }
bool cmax(ll &a, ll b) { if (b > a) { a=b; return 1; } return 0; }
 
const ll INF = 1e18;

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
    vll pf(n, 0);
    fore (i, 1, n) pf[i] = pf[i-1] + l[i-1]; 
    ll ans = INF;
    fo (l, n) {
        fore (r, l+1, n) {
            ll mx = 0;
            fo (i, n) {
                fore (j, i+1, n) {
                    mx = max(mx, min(abs(pf[j] - pf[i]), abs(pf[l] - pf[i]) + c + abs(pf[r] - pf[j])) + d[i] + d[j]);
                }
            }
            ans = min(ans, mx);
        }
    }
    return ans;
}

Compilation message (stderr)

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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