Submission #348358

#	Time	Username	Problem	Language	Result	Execution time	Memory
348358		ACmachine	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	364 KiB

shortcut

#include "shortcut.h"

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}


long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    vll x(n);
    x[0] = 0;
    REP(i, n - 1){
        x[i + 1] = x[i] + l[i];
    }
    auto check = [&](ll M){
        array<ll, 4> C; // conditions
        fill(all(C), INFF);
        REP(i, n){
            FOR(j, i + 1, n, 1){
                if(x[j] - x[i] + d[i] + d[j] <= M) continue;
                ll val = d[i] + d[j] + c;
                // |x[i] - a| + |x[j] - b| + d[i] + d[j] + c <= M
                // x[i] - a + x[j] - b + val <= M; -a -b <= M - val - x[i] - x[j]; 
                // a - x[i] + x[j] - b + val <= M; a - b <= x[i] - x[j] - val + M;
                // x[i] - a + b - x[j] + val <= M; b - a <= x[j] - x[i] - val + M;
                // a - x[i] + b - x[j] + val <= M; a + b <= M - val + x[i] + x[j]
                C[0] = min(C[0], M - val - x[i] - x[j]);
                C[1] = min(C[1], x[i] - x[j] - val + M);
                C[2] = min(C[2], x[j] - x[i] - val + M);
                C[3] = min(C[3], M - val + x[i] + x[j]);
            }
        }  
        REP(i, n){
            REP(j, n){
                if(i == j) continue;
                if((-x[i] - x[j]) <= C[0] && (x[i] - x[j]) <= C[1] && (x[j] - x[i]) <= C[2] && (x[i] + x[j]) <= C[3]) 
                    return true;
            }
        }
        return false;
    };
    ll L = 0, R = 7e15;
    ll ans = INFF;
    while(L <= R){
        ll M = (L + R) >> 1;
        if(check(M)){
            ans = min(ans, M);
            R = M - 1;
        }
        else{
            L = M + 1;
        }
    }    
    return ans;
    //return 0;
}

• 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