# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890611 | LCJLY | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 32 ms | 135520 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 long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,int>pi2;
int n=0;
int k=0;
int pos[205];
int limit[205];
int memo[205][205][2][205];
int dp(int l, int r, bool flag, int cur){
if(cur>200) return 0;
if(l+1>=r) return 0;
if(memo[l][r][flag][cur]!=-1) return memo[l][r][flag][cur];
int ans=0;
int dist=cur;
if(!flag) dist+=(pos[l+1]-pos[l]);
else dist+=(pos[l+1]+k-pos[r]);
ans=max(ans,dp(l+1,r,0,dist)+(dist<=limit[l+1]));
int dist2=cur;
# | 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... |