# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008802 | PoPularPlusPlus | Two Antennas (JOI19_antennas) | C++17 | 390 ms | 51288 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(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(),x.end()
#define vf first
#define vs second
const int mod = 1000000007;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
struct item{
int mx , mn , mx_out , mn_out , ans;
};
struct Seg{
vector<item> v;
vector<int> lazy_mn , lazy_mx;
int siz;
item nutral = {-1 , 1000000005 , -1 , 1000000005 , -1000000000};
item merge(item a , item b){
item res = nutral;
//res.mn = max(a.mn , b.mn);
//res.mx = min(a.mx , b.mx);
res.ans = max(a.ans , b.ans);
res.mx_out = max(a.mx_out , b.mx_out);
res.mn_out = min(a.mn_out , b.mn_out);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |