oj.uz

답안 #409504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409504 2021-05-21T01:30:22 Z rrrr10000 Building Bridges (CEOI17_building) C++14
100 / 100
 108 ms 9404 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
struct Line{
    ll a,b;
    Line(ll A,ll B):a(A),b(B){}
    ll get(ll x){return a*x+b;}
};
class LiChaoTree{
    bool comp(ll a,ll b){
        return a<b;
    }
    ll g=inf;
public:
    vi srtx;
    vector<Line> seg;
    ll N;
    LiChaoTree(vi alx){
        srtx=alx;
        dupli(srtx);
        N=1;
        while(N<srtx.size())N*=2;
        while(srtx.size()<N)srtx.pb(srtx.back());
        seg=vector<Line>(N*2-1,Line(0,g));
    }
    void addline(Line t,ll k=0,ll l=0,ll r=-1){
        if(r==-1)r=N;
        ll L=srtx[l],R=srtx[r-1],MD=srtx[(l+r)/2];
        if(comp(t.get(MD),seg[k].get(MD)))swap(t,seg[k]);
        if(comp(t.get(L),seg[k].get(L)))addline(t,k*2+1,l,(l+r)/2);
        else if(comp(t.get(R),seg[k].get(R)))addline(t,k*2+2,(l+r)/2,r);
    }
    ll solve(ll x){
        ll k=lb(srtx,x)+N-1,res=seg[k].get(x);
        while(k){
            k=(k-1)/2;
            if(comp(seg[k].get(x),res))res=seg[k].get(x);
        }
        return res;
    }
};
int main(){
    ll n;cin>>n;
    vi h(n),v(n);rep(i,n)cin>>h[i];rep(i,n)cin>>v[i];
    vi dp(n);
    LiChaoTree cht(h);
    dp[0]=-v[0];cht.addline(Line(-2*h[0],dp[0]+h[0]*h[0]));
    REP(i,1,n){
        dp[i]=cht.solve(h[i])+h[i]*h[i]-v[i];
        cht.addline(Line(-2*h[i],dp[i]+h[i]*h[i]));
    }
    ll ans=dp[n-1];
    rep(i,n)ans+=v[i];
    out(ans);
}

Compilation message

building.cpp: In constructor 'LiChaoTree::LiChaoTree(vi)':
building.cpp:68:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         while(N<srtx.size())N*=2;
      |               ~^~~~~~~~~~~~
building.cpp:69:26: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   69 |         while(srtx.size()<N)srtx.pb(srtx.back());
      |               ~~~~~~~~~~~^~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 5428 KB Output is correct
2 Correct 91 ms 5416 KB Output is correct
3 Correct 107 ms 5420 KB Output is correct
4 Correct 81 ms 5172 KB Output is correct
5 Correct 91 ms 9376 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 99 ms 5428 KB Output is correct
7 Correct 91 ms 5416 KB Output is correct
8 Correct 107 ms 5420 KB Output is correct
9 Correct 81 ms 5172 KB Output is correct
10 Correct 91 ms 9376 KB Output is correct
11 Correct 108 ms 7348 KB Output is correct
12 Correct 105 ms 7212 KB Output is correct
13 Correct 81 ms 5304 KB Output is correct
14 Correct 107 ms 7348 KB Output is correct
15 Correct 81 ms 9404 KB Output is correct
16 Correct 79 ms 9396 KB Output is correct
17 Correct 65 ms 5160 KB Output is correct
18 Correct 65 ms 5156 KB Output is correct