제출 #422440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422440		Return_0	Financial Report (JOI21_financial)	C++17	60 / 100	4058 ms	46276 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 3e5 + 7;

struct segtree {
	ll l, r, mx;
	segtree *lt, *rt;
	inline segtree (cl &L = 1, cl &R = N - 2) : l(L), r(R), mx(0) {}

	void build () {
		if (l == r) return;
		lt = new segtree (l, mid);
		rt = new segtree (mid + 1, r);
		lt->build();
		rt->build();
	}

	void modify (cl &pos, cl &x) {
		if (l == r) { mx = x; return; }
		if (pos <= lt->r) lt->modify(pos, x);
		else rt->modify(pos, x);
		mx = max(lt->mx, rt->mx);
	}

	ll ask (cl &ql, cl &qr) {
		if (r < ql || qr < l) return 0;
		if (ql <= l && r <= qr) return mx;
		return max(lt->ask(ql, qr), rt->ask(ql, qr));
	}
} seg;

vector <pll> vec;
ll L [N], n, D;
set <ll> st;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> D;
	seg.r = n; seg.build();
	for (ll i = 1, x; i <= n; i++) {
		cin>> x;
		vec.push_back({x, -i});
	}

	sort(All(vec));
	for (auto [x, pos] : vec) {
		pos *= -1;
		L[pos] = pos;
		for (;;) {
			for (; L[L[pos]] != L[pos]; L[pos] = L[L[pos]]);
			auto it = st.lower_bound(L[pos]);
			if (it == st.begin()) break;
			it--;
			if (L[pos] - *it > D) break;
			L[pos] = L[*it];
		}
		st.insert(pos);
		seg.modify(pos, seg.ask(L[pos], pos) + 1);
	}

	kill(seg.mx);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
7 1
100 600 600 200 300 500 500

*/

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35