oj.uz

답안 #423151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423151 2021-06-10T18:57:45 Z abdzag Financial Report (JOI21_financial) C++17
60 / 100
 4000 ms 27720 KB 
#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;

using namespace std;

vector<ll> p(1e6);
vector<ll> Ur(1e6);
ll UfindSet(ll cur) {
	if (p[cur] == cur)return cur;
	return p[cur] = UfindSet(p[cur]);
}
void Umerge(ll j, ll i) {
	ll sj = UfindSet(j);
	ll si = UfindSet(i);
	if (Ur[sj] > Ur[si])swap(sj, si);
	p[sj] = si;
	Ur[si]++;
	return;
}
struct tree {
	typedef ll T;
	static constexpr T unit = -inf;
	T f(T a, T b) { return max(a, b); }
	vector<T> s;
	ll n;
	tree(ll n=0, T def=unit) : n(n),s(2*n,def){}

	void update(ll pos, T val) {
		for (s[pos += n] = val; pos /= 2;) {
			s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
		}
	}
	T query(ll l, ll r) {
		T a = unit, b = unit;
		for (l += n, r += n; l < r; l /= 2, r /= 2) {
			if (l % 2)a = f(a, s[l++]);
			if (r % 2)b = f(b, s[--r]);
		}
		return f(a, b);
	}
};
int main() {
	cin.sync_with_stdio(false);
	int n, d;
	cin >> n >> d;
	vector<pair<ll, int>> v(n);
	rep(i, 0, n) {
		cin >> v[i].first;
		v[i].second = -i;
	}
	sort(all(v));
	vector<ll> dp(n, -inf);
	rep(i, 0, 1e6)p[i] = i;
	tree seg(n);
	rep(i, 0, n) {
		dp[-v[i].second] = 1;
		ll cur = d;
		int end = max(-1, -v[i].second - d-1 );
		int start = -v[i].second;
		ll l = 0, r = d;
		while (l <= r) {
			int mid = l + (r - l) / 2;
			if (UfindSet(max(0, -v[i].second -mid)) == UfindSet(-v[i].second)) {
				start = -v[i].second - mid;
				r = mid - 1;
			}
			else l = mid + 1;
		}
		rrep(j, start, end) {
			Umerge(end+1, j);
		}

		ll left = -v[i].second - 1;
		l = 0, r = max(0,-v[i].second - 1);
		while (l <= r) {
			ll mid = l + (r - l) / 2;
			if (UfindSet(mid) == UfindSet(-v[i].second)) {
				left = mid;
				r = mid - 1;
			}
			else l = mid + 1;
		}
		ll FuckMinAndMax = 1;
		dp[-v[i].second] = max(FuckMinAndMax, seg.query(left, -v[i].second)+1);
		seg.update(-v[i].second, dp[-v[i].second]);
	}
	ll ans = 1;
	trav(a, dp)ans = max(ans, a);
	cout << ans << endl;
	return 0;
}

Compilation message

Main.cpp: In constructor 'tree::tree(ll, tree::T)':
Main.cpp:36:5: warning: 'tree::n' will be initialized after [-Wreorder]
   36 |  ll n;
      |     ^
Main.cpp:35:12: warning:   'std::vector<long long int> tree::s' [-Wreorder]
   35 |  vector<T> s;
      |            ^
Main.cpp:37:2: warning:   when initialized here [-Wreorder]
   37 |  tree(ll n=0, T def=unit) : n(n),s(2*n,def){}
      |  ^~~~
Main.cpp: In function 'int main()':
Main.cpp:68:6: warning: unused variable 'cur' [-Wunused-variable]
   68 |   ll cur = d;
      |      ^~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15948 KB Output is correct
2 Correct 8 ms 15948 KB Output is correct
3 Correct 8 ms 15940 KB Output is correct
4 Correct 8 ms 15948 KB Output is correct
5 Correct 9 ms 15948 KB Output is correct
6 Correct 8 ms 15948 KB Output is correct
7 Correct 9 ms 15948 KB Output is correct
8 Correct 9 ms 15912 KB Output is correct
9 Correct 8 ms 15948 KB Output is correct
10 Correct 8 ms 15948 KB Output is correct
11 Correct 8 ms 15904 KB Output is correct
12 Correct 8 ms 15916 KB Output is correct
13 Correct 8 ms 15948 KB Output is correct
14 Correct 8 ms 15988 KB Output is correct
15 Correct 8 ms 15948 KB Output is correct
16 Correct 8 ms 15976 KB Output is correct
17 Correct 8 ms 15948 KB Output is correct
18 Correct 8 ms 15948 KB Output is correct
19 Correct 8 ms 15980 KB Output is correct
20 Correct 8 ms 15948 KB Output is correct
21 Correct 8 ms 15948 KB Output is correct
22 Correct 8 ms 15948 KB Output is correct
23 Correct 8 ms 15948 KB Output is correct
24 Correct 9 ms 15948 KB Output is correct
25 Correct 8 ms 15976 KB Output is correct
26 Correct 9 ms 15948 KB Output is correct
27 Correct 9 ms 15996 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 9 ms 15908 KB Output is correct
30 Correct 8 ms 15948 KB Output is correct
31 Correct 9 ms 15948 KB Output is correct
32 Correct 10 ms 15948 KB Output is correct
33 Correct 9 ms 15948 KB Output is correct
34 Correct 9 ms 15948 KB Output is correct
35 Correct 9 ms 15988 KB Output is correct
36 Correct 9 ms 15948 KB Output is correct
37 Correct 9 ms 15988 KB Output is correct
38 Correct 8 ms 15988 KB Output is correct
39 Correct 8 ms 15948 KB Output is correct
40 Correct 8 ms 15948 KB Output is correct
41 Correct 12 ms 16220 KB Output is correct
42 Correct 12 ms 16204 KB Output is correct
43 Correct 12 ms 16256 KB Output is correct
44 Correct 13 ms 16220 KB Output is correct
45 Correct 25 ms 16204 KB Output is correct
46 Correct 214 ms 16152 KB Output is correct
47 Correct 12 ms 16204 KB Output is correct
48 Correct 13 ms 16204 KB Output is correct
49 Correct 14 ms 16204 KB Output is correct
50 Correct 16 ms 16160 KB Output is correct
51 Correct 12 ms 16216 KB Output is correct
52 Correct 12 ms 16196 KB Output is correct
53 Correct 12 ms 16204 KB Output is correct
54 Correct 15 ms 16204 KB Output is correct
55 Correct 31 ms 16240 KB Output is correct
56 Correct 30 ms 16204 KB Output is correct
57 Correct 15 ms 16204 KB Output is correct
58 Correct 217 ms 16248 KB Output is correct
59 Correct 245 ms 16252 KB Output is correct
60 Correct 28 ms 16204 KB Output is correct
61 Correct 28 ms 16204 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 27708 KB Output is correct
2 Correct 177 ms 27708 KB Output is correct
3 Correct 273 ms 27716 KB Output is correct
4 Correct 265 ms 27720 KB Output is correct
5 Correct 219 ms 27716 KB Output is correct
6 Correct 271 ms 27588 KB Output is correct
7 Correct 157 ms 27588 KB Output is correct
8 Correct 127 ms 27564 KB Output is correct
9 Correct 148 ms 27584 KB Output is correct
10 Correct 129 ms 27712 KB Output is correct
11 Correct 199 ms 27592 KB Output is correct
12 Correct 196 ms 27588 KB Output is correct
13 Correct 218 ms 27708 KB Output is correct
14 Correct 229 ms 27588 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4057 ms 27700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15948 KB Output is correct
2 Correct 8 ms 15948 KB Output is correct
3 Correct 8 ms 15940 KB Output is correct
4 Correct 8 ms 15948 KB Output is correct
5 Correct 9 ms 15948 KB Output is correct
6 Correct 8 ms 15948 KB Output is correct
7 Correct 9 ms 15948 KB Output is correct
8 Correct 9 ms 15912 KB Output is correct
9 Correct 8 ms 15948 KB Output is correct
10 Correct 8 ms 15948 KB Output is correct
11 Correct 8 ms 15904 KB Output is correct
12 Correct 8 ms 15916 KB Output is correct
13 Correct 8 ms 15948 KB Output is correct
14 Correct 8 ms 15988 KB Output is correct
15 Correct 8 ms 15948 KB Output is correct
16 Correct 8 ms 15976 KB Output is correct
17 Correct 8 ms 15948 KB Output is correct
18 Correct 8 ms 15948 KB Output is correct
19 Correct 8 ms 15980 KB Output is correct
20 Correct 8 ms 15948 KB Output is correct
21 Correct 8 ms 15948 KB Output is correct
22 Correct 8 ms 15948 KB Output is correct
23 Correct 8 ms 15948 KB Output is correct
24 Correct 9 ms 15948 KB Output is correct
25 Correct 8 ms 15976 KB Output is correct
26 Correct 9 ms 15948 KB Output is correct
27 Correct 9 ms 15996 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 9 ms 15908 KB Output is correct
30 Correct 8 ms 15948 KB Output is correct
31 Correct 9 ms 15948 KB Output is correct
32 Correct 10 ms 15948 KB Output is correct
33 Correct 9 ms 15948 KB Output is correct
34 Correct 9 ms 15948 KB Output is correct
35 Correct 9 ms 15988 KB Output is correct
36 Correct 9 ms 15948 KB Output is correct
37 Correct 9 ms 15988 KB Output is correct
38 Correct 8 ms 15988 KB Output is correct
39 Correct 8 ms 15948 KB Output is correct
40 Correct 8 ms 15948 KB Output is correct
41 Correct 12 ms 16220 KB Output is correct
42 Correct 12 ms 16204 KB Output is correct
43 Correct 12 ms 16256 KB Output is correct
44 Correct 13 ms 16220 KB Output is correct
45 Correct 25 ms 16204 KB Output is correct
46 Correct 214 ms 16152 KB Output is correct
47 Correct 12 ms 16204 KB Output is correct
48 Correct 13 ms 16204 KB Output is correct
49 Correct 14 ms 16204 KB Output is correct
50 Correct 16 ms 16160 KB Output is correct
51 Correct 12 ms 16216 KB Output is correct
52 Correct 12 ms 16196 KB Output is correct
53 Correct 12 ms 16204 KB Output is correct
54 Correct 15 ms 16204 KB Output is correct
55 Correct 31 ms 16240 KB Output is correct
56 Correct 30 ms 16204 KB Output is correct
57 Correct 15 ms 16204 KB Output is correct
58 Correct 217 ms 16248 KB Output is correct
59 Correct 245 ms 16252 KB Output is correct
60 Correct 28 ms 16204 KB Output is correct
61 Correct 28 ms 16204 KB Output is correct
62 Correct 131 ms 27708 KB Output is correct
63 Correct 177 ms 27708 KB Output is correct
64 Correct 273 ms 27716 KB Output is correct
65 Correct 265 ms 27720 KB Output is correct
66 Correct 219 ms 27716 KB Output is correct
67 Correct 271 ms 27588 KB Output is correct
68 Correct 157 ms 27588 KB Output is correct
69 Correct 127 ms 27564 KB Output is correct
70 Correct 148 ms 27584 KB Output is correct
71 Correct 129 ms 27712 KB Output is correct
72 Correct 199 ms 27592 KB Output is correct
73 Correct 196 ms 27588 KB Output is correct
74 Correct 218 ms 27708 KB Output is correct
75 Correct 229 ms 27588 KB Output is correct
76 Execution timed out 4057 ms 27700 KB Time limit exceeded
77 Halted 0 ms 0 KB -