Submission #236391

#	Time	Username	Problem	Language	Result	Execution time	Memory
236391		_7_7_	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	1928 ms	108444 KiB

sortbooks

#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e6 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int n, m, a[N], l[N], r[N], k[N], b[N], t[N << 2], res[N];
vi g[N];
stack < int > s;

void update (int pos, int x, int v = 1, int tl = 1, int tr = n) {
    t[v] = max(t[v], x);
	if (tl == tr)  
		return;

	int tm = (tl + tr) >> 1;
	if (pos <= tm)		
		update(pos, x, v << 1, tl, tm);
	else
		update(pos, x, v << 1 | 1, tm + 1, tr);
	t[v] = max(t[v << 1], t[v << 1 | 1]);
}

int get (int l, int r, int v = 1, int tl = 1, int tr = n) {
	if (l > r || l > tr || tl > r)
		return 0;

	if (l <= tl && tr <= r)
		return t[v];

	int tm = (tl + tr) >> 1;
	return max(get(l, r, v << 1, tl, tm), get(l, r, v << 1 | 1, tm + 1, tr));
}


main () {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	
	for (int i = 1; i <= n; ++i) {
		while (sz(s) && a[s.top()] <= a[i])
			s.pop();

		if (sz(s))
			b[i] = s.top();
		s.push(i);
	}

	for (int i = 1; i <= m; ++i) {
		scanf("%d%d%d", &l[i], &r[i], &k[i]);
		g[r[i]].pb(i);
	}

//	for (int i = 1; i <= n; ++i)
//		cerr << i << ' ' << b[i] << endl;

	for (int r = 1; r <= n; ++r) {
		if (b[r])
			update(b[r], a[b[r]] + a[r]);
		for (auto i : g[r])
			res[i] = (get(l[i], r) <= k[i]);
	}


	for (int i = 1; i <= m; ++i)
		printf("%d\n", res[i]);	

		

}

Compilation message (stderr)

sortbooks.cpp:69:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &l[i], &r[i], &k[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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