# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128309 | AndrijaM | Building 4 (JOI20_building4) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int maxn=1000005;
const int mod=1e9+7;
int a[maxn];
int b[maxn];
pair<int,int> dp[maxn][2];
pair<int,int>add(pair<int,int>x)
{
x.first++;
x.second++;
return x;
}
pair<int,int>u(pair<int,int>x,pair<int,int>y)
{
if(x.first<0)return y;
if(y.first<0)return x;
return {min(x.first,y.first),max(x.second,y.second)};
}
bool in(pair<int,int>y,int x)
{
return (y.first<=x && x<=y.second);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |