Submission #497570

#	Time	Username	Problem	Language	Result	Execution time	Memory
497570		Nuraly_Serikbay	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	30 / 100	3058 ms	26052 KiB

sortbooks

/*	Speech to the young  */

#include <bits/stdc++.h>
 
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define Zymraq() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;

 
using namespace std;

#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

  
typedef long long ull;
typedef unsigned long long ll;
typedef string S;
typedef double D;
  
const int N = 1e6 + 17;
const int modd = 1e9 + 7;
const int INF = 2e9 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const D eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;
  
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
    return (a.second < b.second);
}

void pre (ll a) {
    cout << fixed << setprecision(a);
    return;
} 

ll n, q, a[N], pref[N];
ll b[N], mn = INF;

void Solutions () {
	cin >> n >> q;
	for (int i = 1; i <= n; ++ i) {
		cin >> a[i];
		mn = min (mn, a[i]);
	}
	for (int i = 1; i < n; ++ i) {
		if (a[i] > a[i + 1]) b[i] = 1;
		pref[i] = pref[i - 1] + b[i];
	}
	pref[n] = pref[n - 1];
	while (q --) {
		ll l, r, k, mx = 0;
		cin >> l >> r >> k;
		if (mn > k) {
			if (pref[r - 1] - pref[l - 1] == 0) cout << 1 << '\n';
			else cout << 0 << '\n';
			continue;
		}
		for (int i = l; i < r; ++ i) {
			for (int j = i + 1; j <= r; ++ j) {
				if (a[j] >= a[i]) break;
				mx = max (mx, a[i] + a[j]);
			}
		}
		if (mx > k) cout << 0 << '\n';
		else cout << 1 << '\n';
		
	}
	return;
}

int main(){
	Zymraq();
	Solutions ();
	exit (0);
}

Compilation message (stderr)

sortbooks.cpp: In function 'void Solutions()':
sortbooks.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   63 |  for (int i = 1; i <= n; ++ i) {
      |                  ~~^~~~
sortbooks.cpp:67:20: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   67 |  for (int i = 1; i < n; ++ i) {
      |                  ~~^~~
sortbooks.cpp:80:21: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   80 |   for (int i = l; i < r; ++ i) {
      |                   ~~^~~
sortbooks.cpp:81:26: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   81 |    for (int j = i + 1; j <= r; ++ j) {
      |                        ~~^~~~

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23