# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896818 | ace5 | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 43 ms | 134000 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;
#define int int64_t
const int INF = 1e18;
const int maxn = 205;
int dp[maxn][maxn][maxn][2] = {0};
int a[maxn] = {0};
int t[maxn] = {0};
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,L;
cin >> n >> L;
for(int j =1;j <= n;++j)
{
cin >> a[j];
}
a[n+1] = L;
for(int j =1;j <= n;++j)
{
cin >> t[j];
}
for(int i = 0;i <= n;++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... |