oj.uz

Submission #937486

# Submission time Handle Problem Language Result Execution time Memory
937486 2024-03-04T06:55:03 Z Teemka Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 58968 KB 
#include "bits/stdc++.h" 
#define F first
#define S second
#define ALL(a) a.begin() , a.end()

#ifndef ONLINE_JUDGE
#define OK  cout << __LINE__ << "| "<< "---------------------------OK-----------------------" << endl;
#define deb(x) cout << __LINE__ << "| "<< #x  << " = " << x << endl;
#else
#define OK  
#define deb(x) 
#endif
 
typedef long double ld;
typedef long long ll;
using namespace std ;
const ll N = 1e6 + 7 ;	
const ll INF = 1e9;
const ll mod = 1e9 + 7 ;
const double eps = 1e-9 ;
const int dx[]  = { 0 , 0 , 1 , -1, 1 , -1 , 1 , -1} , dy[] = {1 , -1 , 0 , 0 , 1 , 1, -1 , -1}  ;
int n , q, a[N] ;
set<int> st;
void test_solve(int test_index){
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}

	for(int query = 1; query <= q ; query++){
		int l , r , k , ans = 1;
		cin >>  l >> r >> k;
		set<int, greater<>> st;
		for(int i = l; i<=r ; i++){
			if(st.size() and *st.begin() > a[i] and *st.begin() + a[i] > k){
				ans = 0;
				break;
			}
			st.insert(a[i]);
		}
		cout << ans << endl;
	}
}

signed main(){
	ios_base::sync_with_stdio(false) ;
    cin.tie(0) ;
    cout.tie(0); 
	int test = 1;
	//cin >> test ;
	for(int i = 1 ;  i <= test ; i++){
 //		cout << "Case " << i << ": " ; 
		test_solve(i) ;
	}
  	return 0;	
}

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 8 ms 604 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 13 ms 600 KB Output is correct
16 Correct 702 ms 816 KB Output is correct
17 Correct 610 ms 748 KB Output is correct
18 Correct 32 ms 344 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1512 ms 38044 KB Output is correct
2 Correct 1511 ms 38976 KB Output is correct
3 Correct 1542 ms 39004 KB Output is correct
4 Correct 1481 ms 39260 KB Output is correct
5 Execution timed out 3042 ms 58968 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 8 ms 604 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 13 ms 600 KB Output is correct
16 Correct 702 ms 816 KB Output is correct
17 Correct 610 ms 748 KB Output is correct
18 Correct 32 ms 344 KB Output is correct
19 Execution timed out 3048 ms 13656 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 8 ms 604 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 13 ms 600 KB Output is correct
16 Correct 702 ms 816 KB Output is correct
17 Correct 610 ms 748 KB Output is correct
18 Correct 32 ms 344 KB Output is correct
19 Correct 1512 ms 38044 KB Output is correct
20 Correct 1511 ms 38976 KB Output is correct
21 Correct 1542 ms 39004 KB Output is correct
22 Correct 1481 ms 39260 KB Output is correct
23 Execution timed out 3042 ms 58968 KB Time limit exceeded
24 Halted 0 ms 0 KB -