# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012783 | denislav | Building 4 (JOI20_building4) | C++14 | 44 ms | 32084 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 <iostream>
# include <vector>
# include <algorithm>
using namespace std;
const int MAX=4e3+11;
int a[2][MAX];
bool dp[2][MAX][MAX];
int n;
vector<char> ve;
void rec(int k, int i, int v)
{
//cout<<"->"<<k<<" "<<i<<" "<<v-n<<"\n";
if(k==0) ve.push_back('A');
else ve.push_back('B');
if(i==1) return ;
int d=1;
if(k==1) d=-1;
if(v-d>=0 and v-d<=n*2 and dp[0][i-1][v-d]==1 and a[0][i-1]<=a[k][i]) rec(0,i-1,v-d);
else rec(1,i-1,v-d);
}
int main()
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |