Submission #566908

#	Time	Username	Problem	Language	Result	Execution time	Memory
566908		maomao90	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	2076 ms	3356 KiB

kyoto

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int h, w;
int a[MAXN], b[MAXN];
ll dp[2][MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> h >> w;
    REP (i, 0, h) {
        cin >> a[i];
    }
    REP (i, 0, w) {
        cin >> b[i];
    }
    int p = 0, c = 1;
    REP (i, 0, w) {
        dp[c][i] = LINF;
    }
    REP (i, 0, h) {
        swap(p, c);
        dp[c][0] = i == 0 ? 0 : dp[p][0] + b[0];
        REP (j, 1, w) {
            dp[c][j] = min(dp[c][j - 1] + a[i], dp[p][j] + b[j]);
        }
    }
    cout << dp[c][w - 1] << '\n';
    return 0;
}

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