# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591535 | piOOE | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 105 ms | 127468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 201;
ll dp[2][N][N][N];
int L[N], R[N], TR[N], TL[N];
void ckmin(ll &a, ll b) {
if (a == -1 || a > b) {
a = b;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, p;
cin >> n >> p;
for (int i = 0; i < n; ++i) {
cin >> R[i];
L[n - i - 1] = p - R[i];
}
for (int i = 0; i < n; ++i) {
cin >> TR[i];
TL[n - i - 1] = TR[i];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |