oj.uz

Submission #161584

# Submission time Handle Problem Language Result Execution time Memory
161584 2019-11-03T07:59:36 Z MvC Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
64 / 100
 1380 ms 43436 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];
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];
	for(i=1;i<n;i++)
	{
		if(a[i]>=a[i-1])f[i]=f[i-1]+1;
		else f[i]=1;
	}
	if(n>2e5 && m>2e5)
	{
		while(m--)
		{
			cin>>l>>r>>k;
			l--,r--;
			if(f[r]>=r-l+1)cout<<"1\n";
			else cout<<"0\n";
		}
		return 0;
	}
	for(i=0;i<n;i+=bk)
	{
		calc(i,min(i+bk-1,n-1));
	}
	while(m--)
	{
		cin>>l>>r>>k;
		l--,r--;
		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 9 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 2 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 2 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 9 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 2 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 2 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 10 ms 504 KB Output is correct
14 Correct 15 ms 504 KB Output is correct
15 Correct 16 ms 492 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 632 KB Output is correct
18 Correct 12 ms 488 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 646 ms 25868 KB Output is correct
2 Correct 650 ms 43220 KB Output is correct
3 Correct 841 ms 43036 KB Output is correct
4 Correct 645 ms 43152 KB Output is correct
5 Incorrect 648 ms 43436 KB Output isn't correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 1956 KB Output is correct
2 Correct 468 ms 2044 KB Output is correct
3 Correct 271 ms 1912 KB Output is correct
4 Correct 269 ms 2040 KB Output is correct
5 Correct 258 ms 1912 KB Output is correct
6 Correct 327 ms 2108 KB Output is correct
7 Correct 321 ms 2076 KB Output is correct
8 Correct 306 ms 2040 KB Output is correct
9 Correct 71 ms 632 KB Output is correct
10 Correct 298 ms 1984 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 9 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 2 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 2 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 10 ms 504 KB Output is correct
14 Correct 15 ms 504 KB Output is correct
15 Correct 16 ms 492 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 632 KB Output is correct
18 Correct 12 ms 488 KB Output is correct
19 Correct 849 ms 3544 KB Output is correct
20 Correct 823 ms 3676 KB Output is correct
21 Correct 1348 ms 3552 KB Output is correct
22 Correct 1378 ms 3740 KB Output is correct
23 Correct 1380 ms 3592 KB Output is correct
24 Correct 618 ms 3664 KB Output is correct
25 Correct 621 ms 3684 KB Output is correct
26 Correct 624 ms 3620 KB Output is correct
27 Correct 606 ms 3536 KB Output is correct
28 Correct 595 ms 3620 KB Output is correct
29 Correct 569 ms 3448 KB Output is correct
30 Correct 563 ms 3576 KB Output is correct
31 Correct 572 ms 3604 KB Output is correct
32 Correct 597 ms 3576 KB Output is correct
33 Correct 567 ms 3500 KB Output is correct
34 Correct 704 ms 3476 KB Output is correct
35 Correct 711 ms 3576 KB Output is correct
36 Correct 750 ms 3704 KB Output is correct
37 Correct 712 ms 3704 KB Output is correct
38 Correct 720 ms 3636 KB Output is correct
39 Correct 930 ms 3560 KB Output is correct
40 Correct 463 ms 2552 KB Output is correct
41 Correct 743 ms 3648 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 9 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 2 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 2 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 10 ms 504 KB Output is correct
14 Correct 15 ms 504 KB Output is correct
15 Correct 16 ms 492 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 11 ms 632 KB Output is correct
18 Correct 12 ms 488 KB Output is correct
19 Correct 646 ms 25868 KB Output is correct
20 Correct 650 ms 43220 KB Output is correct
21 Correct 841 ms 43036 KB Output is correct
22 Correct 645 ms 43152 KB Output is correct
23 Incorrect 648 ms 43436 KB Output isn't correct