# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922861 | dimashhh | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 54 ms | 142212 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 N = 212, MOD = 1e9 + 7;
typedef long long ll;
#define int ll
int n,L,t[N],x[N];
ll dp[N][N][N][2];
void test() {
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 = 0;i <= n;i++){
for(int j = 0;j <= n;j++){
for(int k = 0;k <= n;k++){
for(int f = 0;f < 2;++f){
dp[i][j][k][f] = 1e18;
}
}
}
}
x[n + 1] = L;
dp[0][0][0][0] = dp[0][0][0][1] = 0;
for(int i = 0;i <= n;i++){
for(int j = 0;j <= n;j++){
# | 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... |