oj.uz

Submission #696309

# Submission time Handle Problem Language Result Execution time Memory
696309 2023-02-06T08:02:33 Z stevancv Collecting Stamps 3 (JOI20_ho_t3) C++14
0 / 100
 0 ms 212 KB 
// GPT TESTING
#include <bits/stdc++.h>
using namespace std;

const int N = 205;
int n, l, x[N], t[N], dp[N];

int main() {
    cin >> n >> l;
    for (int i = 1; i <= n; i++) cin >> x[i];
    for (int i = 1; i <= n; i++) cin >> t[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            int d = min(abs(x[j] - x[i]), l - abs(x[j] - x[i]));
            if (d <= t[i]) dp[j] = max(dp[j], dp[i] + 1);
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) ans = max(ans, dp[i]);
    cout << ans << endl;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -