oj.uz

Submission #423150

# Submission time Handle Problem Language Result Execution time Memory
423150 2021-06-10T18:56:45 Z abdzag Financial Report (JOI21_financial) C++17
0 / 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 = 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
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15948 KB Output is correct
2 Correct 10 ms 16076 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15872 KB Output is correct
5 Correct 9 ms 15984 KB Output is correct
6 Correct 10 ms 15920 KB Output is correct
7 Correct 9 ms 15908 KB Output is correct
8 Correct 9 ms 15948 KB Output is correct
9 Correct 9 ms 15984 KB Output is correct
10 Correct 9 ms 15948 KB Output is correct
11 Correct 9 ms 15880 KB Output is correct
12 Correct 9 ms 15948 KB Output is correct
13 Correct 9 ms 15948 KB Output is correct
14 Correct 9 ms 15948 KB Output is correct
15 Incorrect 9 ms 15976 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15948 KB Output is correct
2 Correct 10 ms 16076 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15872 KB Output is correct
5 Correct 9 ms 15984 KB Output is correct
6 Correct 10 ms 15920 KB Output is correct
7 Correct 9 ms 15908 KB Output is correct
8 Correct 9 ms 15948 KB Output is correct
9 Correct 9 ms 15984 KB Output is correct
10 Correct 9 ms 15948 KB Output is correct
11 Correct 9 ms 15880 KB Output is correct
12 Correct 9 ms 15948 KB Output is correct
13 Correct 9 ms 15948 KB Output is correct
14 Correct 9 ms 15948 KB Output is correct
15 Incorrect 9 ms 15976 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15948 KB Output is correct
2 Correct 10 ms 16076 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15872 KB Output is correct
5 Correct 9 ms 15984 KB Output is correct
6 Correct 10 ms 15920 KB Output is correct
7 Correct 9 ms 15908 KB Output is correct
8 Correct 9 ms 15948 KB Output is correct
9 Correct 9 ms 15984 KB Output is correct
10 Correct 9 ms 15948 KB Output is correct
11 Correct 9 ms 15880 KB Output is correct
12 Correct 9 ms 15948 KB Output is correct
13 Correct 9 ms 15948 KB Output is correct
14 Correct 9 ms 15948 KB Output is correct
15 Incorrect 9 ms 15976 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 27708 KB Output is correct
2 Incorrect 125 ms 27588 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 27588 KB Output is correct
2 Correct 338 ms 27712 KB Output is correct
3 Correct 359 ms 27704 KB Output is correct
4 Correct 371 ms 27708 KB Output is correct
5 Correct 324 ms 27720 KB Output is correct
6 Correct 369 ms 27712 KB Output is correct
7 Execution timed out 4098 ms 27700 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15948 KB Output is correct
2 Correct 10 ms 16076 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15872 KB Output is correct
5 Correct 9 ms 15984 KB Output is correct
6 Correct 10 ms 15920 KB Output is correct
7 Correct 9 ms 15908 KB Output is correct
8 Correct 9 ms 15948 KB Output is correct
9 Correct 9 ms 15984 KB Output is correct
10 Correct 9 ms 15948 KB Output is correct
11 Correct 9 ms 15880 KB Output is correct
12 Correct 9 ms 15948 KB Output is correct
13 Correct 9 ms 15948 KB Output is correct
14 Correct 9 ms 15948 KB Output is correct
15 Incorrect 9 ms 15976 KB Output isn't correct
16 Halted 0 ms 0 KB -