# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201032 | HellAngel | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 133 ms | 69984 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;
const int inf = 1e9 + 7;
const int maxn = 207;
int dp[maxn][maxn][maxn][2], x[maxn], t[maxn], n, l, sum, ans;
/// left, right, cnt, curpos
int Dist(int i, int j)
{
return min(abs(i - j), min(i, l - i) + min(j, l - j));
}
void Minimize(int &a, int b, bool check)
{
if(check)
a = min(a, b);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin);
cin >> n >> l;
fill_n(&dp[0][0][0][0], maxn * maxn * maxn * 2, inf);
for(int i = 1; i <= n; i++) cin >> x[i];
for(int i = 1; i <= n; i++) cin >> t[i];
dp[0][0][0][0] = dp[0][0][0][1] = 0;
Compilation message (stderr)
# | 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... |