제출 #245264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245264		Yera	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3076 ms	59176 KiB

sortbooks

// In The Name Of God
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sagyndym_seni ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const ll N = 2e5+5, p1 = 911382323, p2 = 972663749, mod = 1e9+123;

inline int read(){
	char c = getchar_unlocked();
	bool minus = 0;
	while (c < '0' || '9' < c){
		if(c == '-'){ minus = 1;}
		c = getchar_unlocked();
		if(c == '-'){ minus = 1;}
	}
	int res = 0;
	while ('0' <= c && c <= '9') {
		res = (res << 3) + (res << 1) + c - '0';
		c = getchar_unlocked();
	}
	if(minus){ res *= -1;}
	return res;
}

struct node{
	int max_val, max_inv;
	vector<int> v;
	bool operator == (const node& B) const{
		return (max_val == B.max_val);
	}
};

int n, m;
vector<int> a;
node t[N << 2], badAss;

void build(int v, int vl, int vr){
	if(vl == vr){
		t[v].max_val = a[vl];
		t[v].max_inv = 0;
		t[v].v = vector<int> (1, a[vl]);
		return;
	}
	int vm = (vl + vr) >> 1;
	build(v*2+1, vl, vm);
	build(v*2+2, vm+1, vr);
	t[v].max_val = max(t[v*2+1].max_val, t[v*2+2].max_val);
	t[v].max_inv = max(t[v*2+1].max_inv, t[v*2+2].max_inv);
	merge(all(t[v*2+1].v), all(t[v*2+2].v), back_inserter(t[v].v));
	if(t[v*2+1].max_val > t[v*2+2].v[0]){
		t[v].max_inv = max(t[v].max_inv, *(--lower_bound(all(t[v*2+2].v), t[v*2+1].max_val)) + t[v*2+1].max_val);
	}
}

node query(int v, int vl, int vr, int l, int r){
	if(vl > r || vr < l){ return badAss;}
	if(l <= vl && vr <= r){ return t[v];}
	int vm = (vl + vr) >> 1;
	node q1 = query(v*2+1, vl, vm, l, r);
	node q2 = query(v*2+2, vm+1, vr, l, r);
	if(q1 == badAss){ return q2;}
	if(q2 == badAss){ return q1;}
	node res;
	res.max_val = max(q1.max_val, q2.max_val);
	res.max_inv = max(q1.max_inv, q2.max_inv);
	merge(all(q1.v), all(q2.v), back_inserter(res.v));
	if(q1.max_val > q2.v[0]){
		res.max_inv = max(res.max_inv, *(--lower_bound(all(q2.v), q1.max_val)) + q1.max_val);
	}
	return res;
}

int main(){
	sagyndym_seni;
	badAss.max_val = -1;
	badAss.max_inv = -1;
	badAss.v = vector<int>(1, -1);
	
	n = read(); m = read();
	a.resize(n);
	for(int i = 0; i < n; i++){
		a[i] = read();
	}
	build(0, 0, n - 1);
	while(m--){
		int l = read()-1, r = read()-1, k = read();
		node res = query(0, 0, n-1, l, r);
		res.max_inv <= k ? putchar_unlocked('1') : putchar_unlocked('0');
		putchar_unlocked('\n');
	}
	return 0;
}
/* TIMUS: 292220YC*/

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