# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012809 | denislav | Building 4 (JOI20_building4) | C++14 | 1 ms | 6492 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=5e5+11,INF=1e9;
int a[2][MAX];
pair<int, int> dp[2][MAX];
int n;
void reset()
{
for(int i=1;i<=n*2;i++)
{
for(int k=0;k<=1;k++)
{
dp[k][i]={INF,-INF};
}
}
}
vector<char> ve;
void rec(int k, int i, int v)
{
if(k==0) ve.push_back('A');
else ve.push_back('B');
if(i==1) return ;
int pr=v;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |