답안 #422453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422453	2021-06-10T06:53:37 Z	Return_0	Financial Report (JOI21_financial)	C++17	100 / 100	838 ms	46304 KB

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;

ll root (cl &v) { return L[v] = L[v] == v ? v : root(L[v]); }
inline void unite (ll v, ll u) { v = root(v); u = root(u); L[max(v, u)] = min(v, u); }

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;
		auto it = st.lower_bound(L[pos]);
		if (it != st.end() && *it - pos <= D) unite(pos, *it);
		if (it != st.begin() && pos - *prev(it) <= D) unite(pos, *(--it));
		st.insert(pos);
		seg.modify(pos, seg.ask(root(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.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	236 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	236 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	236 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	10 ms	1356 KB	Output is correct
42	Correct	8 ms	1356 KB	Output is correct
43	Correct	9 ms	1356 KB	Output is correct
44	Correct	7 ms	1228 KB	Output is correct
45	Correct	9 ms	1284 KB	Output is correct
46	Correct	11 ms	1356 KB	Output is correct
47	Correct	10 ms	1228 KB	Output is correct
48	Correct	10 ms	1340 KB	Output is correct
49	Correct	8 ms	1356 KB	Output is correct
50	Correct	8 ms	1356 KB	Output is correct
51	Correct	6 ms	1356 KB	Output is correct
52	Correct	8 ms	1356 KB	Output is correct
53	Correct	5 ms	1356 KB	Output is correct
54	Correct	9 ms	1296 KB	Output is correct
55	Correct	11 ms	1280 KB	Output is correct
56	Correct	10 ms	1348 KB	Output is correct
57	Correct	9 ms	1356 KB	Output is correct
58	Correct	7 ms	1356 KB	Output is correct
59	Correct	6 ms	1356 KB	Output is correct
60	Correct	9 ms	1356 KB	Output is correct
61	Correct	7 ms	1356 KB	Output is correct

Subtask #4
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	291 ms	46092 KB	Output is correct
2	Correct	353 ms	46020 KB	Output is correct
3	Correct	602 ms	46032 KB	Output is correct
4	Correct	789 ms	45984 KB	Output is correct
5	Correct	538 ms	46064 KB	Output is correct
6	Correct	773 ms	46024 KB	Output is correct
7	Correct	294 ms	45776 KB	Output is correct
8	Correct	261 ms	45936 KB	Output is correct
9	Correct	239 ms	46000 KB	Output is correct
10	Correct	241 ms	46084 KB	Output is correct
11	Correct	416 ms	45992 KB	Output is correct
12	Correct	508 ms	46104 KB	Output is correct
13	Correct	677 ms	46072 KB	Output is correct
14	Correct	830 ms	46088 KB	Output is correct

Subtask #5
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	289 ms	46056 KB	Output is correct
2	Correct	588 ms	46132 KB	Output is correct
3	Correct	659 ms	45988 KB	Output is correct
4	Correct	728 ms	46008 KB	Output is correct
5	Correct	596 ms	45992 KB	Output is correct
6	Correct	721 ms	46072 KB	Output is correct
7	Correct	258 ms	45984 KB	Output is correct
8	Correct	298 ms	46088 KB	Output is correct
9	Correct	250 ms	45736 KB	Output is correct
10	Correct	388 ms	46012 KB	Output is correct
11	Correct	740 ms	46028 KB	Output is correct
12	Correct	574 ms	46020 KB	Output is correct

Subtask #6
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	236 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	10 ms	1356 KB	Output is correct
42	Correct	8 ms	1356 KB	Output is correct
43	Correct	9 ms	1356 KB	Output is correct
44	Correct	7 ms	1228 KB	Output is correct
45	Correct	9 ms	1284 KB	Output is correct
46	Correct	11 ms	1356 KB	Output is correct
47	Correct	10 ms	1228 KB	Output is correct
48	Correct	10 ms	1340 KB	Output is correct
49	Correct	8 ms	1356 KB	Output is correct
50	Correct	8 ms	1356 KB	Output is correct
51	Correct	6 ms	1356 KB	Output is correct
52	Correct	8 ms	1356 KB	Output is correct
53	Correct	5 ms	1356 KB	Output is correct
54	Correct	9 ms	1296 KB	Output is correct
55	Correct	11 ms	1280 KB	Output is correct
56	Correct	10 ms	1348 KB	Output is correct
57	Correct	9 ms	1356 KB	Output is correct
58	Correct	7 ms	1356 KB	Output is correct
59	Correct	6 ms	1356 KB	Output is correct
60	Correct	9 ms	1356 KB	Output is correct
61	Correct	7 ms	1356 KB	Output is correct
62	Correct	291 ms	46092 KB	Output is correct
63	Correct	353 ms	46020 KB	Output is correct
64	Correct	602 ms	46032 KB	Output is correct
65	Correct	789 ms	45984 KB	Output is correct
66	Correct	538 ms	46064 KB	Output is correct
67	Correct	773 ms	46024 KB	Output is correct
68	Correct	294 ms	45776 KB	Output is correct
69	Correct	261 ms	45936 KB	Output is correct
70	Correct	239 ms	46000 KB	Output is correct
71	Correct	241 ms	46084 KB	Output is correct
72	Correct	416 ms	45992 KB	Output is correct
73	Correct	508 ms	46104 KB	Output is correct
74	Correct	677 ms	46072 KB	Output is correct
75	Correct	830 ms	46088 KB	Output is correct
76	Correct	289 ms	46056 KB	Output is correct
77	Correct	588 ms	46132 KB	Output is correct
78	Correct	659 ms	45988 KB	Output is correct
79	Correct	728 ms	46008 KB	Output is correct
80	Correct	596 ms	45992 KB	Output is correct
81	Correct	721 ms	46072 KB	Output is correct
82	Correct	258 ms	45984 KB	Output is correct
83	Correct	298 ms	46088 KB	Output is correct
84	Correct	250 ms	45736 KB	Output is correct
85	Correct	388 ms	46012 KB	Output is correct
86	Correct	740 ms	46028 KB	Output is correct
87	Correct	574 ms	46020 KB	Output is correct
88	Correct	699 ms	46080 KB	Output is correct
89	Correct	749 ms	46016 KB	Output is correct
90	Correct	788 ms	46004 KB	Output is correct
91	Correct	786 ms	46088 KB	Output is correct
92	Correct	460 ms	46208 KB	Output is correct
93	Correct	708 ms	46016 KB	Output is correct
94	Correct	773 ms	46036 KB	Output is correct
95	Correct	647 ms	46048 KB	Output is correct
96	Correct	697 ms	46088 KB	Output is correct
97	Correct	750 ms	46128 KB	Output is correct
98	Correct	730 ms	45980 KB	Output is correct
99	Correct	716 ms	46028 KB	Output is correct
100	Correct	701 ms	45980 KB	Output is correct
101	Correct	251 ms	46104 KB	Output is correct
102	Correct	329 ms	46016 KB	Output is correct
103	Correct	367 ms	46112 KB	Output is correct
104	Correct	336 ms	46016 KB	Output is correct
105	Correct	591 ms	46304 KB	Output is correct
106	Correct	385 ms	46092 KB	Output is correct
107	Correct	502 ms	46052 KB	Output is correct
108	Correct	794 ms	46100 KB	Output is correct
109	Correct	459 ms	45996 KB	Output is correct
110	Correct	752 ms	45996 KB	Output is correct
111	Correct	838 ms	46088 KB	Output is correct
112	Correct	399 ms	46120 KB	Output is correct
113	Correct	719 ms	45984 KB	Output is correct
114	Correct	837 ms	46024 KB	Output is correct
115	Correct	290 ms	46216 KB	Output is correct
116	Correct	296 ms	46000 KB	Output is correct
117	Correct	348 ms	46064 KB	Output is correct
118	Correct	348 ms	46052 KB	Output is correct
119	Correct	430 ms	46044 KB	Output is correct
120	Correct	435 ms	46028 KB	Output is correct

답안 #422453

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 14.0 / 14.0

Subtask #3 20.0 / 20.0

Subtask #4 12.0 / 12.0

Subtask #5 5.0 / 5.0

Subtask #6 35.0 / 35.0

Subtask #1
14.0 / 14.0

Subtask #2
14.0 / 14.0

Subtask #3
20.0 / 20.0

Subtask #4
12.0 / 12.0

Subtask #5
5.0 / 5.0

Subtask #6
35.0 / 35.0