oj.uz

Submission #419971

# Submission time Handle Problem Language Result Execution time Memory
419971 2021-06-07T20:08:42 Z dorijanlendvaj Financial Report (JOI21_financial) C++14
100 / 100
 903 ms 68420 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

template<class T>
vi compress(vector<T>&v)
{
	set<T> s;
	for (auto a: v) s.insert(a);
	vector<T> o(all(s));
	vi nv;
	for (int i=0;i<(int)v.size();++i) nv.pb(lower_bound(all(o),v[i])-o.begin());
	return nv;
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
const int N=300010,M=1<<19;
int d,n,seg[M*2+10],dp[N];
vi del[N],imb[N];
array<int,4> seg2[M*2+10],nul={1,1,1,1},jed={0,0,0,1},id={0,0,0,0};
multiset<int> im[N];

array<int,4> mer(array<int,4> a,array<int,4> b) //left, right, ans, length
{
	array<int,4> c;
	if (a[0]==a[3]) c[0]=a[0]+b[0];
	else c[0]=a[0];
	if (b[1]==b[3]) c[1]=a[1]+b[1];
	else c[1]=b[1];
	c[2]=max(max(a[2],b[2]),a[1]+b[0]);
	c[3]=a[3]+b[3];
	return c;
}

void upd(int i,array<int,4> x)
{
	seg2[i+=M]=x;
	for (i/=2;i;i/=2) seg2[i]=mer(seg2[i*2],seg2[i*2+1]);
}

int gef(int i)
{
	i+=M;
	array<int,4> cur=seg2[i];
	while (i>1)
	{
		if (i%2==0)
		{
			auto cuu=mer(cur,seg2[i^1]);
			if (cuu[2]>=d)
			{
				i^=1;
				while (i<M)
				{
					auto cu1=mer(cur,seg2[i*2]);
					if (cu1[2]>=d) i=i*2;
					else cur=cu1,i=i*2+1;
				}
				return i-M;
			}
			cur=cuu;
		}
		i/=2;
	}
	return n+2;
}

void upd(int i,int x)
{
	seg[i+=M]=x;
	for (i/=2;i;i/=2) seg[i]=max(seg[i*2],seg[i*2+1]);
}

int ge(int l,int r,int lo=0,int hi=M,int i=1)
{
	if (lo>=l && hi<=r) return seg[i];
	if (lo>=r || hi<=l) return 0;
	int mid=(lo+hi)/2;
	return max(ge(l,r,lo,mid,i*2),ge(l,r,mid,hi,i*2+1));
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>d;
	vi h(n);
	for (auto&a: h) cin>>a;
	h=compress(h);
	for (int i=0;i<n;++i) imb[h[i]].pb(i),upd(i,nul);
	for (int i=0;i<n;++i)
	{
		for (auto a: imb[i]) upd(a,jed);
		for (auto a: imb[i]) del[gef(a)].pb(a);
	}
	for (int i=0;i<n;++i)
	{
		dp[i]=ge(0,h[i])+1;
		im[h[i]].insert(dp[i]);
		upd(h[i],*im[h[i]].rbegin());
		for (auto u: del[i])
		{
			//cout<<"de "<<i<<' '<<u<<en;
			im[h[u]].erase(im[h[u]].find(dp[u]));
			if (im[h[u]].empty()) upd(h[u],0);
			else upd(h[u],*im[h[u]].rbegin());
		}
		//cout<<"an" <<i<<' '<<dp[i]<<en;
	}
	cout<<ge(0,n)<<en;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28620 KB Output is correct
2 Correct 15 ms 28612 KB Output is correct
3 Correct 15 ms 28516 KB Output is correct
4 Correct 16 ms 28492 KB Output is correct
5 Correct 16 ms 28528 KB Output is correct
6 Correct 16 ms 28620 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 18 ms 28544 KB Output is correct
9 Correct 16 ms 28620 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28628 KB Output is correct
12 Correct 16 ms 28560 KB Output is correct
13 Correct 16 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28620 KB Output is correct
16 Correct 18 ms 28508 KB Output is correct
17 Correct 15 ms 28620 KB Output is correct
18 Correct 15 ms 28620 KB Output is correct
19 Correct 15 ms 28556 KB Output is correct
20 Correct 15 ms 28620 KB Output is correct
21 Correct 18 ms 28520 KB Output is correct
22 Correct 16 ms 28564 KB Output is correct
23 Correct 16 ms 28620 KB Output is correct
24 Correct 16 ms 28620 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 17 ms 28572 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28620 KB Output is correct
2 Correct 15 ms 28612 KB Output is correct
3 Correct 15 ms 28516 KB Output is correct
4 Correct 16 ms 28492 KB Output is correct
5 Correct 16 ms 28528 KB Output is correct
6 Correct 16 ms 28620 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 18 ms 28544 KB Output is correct
9 Correct 16 ms 28620 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28628 KB Output is correct
12 Correct 16 ms 28560 KB Output is correct
13 Correct 16 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28620 KB Output is correct
16 Correct 18 ms 28508 KB Output is correct
17 Correct 15 ms 28620 KB Output is correct
18 Correct 15 ms 28620 KB Output is correct
19 Correct 15 ms 28556 KB Output is correct
20 Correct 15 ms 28620 KB Output is correct
21 Correct 18 ms 28520 KB Output is correct
22 Correct 16 ms 28564 KB Output is correct
23 Correct 16 ms 28620 KB Output is correct
24 Correct 16 ms 28620 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 17 ms 28572 KB Output is correct
27 Correct 16 ms 28596 KB Output is correct
28 Correct 17 ms 28620 KB Output is correct
29 Correct 17 ms 28620 KB Output is correct
30 Correct 18 ms 28620 KB Output is correct
31 Correct 17 ms 28588 KB Output is correct
32 Correct 16 ms 28620 KB Output is correct
33 Correct 16 ms 28652 KB Output is correct
34 Correct 17 ms 28592 KB Output is correct
35 Correct 18 ms 28568 KB Output is correct
36 Correct 18 ms 28652 KB Output is correct
37 Correct 17 ms 28620 KB Output is correct
38 Correct 17 ms 28600 KB Output is correct
39 Correct 16 ms 28660 KB Output is correct
40 Correct 16 ms 28676 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28620 KB Output is correct
2 Correct 15 ms 28612 KB Output is correct
3 Correct 15 ms 28516 KB Output is correct
4 Correct 16 ms 28492 KB Output is correct
5 Correct 16 ms 28528 KB Output is correct
6 Correct 16 ms 28620 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 18 ms 28544 KB Output is correct
9 Correct 16 ms 28620 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28628 KB Output is correct
12 Correct 16 ms 28560 KB Output is correct
13 Correct 16 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28620 KB Output is correct
16 Correct 18 ms 28508 KB Output is correct
17 Correct 15 ms 28620 KB Output is correct
18 Correct 15 ms 28620 KB Output is correct
19 Correct 15 ms 28556 KB Output is correct
20 Correct 15 ms 28620 KB Output is correct
21 Correct 18 ms 28520 KB Output is correct
22 Correct 16 ms 28564 KB Output is correct
23 Correct 16 ms 28620 KB Output is correct
24 Correct 16 ms 28620 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 17 ms 28572 KB Output is correct
27 Correct 16 ms 28596 KB Output is correct
28 Correct 17 ms 28620 KB Output is correct
29 Correct 17 ms 28620 KB Output is correct
30 Correct 18 ms 28620 KB Output is correct
31 Correct 17 ms 28588 KB Output is correct
32 Correct 16 ms 28620 KB Output is correct
33 Correct 16 ms 28652 KB Output is correct
34 Correct 17 ms 28592 KB Output is correct
35 Correct 18 ms 28568 KB Output is correct
36 Correct 18 ms 28652 KB Output is correct
37 Correct 17 ms 28620 KB Output is correct
38 Correct 17 ms 28600 KB Output is correct
39 Correct 16 ms 28660 KB Output is correct
40 Correct 16 ms 28676 KB Output is correct
41 Correct 27 ms 29200 KB Output is correct
42 Correct 31 ms 29424 KB Output is correct
43 Correct 24 ms 29076 KB Output is correct
44 Correct 26 ms 29188 KB Output is correct
45 Correct 24 ms 29320 KB Output is correct
46 Correct 25 ms 29480 KB Output is correct
47 Correct 24 ms 29412 KB Output is correct
48 Correct 25 ms 29340 KB Output is correct
49 Correct 27 ms 29544 KB Output is correct
50 Correct 29 ms 29404 KB Output is correct
51 Correct 26 ms 29348 KB Output is correct
52 Correct 25 ms 29440 KB Output is correct
53 Correct 24 ms 29424 KB Output is correct
54 Correct 25 ms 29356 KB Output is correct
55 Correct 26 ms 29516 KB Output is correct
56 Correct 25 ms 29400 KB Output is correct
57 Correct 26 ms 29388 KB Output is correct
58 Correct 25 ms 29508 KB Output is correct
59 Correct 25 ms 29440 KB Output is correct
60 Correct 27 ms 29388 KB Output is correct
61 Correct 26 ms 29404 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 56744 KB Output is correct
2 Correct 303 ms 47952 KB Output is correct
3 Correct 389 ms 47188 KB Output is correct
4 Correct 871 ms 55240 KB Output is correct
5 Correct 656 ms 58072 KB Output is correct
6 Correct 903 ms 57264 KB Output is correct
7 Correct 406 ms 61176 KB Output is correct
8 Correct 398 ms 68128 KB Output is correct
9 Correct 372 ms 58828 KB Output is correct
10 Correct 385 ms 63468 KB Output is correct
11 Correct 558 ms 56896 KB Output is correct
12 Correct 599 ms 56904 KB Output is correct
13 Correct 676 ms 61540 KB Output is correct
14 Correct 713 ms 56916 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 56836 KB Output is correct
2 Correct 447 ms 56956 KB Output is correct
3 Correct 520 ms 57496 KB Output is correct
4 Correct 901 ms 68156 KB Output is correct
5 Correct 712 ms 68248 KB Output is correct
6 Correct 840 ms 68272 KB Output is correct
7 Correct 383 ms 68288 KB Output is correct
8 Correct 400 ms 68228 KB Output is correct
9 Correct 381 ms 67912 KB Output is correct
10 Correct 519 ms 68080 KB Output is correct
11 Correct 777 ms 68200 KB Output is correct
12 Correct 611 ms 68280 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28620 KB Output is correct
2 Correct 15 ms 28612 KB Output is correct
3 Correct 15 ms 28516 KB Output is correct
4 Correct 16 ms 28492 KB Output is correct
5 Correct 16 ms 28528 KB Output is correct
6 Correct 16 ms 28620 KB Output is correct
7 Correct 15 ms 28620 KB Output is correct
8 Correct 18 ms 28544 KB Output is correct
9 Correct 16 ms 28620 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28628 KB Output is correct
12 Correct 16 ms 28560 KB Output is correct
13 Correct 16 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28620 KB Output is correct
16 Correct 18 ms 28508 KB Output is correct
17 Correct 15 ms 28620 KB Output is correct
18 Correct 15 ms 28620 KB Output is correct
19 Correct 15 ms 28556 KB Output is correct
20 Correct 15 ms 28620 KB Output is correct
21 Correct 18 ms 28520 KB Output is correct
22 Correct 16 ms 28564 KB Output is correct
23 Correct 16 ms 28620 KB Output is correct
24 Correct 16 ms 28620 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 17 ms 28572 KB Output is correct
27 Correct 16 ms 28596 KB Output is correct
28 Correct 17 ms 28620 KB Output is correct
29 Correct 17 ms 28620 KB Output is correct
30 Correct 18 ms 28620 KB Output is correct
31 Correct 17 ms 28588 KB Output is correct
32 Correct 16 ms 28620 KB Output is correct
33 Correct 16 ms 28652 KB Output is correct
34 Correct 17 ms 28592 KB Output is correct
35 Correct 18 ms 28568 KB Output is correct
36 Correct 18 ms 28652 KB Output is correct
37 Correct 17 ms 28620 KB Output is correct
38 Correct 17 ms 28600 KB Output is correct
39 Correct 16 ms 28660 KB Output is correct
40 Correct 16 ms 28676 KB Output is correct
41 Correct 27 ms 29200 KB Output is correct
42 Correct 31 ms 29424 KB Output is correct
43 Correct 24 ms 29076 KB Output is correct
44 Correct 26 ms 29188 KB Output is correct
45 Correct 24 ms 29320 KB Output is correct
46 Correct 25 ms 29480 KB Output is correct
47 Correct 24 ms 29412 KB Output is correct
48 Correct 25 ms 29340 KB Output is correct
49 Correct 27 ms 29544 KB Output is correct
50 Correct 29 ms 29404 KB Output is correct
51 Correct 26 ms 29348 KB Output is correct
52 Correct 25 ms 29440 KB Output is correct
53 Correct 24 ms 29424 KB Output is correct
54 Correct 25 ms 29356 KB Output is correct
55 Correct 26 ms 29516 KB Output is correct
56 Correct 25 ms 29400 KB Output is correct
57 Correct 26 ms 29388 KB Output is correct
58 Correct 25 ms 29508 KB Output is correct
59 Correct 25 ms 29440 KB Output is correct
60 Correct 27 ms 29388 KB Output is correct
61 Correct 26 ms 29404 KB Output is correct
62 Correct 262 ms 56744 KB Output is correct
63 Correct 303 ms 47952 KB Output is correct
64 Correct 389 ms 47188 KB Output is correct
65 Correct 871 ms 55240 KB Output is correct
66 Correct 656 ms 58072 KB Output is correct
67 Correct 903 ms 57264 KB Output is correct
68 Correct 406 ms 61176 KB Output is correct
69 Correct 398 ms 68128 KB Output is correct
70 Correct 372 ms 58828 KB Output is correct
71 Correct 385 ms 63468 KB Output is correct
72 Correct 558 ms 56896 KB Output is correct
73 Correct 599 ms 56904 KB Output is correct
74 Correct 676 ms 61540 KB Output is correct
75 Correct 713 ms 56916 KB Output is correct
76 Correct 263 ms 56836 KB Output is correct
77 Correct 447 ms 56956 KB Output is correct
78 Correct 520 ms 57496 KB Output is correct
79 Correct 901 ms 68156 KB Output is correct
80 Correct 712 ms 68248 KB Output is correct
81 Correct 840 ms 68272 KB Output is correct
82 Correct 383 ms 68288 KB Output is correct
83 Correct 400 ms 68228 KB Output is correct
84 Correct 381 ms 67912 KB Output is correct
85 Correct 519 ms 68080 KB Output is correct
86 Correct 777 ms 68200 KB Output is correct
87 Correct 611 ms 68280 KB Output is correct
88 Correct 419 ms 45912 KB Output is correct
89 Correct 873 ms 56240 KB Output is correct
90 Correct 539 ms 49048 KB Output is correct
91 Correct 856 ms 65924 KB Output is correct
92 Correct 406 ms 57304 KB Output is correct
93 Correct 545 ms 57304 KB Output is correct
94 Correct 689 ms 63736 KB Output is correct
95 Correct 692 ms 56896 KB Output is correct
96 Correct 764 ms 56796 KB Output is correct
97 Correct 846 ms 58704 KB Output is correct
98 Correct 881 ms 66836 KB Output is correct
99 Correct 884 ms 68004 KB Output is correct
100 Correct 895 ms 68052 KB Output is correct
101 Correct 384 ms 56852 KB Output is correct
102 Correct 423 ms 56892 KB Output is correct
103 Correct 464 ms 56840 KB Output is correct
104 Correct 526 ms 56796 KB Output is correct
105 Correct 638 ms 58184 KB Output is correct
106 Correct 485 ms 67804 KB Output is correct
107 Correct 559 ms 68100 KB Output is correct
108 Correct 746 ms 68200 KB Output is correct
109 Correct 618 ms 61620 KB Output is correct
110 Correct 684 ms 64060 KB Output is correct
111 Correct 747 ms 65428 KB Output is correct
112 Correct 550 ms 66296 KB Output is correct
113 Correct 665 ms 68268 KB Output is correct
114 Correct 774 ms 68420 KB Output is correct
115 Correct 384 ms 68156 KB Output is correct
116 Correct 395 ms 68184 KB Output is correct
117 Correct 371 ms 68168 KB Output is correct
118 Correct 367 ms 68164 KB Output is correct
119 Correct 486 ms 68140 KB Output is correct
120 Correct 526 ms 68156 KB Output is correct