# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378457 | eulerdesoja | Building 4 (JOI20_building4) | C++14 | 125 ms | 32384 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>
#include<fstream>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
const int mxn=2e3+5;
int n,a[2][2*mxn];
int dp[mxn][mxn][2];
vector<char>ans(2*n+1);
int solve(int i,int j,int k){
if(dp[i][j][k]!=-1)return dp[i][j][k];
if(i>n || j>n)return 0;
if(i+j==2*n){
if(i==n && j==n){
if(ans[i+j]=='$')ans[i+j]=(k==0?'A':'B');
return 1;
}
return 0;
}
int id=i+j;
int ok=0;
if(a[0][id+1]>=a[k][id] && i+1<=n)ok|=solve(i+1,j,0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |