# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200235 | mdn2002 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++14 | 474 ms | 57848 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 mod=1e9+7;
int n,dp[4][242][123][123];
vector<int>v[4];
string s;
int f(int x,int ir,int ig,int iy)
{
if(ir+ig+iy==n)return 0;
if(dp[x][ir][ig][iy]!=-1)return dp[x][ir][ig][iy];
int ans=1e9,ind=ir+ig+iy,id;
for(int i=0;i<3;i++)
{
if(i==x)continue;
if(i==0)
{
if(ir==v[0].size())continue;
int id=v[i][ir],ad=0;
ad-=lower_bound(v[1].begin(),v[1].begin()+ig,id)-v[1].begin();
ad+=ig;
ad-=lower_bound(v[2].begin(),v[2].begin()+iy,id)-v[2].begin();
ad+=iy;
ans=min(ans,f(0,ir+1,ig,iy)+abs((id+ad)-ind));
}
if(i==1)
{
if(ig==v[1].size())continue;
int id=v[i][ig],ad=0;
ad-=lower_bound(v[0].begin(),v[0].begin()+ir,id)-v[0].begin();
ad+=ir;
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... |