oj.uz

Submission #157708

# Submission time Handle Problem Language Result Execution time Memory
157708 2019-10-12T18:14:10 Z TadijaSebez Sushi (JOI16_sushi) C++11
5 / 100
 426 ms 3880 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=400050;
const int S=2050;
vector<int> pos[N/S];
multiset<int> st[N/S];
int a[N];
int Push(int B, int x)
{
	st[B].insert(x);
	x=*st[B].rbegin();
	st[B].erase(--st[B].end());
	return x;
}
void BuildBlock(int B, int l, int r)
{
	pos[B].clear();
	for(int i=r;i>=l;i--)
	{
		while(pos[B].size() && a[pos[B].back()]<a[i]) pos[B].pop_back();
		pos[B].push_back(i);
	}
	for(int i:pos[B]) st[B].insert(a[i]);
}
void BreakBlock(int B)
{
	while(pos[B].size())
	{
		a[pos[B].back()]=*st[B].begin();
		pos[B].pop_back();
		st[B].erase(st[B].begin());
	}
}
int n,q;
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:60: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:61: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:66: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 99 ms 376 KB Output is correct
2 Correct 88 ms 484 KB Output is correct
3 Correct 94 ms 464 KB Output is correct
4 Correct 84 ms 376 KB Output is correct
5 Correct 84 ms 376 KB Output is correct
6 Correct 94 ms 376 KB Output is correct
7 Correct 206 ms 580 KB Output is correct
8 Correct 201 ms 476 KB Output is correct
9 Correct 93 ms 476 KB Output is correct
10 Correct 97 ms 376 KB Output is correct
11 Correct 368 ms 584 KB Output is correct
12 Correct 386 ms 632 KB Output is correct
13 Correct 426 ms 632 KB Output is correct
14 Correct 128 ms 376 KB Output is correct
15 Correct 123 ms 568 KB Output is correct
16 Correct 56 ms 576 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 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 316 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 85 ms 3880 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 376 KB Output is correct
2 Correct 88 ms 484 KB Output is correct
3 Correct 94 ms 464 KB Output is correct
4 Correct 84 ms 376 KB Output is correct
5 Correct 84 ms 376 KB Output is correct
6 Correct 94 ms 376 KB Output is correct
7 Correct 206 ms 580 KB Output is correct
8 Correct 201 ms 476 KB Output is correct
9 Correct 93 ms 476 KB Output is correct
10 Correct 97 ms 376 KB Output is correct
11 Correct 368 ms 584 KB Output is correct
12 Correct 386 ms 632 KB Output is correct
13 Correct 426 ms 632 KB Output is correct
14 Correct 128 ms 376 KB Output is correct
15 Correct 123 ms 568 KB Output is correct
16 Correct 56 ms 576 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 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 316 KB Output is correct
23 Runtime error 85 ms 3880 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -