oj.uz

Submission #942192

# Submission time Handle Problem Language Result Execution time Memory
942192 2024-03-10T10:40:11 Z pan Triple Jump (JOI19_jumps) C++17
100 / 100
 1219 ms 158376 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, srb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> piii;
typedef pair<pi, pi> pii;
ll const INF = 1e9;
ll n, q, l, r;
ll arr[500005], ans[500005];
vector<ll> nxt[500005];
vector<pi> queries[500005];
struct node{
 
    int s, e, m; 
    ll aval, summ, pv, lazy;
    node *l, *r; 
	node (int S, int E)
	{ 
       s = S, e = E, m = (s+e)/2;
       summ = pv = -INF;
       if (s==e) {aval = arr[s]; return;}
       l = new node(s, m); 
	   r = new node(m+1, e);
	   aval = max(l->aval, r->aval);
	   lazy = -INF;
 
    }
 
	void propogate()
	{
	   if (lazy==-INF) return;
	   if (s!=e)
	   {
		   l->lazy = max(l->lazy, lazy);
		   r->lazy = max(r->lazy, lazy);
           l->pv= max(l->pv, lazy);
           l->summ = max(l->summ, l->aval + lazy);
           r->pv= max(r->pv, lazy);
           r->summ = max(r->summ, r->aval + lazy);
	   }
	   lazy = -INF;
    }
    
	void update(int S, int E, ll V)
	{ 
	   propogate();
       if(s==S && e==E) 
       {
         lazy = max(lazy, V);
         pv= max(pv, V);
         summ = max(summ, aval + pv);
       }
       else{ 
           propogate();
           if(E <= m) l->update(S, E, V); 
           else if (m < S) r->update(S, E, V); 
           else l->update(S, m, V),r->update(m+1, E, V);
           l->propogate(),r->propogate();
		   summ = max(l->summ, r->summ);
          
       }
    }
	ll query(int S, int E)
	{
	   propogate(); 
       if(s == S && e == E) return summ; 
       propogate();
       if(E <= m) return l->query(S, E); 
       else if(S >= m+1) return r->query(S, E); 
       else return max(l->query(S, m), r->query(m+1, E)); 
   }
 
} *root;
 
 
 
int main()
{
	input(n);
	deque<ll> dq;
	for (ll i=0; i<n; ++i) input(arr[i]);
	input(q);
	for (ll i=0; i<q; ++i)
	{
		input2(l, r);
		l--; r--;
		queries[l].pb(mp(r, i));
	}
	
	// abuse monotonicity
	for (ll i=n-1; i>=0; --i)
	{
		while (dq.size() && arr[dq.back()]<arr[i]) dq.pop_back();
		if (dq.size()) nxt[i].pb(dq.back());
		dq.pb(i);
	}
	dq.clear();
	for (ll i=0; i<n; ++i)
	{
		while (dq.size() && arr[dq.back()]<arr[i]) dq.pop_back();
		if (dq.size()) nxt[dq.back()].pb(i);
		dq.pb(i);
	}
	// SGTREE
	
	root= new node(0, n-1);
	for (ll i=n-1; i>=0; --i)
	{
		//show(i);
		for (ll u: nxt[i])
		{
			//show2(u, u*2-i);
			ll dist = u-i;
		    if (u+dist<=n-1) root->update(u+dist, n-1, arr[i] + arr[u]);
		}
		for (pi q: queries[i])  {ans[q.s] = root ->query(i, q.f);}
	}
	for (ll i=0; i<q; ++i) print(ans[i], '\n');
	
	
	return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
jumps.cpp:103:2: note: in expansion of macro 'input'
  103 |  input(n);
      |  ^~~~~
jumps.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
jumps.cpp:105:25: note: in expansion of macro 'input'
  105 |  for (ll i=0; i<n; ++i) input(arr[i]);
      |                         ^~~~~
jumps.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
jumps.cpp:106:2: note: in expansion of macro 'input'
  106 |  input(q);
      |  ^~~~~
jumps.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input2(x, y) scanf("%lld%lld", &x, &y);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~
jumps.cpp:109:3: note: in expansion of macro 'input2'
  109 |   input2(l, r);
      |   ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27224 KB Output is correct
2 Correct 6 ms 27228 KB Output is correct
3 Correct 7 ms 27228 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 7 ms 27228 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 7 ms 27228 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27224 KB Output is correct
2 Correct 6 ms 27228 KB Output is correct
3 Correct 7 ms 27228 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 7 ms 27228 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 7 ms 27228 KB Output is correct
11 Correct 209 ms 47700 KB Output is correct
12 Correct 224 ms 47596 KB Output is correct
13 Correct 212 ms 50204 KB Output is correct
14 Correct 230 ms 50272 KB Output is correct
15 Correct 211 ms 50072 KB Output is correct
16 Correct 218 ms 49660 KB Output is correct
17 Correct 262 ms 49492 KB Output is correct
18 Correct 216 ms 49308 KB Output is correct
19 Correct 245 ms 50148 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 69260 KB Output is correct
2 Correct 84 ms 66936 KB Output is correct
3 Correct 84 ms 68532 KB Output is correct
4 Correct 132 ms 69464 KB Output is correct
5 Correct 131 ms 69460 KB Output is correct
6 Correct 138 ms 69468 KB Output is correct
7 Correct 130 ms 69464 KB Output is correct
8 Correct 129 ms 69456 KB Output is correct
9 Correct 131 ms 69452 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27224 KB Output is correct
2 Correct 6 ms 27228 KB Output is correct
3 Correct 7 ms 27228 KB Output is correct
4 Correct 7 ms 27228 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 7 ms 27228 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 7 ms 27228 KB Output is correct
11 Correct 209 ms 47700 KB Output is correct
12 Correct 224 ms 47596 KB Output is correct
13 Correct 212 ms 50204 KB Output is correct
14 Correct 230 ms 50272 KB Output is correct
15 Correct 211 ms 50072 KB Output is correct
16 Correct 218 ms 49660 KB Output is correct
17 Correct 262 ms 49492 KB Output is correct
18 Correct 216 ms 49308 KB Output is correct
19 Correct 245 ms 50148 KB Output is correct
20 Correct 163 ms 69260 KB Output is correct
21 Correct 84 ms 66936 KB Output is correct
22 Correct 84 ms 68532 KB Output is correct
23 Correct 132 ms 69464 KB Output is correct
24 Correct 131 ms 69460 KB Output is correct
25 Correct 138 ms 69468 KB Output is correct
26 Correct 130 ms 69464 KB Output is correct
27 Correct 129 ms 69456 KB Output is correct
28 Correct 131 ms 69452 KB Output is correct
29 Correct 1099 ms 155720 KB Output is correct
30 Correct 932 ms 149792 KB Output is correct
31 Correct 952 ms 153368 KB Output is correct
32 Correct 1110 ms 155860 KB Output is correct
33 Correct 1219 ms 155768 KB Output is correct
34 Correct 1145 ms 154384 KB Output is correct
35 Correct 1170 ms 154364 KB Output is correct
36 Correct 1151 ms 154116 KB Output is correct
37 Correct 1192 ms 154984 KB Output is correct
38 Correct 626 ms 158376 KB Output is correct
39 Correct 623 ms 158288 KB Output is correct
40 Correct 633 ms 155764 KB Output is correct
41 Correct 594 ms 155472 KB Output is correct
42 Correct 641 ms 155648 KB Output is correct
43 Correct 613 ms 156692 KB Output is correct
44 Correct 687 ms 157968 KB Output is correct
45 Correct 698 ms 157932 KB Output is correct
46 Correct 676 ms 155852 KB Output is correct
47 Correct 641 ms 155620 KB Output is correct
48 Correct 623 ms 155476 KB Output is correct
49 Correct 621 ms 156940 KB Output is correct
50 Correct 750 ms 157468 KB Output is correct
51 Correct 747 ms 157672 KB Output is correct
52 Correct 740 ms 155476 KB Output is correct
53 Correct 744 ms 155976 KB Output is correct
54 Correct 759 ms 155620 KB Output is correct
55 Correct 742 ms 156668 KB Output is correct