oj.uz

Submission #157740

# Submission time Handle Problem Language Result Execution time Memory
157740 2019-10-12T19:22:19 Z TadijaSebez Sushi (JOI16_sushi) C++11
5 / 100
 12000 ms 21612 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=400050;
const int S=400;
const int M=N/S+1;
const int Q=25050;
multiset<pair<int,int>> st[M];
int a[N],n,q,ok[M];
bool mark[N];
int Push(int B, int x)
{
	st[B].insert({x,0});
	int p;tie(x,p)=*st[B].rbegin();
	st[B].erase(--st[B].end());
	if(p) mark[-p]=1,ok[B]=0;
	return x;
}
void BuildBlock(int B, int l, int r){ for(int i=l;i<=r;i++) st[B].insert({a[i],-i}),mark[i]=0;ok[B]=1;}
void BreakBlock(int B)
{
	if(ok[B]) st[B].clear();
	else
	{
		int l=B*S,r=min((B+1)*S,n)-1;
		for(int i=r;i>=l;i--)
		{
			if(mark[i])
			{
				int x,y;tie(x,y)=*st[B].rbegin();
				st[B].erase(--st[B].end());
				a[i]=x;
				if(y) mark[-y]=1;
			}
			else
			{
				st[B].erase(st[B].find({a[i],-i}));
			}
		}
	}
}
int Push(int B, int l, int r, int x)
{
	BreakBlock(B);
	for(int i=l;i<=r;i++) if(a[i]>x) swap(a[i],x);
	BuildBlock(B,B*S,min((B+1)*S,n)-1);
	return x;
}
void BuildAll(){ for(int l=0;l<n;l+=S) BuildBlock(l/S,l,min(l+S,n)-1);}
int Query(int l, int r, int x)
{
	int L=l/S,R=r/S;
	if(L==R)
	{
		x=Push(L,l,r,x);
	}
	else
	{
		x=Push(L,l,L*S+S-1,x);
		for(int i=L+1;i<R;i++) x=Push(i,x);
		x=Push(R,R*S,r,x);
	}
	return x;
}
int main()
{
	scanf("%i %i",&n,&q);
	for(int i=0;i<n;i++) scanf("%i",&a[i]);
	BuildAll();
	while(q--)
	{
		int l,r,x;
		scanf("%i %i %i",&l,&r,&x);
		l--;r--;
		if(l<=r) x=Query(l,r,x);
		else x=Query(0,r,Query(l,n-1,x));
		printf("%i\n",x);
	}
	return 0;
}

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
sushi.cpp:67:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) scanf("%i",&a[i]);
                       ~~~~~^~~~~~~~~~~~
sushi.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i %i %i",&l,&r,&x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 644 KB Output is correct
2 Correct 284 ms 760 KB Output is correct
3 Correct 292 ms 560 KB Output is correct
4 Correct 284 ms 608 KB Output is correct
5 Correct 293 ms 536 KB Output is correct
6 Correct 292 ms 632 KB Output is correct
7 Correct 232 ms 604 KB Output is correct
8 Correct 228 ms 564 KB Output is correct
9 Correct 294 ms 632 KB Output is correct
10 Correct 287 ms 656 KB Output is correct
11 Correct 264 ms 704 KB Output is correct
12 Correct 255 ms 540 KB Output is correct
13 Correct 264 ms 528 KB Output is correct
14 Correct 396 ms 528 KB Output is correct
15 Correct 390 ms 548 KB Output is correct
16 Correct 108 ms 528 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 644 KB Output is correct
2 Correct 284 ms 760 KB Output is correct
3 Correct 292 ms 560 KB Output is correct
4 Correct 284 ms 608 KB Output is correct
5 Correct 293 ms 536 KB Output is correct
6 Correct 292 ms 632 KB Output is correct
7 Correct 232 ms 604 KB Output is correct
8 Correct 228 ms 564 KB Output is correct
9 Correct 294 ms 632 KB Output is correct
10 Correct 287 ms 656 KB Output is correct
11 Correct 264 ms 704 KB Output is correct
12 Correct 255 ms 540 KB Output is correct
13 Correct 264 ms 528 KB Output is correct
14 Correct 396 ms 528 KB Output is correct
15 Correct 390 ms 548 KB Output is correct
16 Correct 108 ms 528 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Execution timed out 12037 ms 21612 KB Time limit exceeded
24 Halted 0 ms 0 KB -