Submission #898092

#	Time	Username	Problem	Language	Result	Execution time	Memory
898092		Litusiano	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3094 ms	4184 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'

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;
  while(q--){
  	int l,r,k; cin>>l>>r>>k; 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 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23