oj.uz

Submission #161583

# Submission time Handle Problem Language Result Execution time Memory
161583 2019-11-03T07:55:12 Z MvC Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 10348 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;
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=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 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 380 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 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 380 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 376 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 16 ms 376 KB Output is correct
15 Correct 15 ms 376 KB Output is correct
16 Correct 13 ms 376 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 11 ms 380 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3029 ms 10348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 1528 KB Output is correct
2 Correct 478 ms 1528 KB Output is correct
3 Correct 272 ms 1528 KB Output is correct
4 Correct 274 ms 1528 KB Output is correct
5 Correct 259 ms 1704 KB Output is correct
6 Correct 319 ms 1528 KB Output is correct
7 Correct 321 ms 1528 KB Output is correct
8 Correct 310 ms 1504 KB Output is correct
9 Correct 74 ms 504 KB Output is correct
10 Correct 300 ms 1512 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 380 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 380 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 376 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 16 ms 376 KB Output is correct
15 Correct 15 ms 376 KB Output is correct
16 Correct 13 ms 376 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 11 ms 380 KB Output is correct
19 Correct 830 ms 2892 KB Output is correct
20 Correct 865 ms 2808 KB Output is correct
21 Correct 1304 ms 2684 KB Output is correct
22 Correct 1312 ms 2752 KB Output is correct
23 Correct 1324 ms 2680 KB Output is correct
24 Correct 618 ms 2808 KB Output is correct
25 Correct 617 ms 2672 KB Output is correct
26 Correct 604 ms 2748 KB Output is correct
27 Correct 616 ms 2864 KB Output is correct
28 Correct 609 ms 2808 KB Output is correct
29 Correct 570 ms 2680 KB Output is correct
30 Correct 574 ms 2876 KB Output is correct
31 Correct 585 ms 2732 KB Output is correct
32 Correct 585 ms 2872 KB Output is correct
33 Correct 712 ms 2916 KB Output is correct
34 Correct 720 ms 2732 KB Output is correct
35 Correct 715 ms 2940 KB Output is correct
36 Correct 834 ms 2936 KB Output is correct
37 Correct 714 ms 2808 KB Output is correct
38 Correct 717 ms 2700 KB Output is correct
39 Correct 695 ms 2672 KB Output is correct
40 Correct 454 ms 2168 KB Output is correct
41 Correct 708 ms 2868 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 380 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 380 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 376 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 16 ms 376 KB Output is correct
15 Correct 15 ms 376 KB Output is correct
16 Correct 13 ms 376 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 11 ms 380 KB Output is correct
19 Execution timed out 3029 ms 10348 KB Time limit exceeded
20 Halted 0 ms 0 KB -