# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237177 | hackermub | Building 4 (JOI20_building4) | C++17 | 351 ms | 68972 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 int long long
#define pii pair<int,int>
#define INF (int)1e18
#define all(v) v.begin(), v.end()
const int MAXN =1e6+7;
int n;
int dp[MAXN][2][2]; // min and max A if ith bit=j
int ara[2][MAXN];
void min_self(int &x,int y){
x=min(x,y);
}
void max_self(int &x,int y){
x=max(x,y);
}
int32_t main(){
ios_base::sync_with_stdio(false),cin.tie(),cout.tie();
// If you hack my code, you are gay
cin>>n;
int N=2*n;
for(auto x:{0,1}){
for(int i=0;i<N;i++){
cin>>ara[x][i];
dp[i][x][0]=INF;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |