# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1000613 | irmuun | Building 4 (JOI20_building4) | C++17 | 373 ms | 524288 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 ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n;
cin>>n;
ll a[2*n+5],b[2*n+5];
for(ll i=1;i<=2*n;i++){
cin>>a[i];
}
for(ll i=1;i<=2*n;i++){
cin>>b[i];
}
bool dp[2*n+5][n+5][2];//current building, A's count,i-th building type
memset(dp,false,sizeof dp);
ll bef[2*n+5][n+5][2];
memset(bef,-1,sizeof bef);
dp[1][1][0]=true;
dp[1][0][1]=true;
for(ll i=2;i<=2*n;i++){
for(ll j=0;j<=n;j++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |