Submission #467811

#	Time	Username	Problem	Language	Result	Execution time	Memory
467811		Carmel_Ab1	Building Bridges (CEOI17_building)	C++17	0 / 100	3069 ms	27716 KiB

building

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
const ll MAX=1e12;
struct Seg{
    ll l=-1,r=-1,m=-1;
    Seg *lp,*rp;
    pl p1={MAX,MAX},p2={MAX,MAX};
    pl p3={-MAX,-MAX},p4={-MAX,-MAX};

    Seg(ll l,ll r):l(l),r(r),m((l+r)/2){
        if(l+1<r){
            lp=new Seg(l,m);
            rp=new Seg(m,r);
        }
    }

    void update(ll i,ll A,ll B){
        if(A<=p1.first)
            p1=min(p1,{A,B});
        if(B<=p2.second){
            if(B<p2.second)
                p2={A,B};
            else
                p2=min(p2,{A,B});
        }
        if(A>=p3.first)
            p3=max(p3,{A,B});
        if(B>=p4.second){
            if(B>p4.second)
                p4={A,B};
            else
                p4=max(p4,{A,B});
        }
        if(l+1==r)return;
        if(i<m)
            lp->update(i,A,B);
        else
            rp->update(i,A,B);
    }

    ll query(ll a,ll b,ll x){
        if(r<=a || b<=l)
            return 1e18;
        else if(a<=l && r<=b) {
            ll ans=1e18;
            for(pl p:{p1,p2,p3,p4})
                ans=min(ans,p.first+x*p.second);
            return ans;
        }
        ll ans=min(lp->query(a,b,x),rp->query(a,b,x));
        return ans;
    }
};
void solve() {
    ll n;
    cin >> n;
    vl a(n),w(n);
    read(a);
    read(w);

    Seg s(0,n+1);

    s.update(0,a[0]*a[0],a[0]);
    vl dp(n,1e18);
    dp[0]=0;
    vl pref(n);
    for(int i=0; i<n; i++)
        pref[i]=(i?pref[i-1]:0)+w[i];

    vl A(n),B(n);
    A[0]=a[0]*a[0];
    for(int i=0; i<n; i++)
        B[i]=a[i];
    for(int i=1; i<n; i++){
        ll mn=1e18;
        for(int j=0; j<i; j++)
            mn=min(mn,A[j]-(2*a[i]*B[j]));
        dp[i]=mn+pref[i-1]+a[i]*a[i];
        A[i]=dp[i]+a[i]*a[i]-pref[i];
    }


    //print(dp)
    out(dp[n-1])

}
/*
 6
3 8 7 1 6 6
0 -1 9 1 2 0
 */

Compilation message (stderr)

building.cpp: In function 'void usaco(std::string)':
building.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
building.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40