제출 #821209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821209		danikoynov	Sightseeing in Kyoto (JOI22_kyoto)	C++14	10 / 100	4 ms	324 KiB

kyoto

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
const int maxn = 1e3 + 10;
const ll inf = 1e18;
int h, w;
ll a[maxn], b[maxn], dp[maxn];
void solve()
{
    cin >> h >> w;
    for (int i = 1; i <= h; i ++)
        cin >> a[i];
    for (int i = 1; i <= w; i ++)
        cin >> b[i];

        for (int i = 1; i <= w; i ++)
            dp[i] = (ll)1 * (-a[1]);
            /**cout << "---------" << endl;
            for (int j = 1; j <= w; j ++)
            cout << dp[j] << " ";
        cout << endl;*/
         for (int j = 2; j <= w; j ++)
            dp[j] = min(dp[j], dp[j - 1]);
    for (int i = 2; i <= h; i ++)
    {

        /**for (int j = 1; j <= w; j ++)
            cout << dp[j] << " ";
        cout << endl;*/

        for (int j = 1; j <= w; j ++)
        {
            dp[j] += (ll)(j) * (a[i - 1] - a[i]) + b[j];
        }

        if (i != h)
                for (int j = 2; j <= w; j ++)
            dp[j] = min(dp[j], dp[j - 1]);

    }

    ll ans = inf;
    for (int j = 1; j <= w; j ++)
        ans = min(ans,  + w * a[h] + dp[j]);
    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

kyoto.cpp: In function 'void solve()':
kyoto.cpp:22:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   22 |     for (int i = 1; i <= w; i ++)
      |     ^~~
kyoto.cpp:25:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   25 |         for (int i = 1; i <= w; i ++)
      |         ^~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 60