oj.uz

Submission #1040340

# Submission time Handle Problem Language Result Execution time Memory
1040340 2024-08-01T01:37:46 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 273 ms 43708 KB 
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[1000006],rmx[30][1000006],vt[30][1000006];
//void buildd()
//{
//	for(int i=1;i<=n;i++)
//	{
//		rmx[0][i]=a[i];
//		vt[0][i]=i;
//	}
//	for(int i=1;i<=21;i++)
//	{
//		for(int j=1;j<=n-(1<<i)+1;j++)
//		{
//			if(rmx[i-1][j]>=rmx[i-1][j+(1<<(i-1))])
//			{
//				rmx[i][j]=rmx[i-1][j];
//				vt[i][j]=vt[i-1][j];
//			}
//			else
//			{
//				rmx[i][j]=rmx[i-1][j+(1<<(i-1))];
//				vt[i][j]=vt[i-1][j+(1<<(i-1))];
//			}
//		}
//	}
//}
//pair<int,int> getmx(long long l,long long r)
//{
//	long long k=__lg(r-l+1);
//	if(rmx[k][l]>=rmx[k][r-(1<<k)+1])
//	{
//		return {rmx[k][l],vt[k][l]};
//	}
//	else return {rmx[k][r-(1<<k)+1],vt[k][r-(1<<k)+1]};
//}
//long long get(long long l,long long r,long long w)
//{
//	if(l==r)
//	{
//		if(a[l]<w) return a[l];
//		else return -1;
//	}
//	pair<int,int> p=getmx(l,r);
//	if(p.first<w) return p.first;
//	long long mid=(l+r)/2;
//	return max(get(l,mid,w),get(mid+1,r,w));
//}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
//	freopen(".inp","r",stdin);
//	freopen(".out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
//	buildd();
	if(m<=5000)
	while(m--)
	{
		long long l,r,k;
		cin>>l>>r>>k;
		long long mx=a[l],res=0;
		for(int i=l+1;i<=r;i++)
		{
			if(a[i]>=mx)
			{
				mx=a[i];
			}
			else
			{
				res=max(res,mx+a[i]);
			}
		}
		if(res<=k) cout<<1<<"\n";
		else cout<<0<<"\n";
	}
	else
	{
		while(m--)
		{
			long long l,r,k;
			cin>>l>>r>>k;
			cout<<0<<"\n";
		}
	}
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 352 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 11 ms 608 KB Output is correct
15 Correct 6 ms 612 KB Output is correct
16 Correct 9 ms 632 KB Output is correct
17 Correct 7 ms 608 KB Output is correct
18 Correct 10 ms 488 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 273 ms 43708 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 3380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 352 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 11 ms 608 KB Output is correct
15 Correct 6 ms 612 KB Output is correct
16 Correct 9 ms 632 KB Output is correct
17 Correct 7 ms 608 KB Output is correct
18 Correct 10 ms 488 KB Output is correct
19 Incorrect 51 ms 8792 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 352 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 11 ms 608 KB Output is correct
15 Correct 6 ms 612 KB Output is correct
16 Correct 9 ms 632 KB Output is correct
17 Correct 7 ms 608 KB Output is correct
18 Correct 10 ms 488 KB Output is correct
19 Incorrect 273 ms 43708 KB Output isn't correct
20 Halted 0 ms 0 KB -