제출 #942162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942162		pan	3단 점프 (JOI19_jumps)	C++17	32 / 100	207 ms	69512 KiB

jumps

#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;
	   pv = max(pv, lazy);
	   summ = max(summ, aval + pv);
	   if (s!=e)
	   {
		   l->lazy = max(l->lazy, lazy);
		   r->lazy = max(r->lazy, lazy);
	   }
	   lazy = -INF;
    }
    
	void update(int S, int E, ll V)
	{ 
	   propogate();
       if(s==S && e==E) {lazy = max(lazy, V);}
       else{ 
           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; 
       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;
}

컴파일 시 표준 에러 (stderr) 메시지

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:94:2: note: in expansion of macro 'input'
   94 |  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:96:25: note: in expansion of macro 'input'
   96 |  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:97:2: note: in expansion of macro 'input'
   97 |  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:100:3: note: in expansion of macro 'input2'
  100 |   input2(l, r);
      |   ^~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 27 / 27
• Subtask 4: 0 / 54