# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161583 | MvC | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 3029 ms | 10348 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 target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int bk=1500;
const int nmax=1e6+5000;
const int mod=1e9+7;
using namespace std;
int n,m,a[nmax],mx,i,j,l,r,k,mxx,bukmx[nmax/bk],bukmn[nmax/bk],buk[nmax/bk],x;
vector<int>vc[nmax/bk];
void calc(int l,int r)
{
int mxx=0,mx=0,mn=inf;
for(int i=l;i<=r;i++)
{
if(a[i]<mx)mxx=max(mxx,a[i]+mx);
mx=max(mx,a[i]);
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |