oj.uz

Submission #1040372

# Submission time Handle Problem Language Result Execution time Memory
1040372 2024-08-01T02:37:36 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
 3000 ms 4180 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n , q ; 
int a [maxn] ; 

void sub_trau () 
{
	while ( q -- ) 
	{
		int l,r,k ; cin >> l >> r >> k ; 
		int res = 0 ; 
		for ( int i = l ; i <= r ; i ++ ) 
		{
			for ( int j = i+1 ; j <= r ; j ++ ) 
			{
				if ( a[i] > a[j] ) chkmax (res,a[i]+a[j]) ; 
			}
		}
		if ( res <= k ) cout << 1 << "\n" ; 
		else cout << 0 << "\n" ; 
	}
}
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 	
	cin >> n >> q ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	
	sub_trau () ; 
}

Compilation message

sortbooks.cpp: In function 'void rf()':
sortbooks.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 21 ms 348 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 19 ms 348 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 21 ms 348 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 523 ms 600 KB Output is correct
12 Execution timed out 3066 ms 560 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 4180 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 21 ms 348 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 523 ms 600 KB Output is correct
12 Execution timed out 3066 ms 560 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 21 ms 348 KB Output is correct
9 Correct 6 ms 472 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 523 ms 600 KB Output is correct
12 Execution timed out 3066 ms 560 KB Time limit exceeded
13 Halted 0 ms 0 KB -