oj.uz

Submission #994243

# Submission time Handle Problem Language Result Execution time Memory
994243 2024-06-07T09:44:20 Z vjudge1 Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 162 ms 149328 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 100'001;

ll dp[3000][3000], a[MAXN], b[MAXN], idxa[MAXN], idxb[MAXN], timera = 1, timerb = 1;
set<ll> hva, hvb;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= m; i++) cin >> b[i];
    for (int i = 0; i < MAXN; i++) {
        for (int j = 0; j < MAXN; j++) {
            dp[i][j] = 1e18;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!hva.count(a[i]) || i == n) {
            hva.insert(a[i]);
            idxa[timera++] = i;
        }
    }
    for (int i = 1; i <= m; i++) {
        if (!hvb.count(b[i]) || i == m) {
            hvb.insert(b[i]);
            idxb[timerb++] = i;
        }
    }
    dp[1][1] = 0;
    for (int i = 1; i < timera; i++) {
        for (int j = 1; j < timerb; j++) {
            dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a[i] * (idxb[j+1] - idxb[j]));
            dp[i+1][j] = min(dp[i+1][j], dp[i][j] + b[j] * (idxa[i+1] - idxa[i]));
        }
    }
    cout << dp[timera-1][timerb-1] << "\n";
    return 0;
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:18:22: warning: iteration 3000 invokes undefined behavior [-Waggressive-loop-optimizations]
   18 |             dp[i][j] = 1e18;
      |             ~~~~~~~~~^~~~~~
kyoto.cpp:17:27: note: within this loop
   17 |         for (int j = 0; j < MAXN; j++) {
      |                         ~~^~~~~~
kyoto.cpp:18:22: warning: iteration 3000 invokes undefined behavior [-Waggressive-loop-optimizations]
   18 |             dp[i][j] = 1e18;
      |             ~~~~~~~~~^~~~~~
kyoto.cpp:16:23: note: within this loop
   16 |     for (int i = 0; i < MAXN; i++) {
      |                     ~~^~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 149328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 149328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 149328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -