oj.uz

Submission #898103

# Submission time Handle Problem Language Result Execution time Memory
898103 2024-01-04T10:04:50 Z Litusiano Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
21 / 100
 363 ms 10380 KB 
#include<bits/stdc++.h>
using namespace std;

#define endl '\n'

struct MST{
	int n;
	vector<vector<int>> seg;
	void init(int n1){
		n = 1;
		while(n < n1) n*=2;

	}
};

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
  int n,q; cin>>n>>q;
  vector<int> v(n); for(int& i : v) cin>>i;
  vector<int> pre(n+1);
 	for(int i = 1; i<n; i++){
  	pre[i+1] = pre[i] + (v[i] < v[i-1]); 
  }
  while(q--){
  	int l,r,k; cin>>l>>r>>k;
  	if(n > 600){
  		if(pre[r] - pre[l] == 0) cout<<1<<endl;
  		else cout<<0<<endl;
  	}
  	else{
  		l--; r--;
  		int mx = 0;
	  	for(int i = l; i <= r; i++){
	  		for(int j = i+1; j<=r; j++){
	  			if(v[i] > v[j]) mx = max(mx,v[i] + v[j]); // ill have to swap them
	  		}
	  	}
	  	if(mx > k) cout<<0<<endl;
	  	else cout<<1<<endl;
  	}
  	
  	
  }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 22 ms 464 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 36 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 32 ms 348 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 10380 KB Output is correct
2 Correct 320 ms 10068 KB Output is correct
3 Correct 308 ms 10068 KB Output is correct
4 Correct 332 ms 10168 KB Output is correct
5 Correct 363 ms 10212 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 1376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 22 ms 464 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 36 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 32 ms 348 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 22 ms 464 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 36 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 32 ms 348 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -