# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389624 | mariowong | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 188 ms | 328644 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;
struct stamps{
long long d,t;
}a[205];
long long dp[205][205][205][5],n,l,ans;
int main(){
ios::sync_with_stdio(false);
cin >> n >> l;
for (int i=1;i<=n;i++){
cin >> a[i].d;
}
for (int i=1;i<=n;i++){
cin >> a[i].t;
}
for (int i=0;i<=n+1;i++){
for (int j=0;j<=n+1;j++){
for (int k=0;k<=n;k++){
dp[i][j][k][0]=dp[i][j][k][1]=1e18;
}
}
}
a[n+1].d=l;
dp[0][n+1][0][0]=dp[0][n+1][0][1]=0;
for (int i=0;i<=n;i++){
for (int j=n+1;j>i;j--){
for (int k=0;k<=max(0LL,n-j+1)+i;k++){
# | 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... |