Submission #706552

#	Time	Username	Problem	Language	Result	Execution time	Memory
706552		becaido	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	2029 ms	1096 KiB

kyoto

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const ll INF = 1e18;
const int SIZE = 1e5 + 5;

int n, m;
int a[SIZE], b[SIZE];
ll dp[2][SIZE];

void solve() {
    cin >> n >> m;
    FOR (i, 1, n) cin >> a[i];
    FOR (i, 1, m) cin >> b[i];
    FOR (i, 1, n) FOR (j, 1, m) {
        dp[i & 1][j] = INF;
        if (i == 1 && j == 1) {
            dp[i & 1][j] = 0;
            continue;
        }
        if (i > 1) dp[i & 1][j] = min(dp[i & 1][j], dp[!(i & 1)][j] + b[j]);
        if (j > 1) dp[i & 1][j] = min(dp[i & 1][j], dp[i & 1][j - 1] + a[i]);
    }
    cout << dp[n & 1][m] << '\n';
}

int main() {
    Waimai;
    solve();
}

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