oj.uz

Submission #477273

# Submission time Handle Problem Language Result Execution time Memory
477273 2021-10-01T14:26:06 Z AkiYuu Building Bridges (CEOI17_building) C++17
60 / 100
 3000 ms 7568 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define forw(i,a,b) for(ll i=a;i<=b;i++)
#define forb(i,a,b) for(ll i=a;i>=b;i--)
typedef long long int ll;
ll res,n,h[200005],w[200005],max1[200005],pre,dp[200005];
void sub1()
{
    for (int i=2;i<=n;i++)
    {
        max1[i]=1e18;
        res=0;
        for (int j=i-1;j>=1;j--)
            {
                ll p=(h[i]-h[j])*(h[i]-h[j])+res+max1[j];
                if (p<max1[i]) max1[i]=p;
                res+=w[j];
            }
    }
    cout<<max1[n];
}
ll sqr(ll a)
{
    return a*a;
}
void sub2()
{
    ll ans=1e18;
    ans=(h[n]-h[1])*(h[n]-h[1])+pre-w[1]-w[n];
    map<int, set<int> > save;
    forw(i,2,n-1)
    {
        forw(j,-20,20)
        if (save[j].size())
        { 
            auto it =save[j].lower_bound((h[i]+h[1])/2);
            ans=min(ans,sqr(h[1]-h[i])+sqr(h[i]-h[n])+pre-w[1]-w[i]-w[n]);
            if (it!=save[j].end())
            {
                ans=min(ans,sqr(h[1]-(*it))+sqr((*it)-h[i])+sqr(h[n]-h[i])+pre-w[1]-w[i]-w[n]-j);
            }
            if (it!=save[j].begin())
            {
                --it;
                ans=min(ans,sqr(h[1]-(*it))+sqr((*it)-h[i])+sqr(h[n]-h[i])+pre-w[1]-w[i]-w[n]-j);
            }
        }
        save[w[i]].insert(h[i]);
    }
    cout<<ans<<endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    scanf("%lld",&n);
    for (int i=1;i<=n;i++)
        scanf("%lld",&h[i]);
    bool ok=true;
    for (int i=1;i<=n;i++)
    {
        scanf("%lld",&w[i]);
        pre+=w[i];
        if (abs(w[i])>20) ok=false;
    }
    if (!ok)sub1();
    else sub2();
    //sub2();
    return 0;
}
// sub1 : n<=1000 , w lớn => vét n^2, gọi dp[i] là giá trị nhỏ nhất xây cầu từ 1-> n
// sub2 : n lớn, abs(w) <=20 , chỉ cần chọn 2 cột giữa 1 và n
//          => for theo w và chọn cột có chiều cao tối ưu giữa i và 1
//          => chọn cột có chiều cao gần với (h[i]+h[1])/2 nhất

Compilation message

building.cpp: In function 'int main()':
building.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
building.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         scanf("%lld",&h[i]);
      |         ~~~~~^~~~~~~~~~~~~~
building.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         scanf("%lld",&w[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 670 ms 4652 KB Output is correct
2 Correct 678 ms 5700 KB Output is correct
3 Correct 668 ms 5808 KB Output is correct
4 Correct 117 ms 3060 KB Output is correct
5 Correct 565 ms 7568 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 670 ms 4652 KB Output is correct
7 Correct 678 ms 5700 KB Output is correct
8 Correct 668 ms 5808 KB Output is correct
9 Correct 117 ms 3060 KB Output is correct
10 Correct 565 ms 7568 KB Output is correct
11 Execution timed out 3064 ms 3680 KB Time limit exceeded
12 Halted 0 ms 0 KB -