Submission #341445

#	Time	Username	Problem	Language	Result	Execution time	Memory
341445		ogibogi2004	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3067 ms	108908 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+6;
int w[MAXN];
struct query
{
	int r,k,pos;
};
int ans[MAXN];
vector<query>v[MAXN];
vector<int>g[MAXN];
int t[MAXN],n,m;
int fen[MAXN];
void update(int idx,int val)
{
	for(;idx<MAXN;idx+=idx&(-idx))
	{
		fen[idx]=max(fen[idx],val);
	}
}
int query(int idx)
{
	int ret=0;
	for(;idx>0;idx-=idx&(-idx))
	{
		ret=max(ret,fen[idx]);
	}
	return ret;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>w[i];
	stack<pair<int,int> >st;
	t[1]=-1;
	st.push({w[1],1});
	for(int i=1;i<=n;i++)
	{
		while(!st.empty()&&st.top().first<w[i])
		{
			st.pop();
		}
		if(st.empty())
		{
			t[i]=-1;
		}
		else t[i]=st.top().second;
		st.push({w[i],i});
	}
	for(int i=1;i<=n;i++)
	{
		if(t[i]==-1)continue;
		g[t[i]].push_back(i);
	}
	for(int i=1;i<=m;i++)
	{
		int l,r,k;
		cin>>l>>r>>k;
		v[l].push_back({r,k,i});
	}
	for(int i=n;i>=1;i--)
	{
		for(int j=0;j<g[i].size();j++)
		{
			update(g[i][j],w[i]+w[g[i][j]]);
		}
		for(int j=0;j<v[i].size();j++)
		{
			int t=query(v[i][j].r);
			if(t>v[i][j].k)ans[v[i][j].pos]=0;
			else ans[v[i][j].pos]=1;
		}
	}
	for(int i=1;i<=m;i++)cout<<ans[i]<<endl;
return 0;
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:63:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for(int j=0;j<g[i].size();j++)
      |               ~^~~~~~~~~~~~
sortbooks.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |   for(int j=0;j<v[i].size();j++)
      |               ~^~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23