답안 #161582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
161582	2019-11-03T07:53:18 Z	MvC	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	64 / 100	3000 ms	10504 KB

sortbooks

#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=2000;
const int nmax=2e6+50;
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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 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	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 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	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 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	11 ms	504 KB	Output is correct
13	Correct	12 ms	504 KB	Output is correct
14	Correct	17 ms	508 KB	Output is correct
15	Correct	18 ms	508 KB	Output is correct
16	Correct	17 ms	504 KB	Output is correct
17	Correct	9 ms	504 KB	Output is correct
18	Correct	15 ms	468 KB	Output is correct

Subtask #3
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	3011 ms	10504 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	414 ms	1532 KB	Output is correct
2	Correct	523 ms	1396 KB	Output is correct
3	Correct	343 ms	1400 KB	Output is correct
4	Correct	343 ms	1384 KB	Output is correct
5	Correct	323 ms	1492 KB	Output is correct
6	Correct	483 ms	1400 KB	Output is correct
7	Correct	488 ms	1528 KB	Output is correct
8	Correct	370 ms	1448 KB	Output is correct
9	Correct	70 ms	632 KB	Output is correct
10	Correct	359 ms	1420 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 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	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 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	11 ms	504 KB	Output is correct
13	Correct	12 ms	504 KB	Output is correct
14	Correct	17 ms	508 KB	Output is correct
15	Correct	18 ms	508 KB	Output is correct
16	Correct	17 ms	504 KB	Output is correct
17	Correct	9 ms	504 KB	Output is correct
18	Correct	15 ms	468 KB	Output is correct
19	Correct	961 ms	2592 KB	Output is correct
20	Correct	941 ms	2444 KB	Output is correct
21	Correct	1584 ms	2424 KB	Output is correct
22	Correct	1323 ms	2496 KB	Output is correct
23	Correct	1344 ms	2460 KB	Output is correct
24	Correct	752 ms	2452 KB	Output is correct
25	Correct	762 ms	2328 KB	Output is correct
26	Correct	740 ms	2532 KB	Output is correct
27	Correct	735 ms	2412 KB	Output is correct
28	Correct	735 ms	2520 KB	Output is correct
29	Correct	713 ms	2396 KB	Output is correct
30	Correct	690 ms	2608 KB	Output is correct
31	Correct	712 ms	2472 KB	Output is correct
32	Correct	728 ms	2428 KB	Output is correct
33	Correct	706 ms	2560 KB	Output is correct
34	Correct	1012 ms	2520 KB	Output is correct
35	Correct	1010 ms	2476 KB	Output is correct
36	Correct	1010 ms	2584 KB	Output is correct
37	Correct	1016 ms	2520 KB	Output is correct
38	Correct	1031 ms	2604 KB	Output is correct
39	Correct	813 ms	2552 KB	Output is correct
40	Correct	539 ms	1840 KB	Output is correct
41	Correct	874 ms	2572 KB	Output is correct

Subtask #6
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 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	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 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	11 ms	504 KB	Output is correct
13	Correct	12 ms	504 KB	Output is correct
14	Correct	17 ms	508 KB	Output is correct
15	Correct	18 ms	508 KB	Output is correct
16	Correct	17 ms	504 KB	Output is correct
17	Correct	9 ms	504 KB	Output is correct
18	Correct	15 ms	468 KB	Output is correct
19	Execution timed out	3011 ms	10504 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

답안 #161582

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 9.0 / 9.0

Subtask #3 0 / 13.0

Subtask #4 17.0 / 17.0

Subtask #5 30.0 / 30.0

Subtask #6 0 / 23.0

Subtask #1
8.0 / 8.0

Subtask #2
9.0 / 9.0

Subtask #3
0 / 13.0

Subtask #4
17.0 / 17.0

Subtask #5
30.0 / 30.0

Subtask #6
0 / 23.0