oj.uz

답안 #853948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853948 2023-09-25T16:10:07 Z molney Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 1 ms 544 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#else
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx,avx2,popcnt")
#endif
#include <bits/stdc++.h>
using namespace std;

template<typename T> istream& operator>>(istream& in, vector<T>& v);
template<typename T> ostream& operator<<(ostream& out, const vector<T>& v);
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p);
template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& p);
istream& operator>>(istream& in, vector<bool>& v) { bool n; for (auto&& i : v) { in >> n; i = n; } return in; }
ostream& operator<<(ostream& out, const vector<bool>& v) { for (auto i : v) { out << i << " "; } return out; }
template<typename T> istream& operator>>(istream& in, vector<T>& v) { for (auto& x : v) in >> x; return in; }
template<typename T> ostream& operator<<(ostream& out, const vector<T>& v) { for (auto& x : v) out << x << " "; return out; }
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.first >> p.second; return in; }
template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& p) { out << p.first << " " << p.second; return out; }

mt19937_64 rnd((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef long long ll;
typedef long double ld;

#define QUICK_IO
//#define MULTIPLE_TESTCASES
//#define FILESTREAM


void solve() {

	int n, m;
    cin >> n >> m;
    vector<ll> a(n), b(m);
    cin >> a >> b;
    
    for (int i = 1; i < n; i++) a[i] = min(a[i], a[i - 1]);
    for (int j = 1; j < m; j++) b[j] = min(b[j], b[j - 1]);

    vector<vector<ll>> dp(n, vector<ll>(m, 1e18));
    dp[0][0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (i > 0) dp[i][j] = min(dp[i][j], dp[i - 1][j] + b[j]);
            if (j > 0) dp[i][j] = min(dp[i][j], dp[i][j - 1] + a[i]);
        }
    }

    cout << dp[n - 1][m - 1];

}


signed main() {
#ifndef LOCAL
#ifdef QUICK_IO
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
#endif
#ifdef FILESTREAM
	freopen("solve.in", "r", stdin);
	freopen("solve.out", "w", stdout);
#endif
#endif
    cout << setprecision(9) << fixed;
    unsigned t = 1;
#ifdef MULTIPLE_TESTCASES
	cin >> t;
#endif
    for (unsigned i = 1; i <= t; ++i) solve();
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -