oj.uz

Submission #161587

# Submission time Handle Problem Language Result Execution time Memory
161587 2019-11-03T08:03:27 Z MvC Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
77 / 100
 3000 ms 31768 KB 
#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,f[nmax],mnn;
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]);
		mn=min(mn,a[i]);
		vc[l/bk].pb(a[i]);
	}
	buk[l/bk]=mxx;
	bukmx[l/bk]=mx;
	bukmn[l/bk]=mn;
	sort(vc[l/bk].begin(),vc[l/bk].end());
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=0;i<n;i++)cin>>a[i];
	mnn=inf;
	f[0]=1;
	for(i=1;i<n;i++)
	{
		if(a[i]>=a[i-1])f[i]=f[i-1]+1;
		else f[i]=1;
		mnn=min(mnn,a[i]);
	}
	for(i=0;i<n;i+=bk)
	{
		calc(i,min(i+bk-1,n-1));
	}
	while(m--)
	{
		cin>>l>>r>>k;
		l--,r--;
		if(k<mnn)
		{
			if(f[r]>=r-l+1)cout<<"1\n";
			else cout<<"0\n";
			continue;
		}
		mx=mxx=0;
		for(i=l;i<=r;i++)
		{
			if(i%bk==0)break;
			if(a[i]<mx)mxx=max(mxx,a[i]+mx);
			mx=max(mx,a[i]);
		}
		for(;i+bk<=r;i+=bk)
		{
			mxx=max(mxx,buk[i/bk]);
			if(bukmn[i/bk]<mx)
			{
				x=*(--upper_bound(vc[i/bk].begin(),vc[i/bk].end(),mx-1));
				mxx=max(mxx,mx+x);
			}
			mx=max(mx,bukmx[i/bk]);
		}
		for(;i<=r;i++)
		{
			if(a[i]<mx)mxx=max(mxx,a[i]+mx);
			mx=max(mx,a[i]);
		}
		if(mxx<=k)cout<<"1\n";
		else cout<<"0\n";
	}
	return 0;
}

Compilation message

sortbooks.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
sortbooks.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 10 ms 424 KB Output is correct
13 Correct 11 ms 376 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 504 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 504 KB Output is correct
18 Correct 12 ms 496 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 15628 KB Output is correct
2 Correct 713 ms 15608 KB Output is correct
3 Correct 711 ms 15736 KB Output is correct
4 Correct 707 ms 15604 KB Output is correct
5 Correct 659 ms 15680 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 1972 KB Output is correct
2 Correct 475 ms 2028 KB Output is correct
3 Correct 284 ms 1912 KB Output is correct
4 Correct 268 ms 2040 KB Output is correct
5 Correct 261 ms 2040 KB Output is correct
6 Correct 330 ms 1912 KB Output is correct
7 Correct 330 ms 1912 KB Output is correct
8 Correct 317 ms 2040 KB Output is correct
9 Correct 72 ms 504 KB Output is correct
10 Correct 297 ms 2040 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 10 ms 424 KB Output is correct
13 Correct 11 ms 376 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 504 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 504 KB Output is correct
18 Correct 12 ms 496 KB Output is correct
19 Correct 832 ms 3532 KB Output is correct
20 Correct 840 ms 3448 KB Output is correct
21 Correct 1351 ms 3576 KB Output is correct
22 Correct 1350 ms 3704 KB Output is correct
23 Correct 1417 ms 3576 KB Output is correct
24 Correct 619 ms 3420 KB Output is correct
25 Correct 623 ms 3448 KB Output is correct
26 Correct 617 ms 3576 KB Output is correct
27 Correct 612 ms 3448 KB Output is correct
28 Correct 616 ms 3576 KB Output is correct
29 Correct 578 ms 3460 KB Output is correct
30 Correct 566 ms 3488 KB Output is correct
31 Correct 572 ms 3468 KB Output is correct
32 Correct 571 ms 3576 KB Output is correct
33 Correct 575 ms 3544 KB Output is correct
34 Correct 707 ms 3452 KB Output is correct
35 Correct 734 ms 3576 KB Output is correct
36 Correct 710 ms 3740 KB Output is correct
37 Correct 730 ms 3476 KB Output is correct
38 Correct 716 ms 3624 KB Output is correct
39 Correct 713 ms 3576 KB Output is correct
40 Correct 586 ms 2552 KB Output is correct
41 Correct 737 ms 3448 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 10 ms 424 KB Output is correct
13 Correct 11 ms 376 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 504 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 504 KB Output is correct
18 Correct 12 ms 496 KB Output is correct
19 Correct 693 ms 15628 KB Output is correct
20 Correct 713 ms 15608 KB Output is correct
21 Correct 711 ms 15736 KB Output is correct
22 Correct 707 ms 15604 KB Output is correct
23 Correct 659 ms 15680 KB Output is correct
24 Correct 358 ms 1972 KB Output is correct
25 Correct 475 ms 2028 KB Output is correct
26 Correct 284 ms 1912 KB Output is correct
27 Correct 268 ms 2040 KB Output is correct
28 Correct 261 ms 2040 KB Output is correct
29 Correct 330 ms 1912 KB Output is correct
30 Correct 330 ms 1912 KB Output is correct
31 Correct 317 ms 2040 KB Output is correct
32 Correct 72 ms 504 KB Output is correct
33 Correct 297 ms 2040 KB Output is correct
34 Correct 832 ms 3532 KB Output is correct
35 Correct 840 ms 3448 KB Output is correct
36 Correct 1351 ms 3576 KB Output is correct
37 Correct 1350 ms 3704 KB Output is correct
38 Correct 1417 ms 3576 KB Output is correct
39 Correct 619 ms 3420 KB Output is correct
40 Correct 623 ms 3448 KB Output is correct
41 Correct 617 ms 3576 KB Output is correct
42 Correct 612 ms 3448 KB Output is correct
43 Correct 616 ms 3576 KB Output is correct
44 Correct 578 ms 3460 KB Output is correct
45 Correct 566 ms 3488 KB Output is correct
46 Correct 572 ms 3468 KB Output is correct
47 Correct 571 ms 3576 KB Output is correct
48 Correct 575 ms 3544 KB Output is correct
49 Correct 707 ms 3452 KB Output is correct
50 Correct 734 ms 3576 KB Output is correct
51 Correct 710 ms 3740 KB Output is correct
52 Correct 730 ms 3476 KB Output is correct
53 Correct 716 ms 3624 KB Output is correct
54 Correct 713 ms 3576 KB Output is correct
55 Correct 586 ms 2552 KB Output is correct
56 Correct 737 ms 3448 KB Output is correct
57 Execution timed out 3048 ms 31768 KB Time limit exceeded
58 Halted 0 ms 0 KB -