Submission #898101

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
898101	2024-01-04T10:03:57 Z	Litusiano	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	389 ms	10504 KB

sortbooks

#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{
  		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
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	3 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	3 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	313 ms	10504 KB	Output is correct
2	Correct	330 ms	10304 KB	Output is correct
3	Correct	313 ms	10064 KB	Output is correct
4	Correct	389 ms	10068 KB	Output is correct
5	Correct	319 ms	10260 KB	Output is correct