# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848605 | dungz | Long Mansion (JOI17_long_mansion) | C++17 | 223 ms | 41324 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.
//#pragma GCC optimize ("O2")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define task "task"
#define task "task"
#define prll pair<ll,ll>
#define pb push_back
#define ld long double
const ll MIN=-1e18,MAX=1e18,MOD=1e9+7,nmax=5e5+5;
int a[nmax],f[nmax];
vector<int> key[nmax];
int rr[nmax],lll[nmax],exl[nmax],exr[nmax];
void dnc(int l,int r)
{
if(l==r)
{
exl[l]=exr[l]=l;
return;
}
int m=(l+r)/2;
dnc(l,m);
dnc(m+1,r);
int cl=m,cr=m;
for(int i=m;i>=l;i--)
{
if(exr[i]==m)
# | 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... |