oj.uz

Submission #161563

# Submission time Handle Problem Language Result Execution time Memory
161563 2019-11-03T06:56:44 Z MvC Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
8 / 100
 3000 ms 14184 KB 
#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 nmax=1e6+50;
const int mod=1e9+7;
using namespace std;
int n,m,a[nmax],mx,i,j,l,r,k;
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=1;i<=n;i++)cin>>a[i];
	while(m--)
	{
		cin>>l>>r>>k;
		mx=0;
		for(i=l;i<=r;i++)
		{
			for(j=i+1;j<=r;j++)if(a[j]<a[i])mx=max(mx,a[j]+a[i]);
		}
		if(mx<=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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 32 ms 380 KB Output is correct
7 Correct 32 ms 440 KB Output is correct
8 Correct 43 ms 376 KB Output is correct
9 Correct 13 ms 376 KB Output is correct
10 Correct 35 ms 504 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 32 ms 380 KB Output is correct
7 Correct 32 ms 440 KB Output is correct
8 Correct 43 ms 376 KB Output is correct
9 Correct 13 ms 376 KB Output is correct
10 Correct 35 ms 504 KB Output is correct
11 Correct 1547 ms 600 KB Output is correct
12 Execution timed out 3061 ms 376 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 32 ms 380 KB Output is correct
7 Correct 32 ms 440 KB Output is correct
8 Correct 43 ms 376 KB Output is correct
9 Correct 13 ms 376 KB Output is correct
10 Correct 35 ms 504 KB Output is correct
11 Correct 1547 ms 600 KB Output is correct
12 Execution timed out 3061 ms 376 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 32 ms 380 KB Output is correct
7 Correct 32 ms 440 KB Output is correct
8 Correct 43 ms 376 KB Output is correct
9 Correct 13 ms 376 KB Output is correct
10 Correct 35 ms 504 KB Output is correct
11 Correct 1547 ms 600 KB Output is correct
12 Execution timed out 3061 ms 376 KB Time limit exceeded
13 Halted 0 ms 0 KB -