oj.uz

Submission #483943

# Submission time Handle Problem Language Result Execution time Memory
483943 2021-11-01T14:05:43 Z NhatMinh0208 Financial Report (JOI21_financial) C++14
100 / 100
 925 ms 99224 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
 
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}
 
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
 
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
 
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
ll sta[300001];
 
// A list of preset merge functions.
ll cmpg(ll a, ll b){if (a>b) return a; else return b;}
ll cmpl(ll a, ll b){if (a>b) return b; else return a;}
ll sum(ll a, ll b){return (a+b);}
ll summ(ll a, ll b){return (a+b)%MOD;}
ll prod(ll a, ll b){return (a*b);}
ll prodm(ll a, ll b){return (a%MOD*b)%MOD;}
ll bAND(ll a, ll b){return (a&b);}
ll bOR(ll a, ll b){return (a|b);}
ll bXOR(ll a, ll b){return (a^b);}
//The segement tree itself.
struct seg
{
    ll val[1100001];
    ll def=-1e9;
    ll (*merg)(ll,ll) = cmpg; // Merge function. It must be associative.
    void reset(ll c, ll l, ll r)
    {
        if (l<r)
        {
            ll mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
            val[c]=merg(val[(c<<1)],val[(c<<1)+1]);
        }
        else val[c]=sta[l];
    }
    void upd(ll c, ll l, ll r, ll x, ll t)
    {
        if ((l<=x)and(x<=r))
        {
            if (l==r) val[c]=t;
            else
            {
                ll mid=(l+r)/2;
                upd((c<<1),l,mid,x,t);
                upd((c<<1)+1,mid+1,r,x,t);
                val[c]=merg(val[(c<<1)],val[(c<<1)+1]);
            }
        }
    }
    ll get(ll c, ll l, ll r, ll tl, ll tr)
    {
		if (tl>tr) return def;
        if ((tl>r)or(tr<l)) return def;
        if ((tl<=l)and(tr>=r)) return val[c];
        else
        {
            ll mid=(l+r)/2;
            ll a=get((c<<1),l,mid,tl,tr);
            ll b=get((c<<1)+1,mid+1,r,tl,tr);
            return merg(a,b);
        }
    }
};
seg st;
 
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
vector<pii(int)> vec;
int n,m,i,j,k,t,t1,u,v,a,b,res;
int arr[300001];
int mn[300001];
int r[300001];
int dp[300001];
vector<int> buc[300001];
map<int,int> lmao;
vector<int> dq;
set<int> lul;
multiset<int> mx[300001];
int main()
{
	fio;
	cin>>n>>m;
	j=0;
	for (i=1;i<=n;i++) {
		cin>>arr[i];
		lmao[arr[i]]=1;
	}
	for (auto& g : lmao) {
		t++;
		g.se=t;
	}
	for (i=1;i<=n;i++) arr[i]=lmao[arr[i]];
	for (i=1;i<=n;i++) {
		while(dq.size()>j && dq.back()>arr[i]) {
			dq.pop_back();
		}
		dq.push_back(arr[i]);
		if (i-m>=1 && dq[j]==arr[i-m]) {
			j++;
		}
		if (i-m>=0) {mn[i]=dq[j]; vec.push_back({mn[i],-i});}
	}
	for (i=1;i<=n;i++) vec.push_back({arr[i],i});
	sort(vec.begin(),vec.end());
	reverse(vec.begin(),vec.end());
	for (auto g : vec) {
		if (g.se<0) {
			lul.insert(-g.se);
		}
		else {
			auto it = lul.lower_bound(g.se+m);
			if (it!=lul.end()) r[g.se]=(*it); else r[g.se]=n;
		}
	}
	for (i=1;i<=n;i++) buc[r[i]+1].push_back(i);
	st.reset(1,1,t);
 
	// for (i=1;i<=n;i++) cout<<r[i]<<' '; cout<<endl;
	for (i=1;i<=t;i++) {
		st.upd(1,1,t,i,-1e9);
		mx[i].insert(-1e9);
	}
	for (i=1;i<=n;i++) {
		
		for (auto g : buc[i]) {
			// assert(mx[arr[g]].lower_bound(dp[g])!=mx[arr[g]].end());
			mx[arr[g]].erase(mx[arr[g]].lower_bound(dp[g]));
			auto it=mx[arr[g]].end();
			it--;
			u=(*it);
			st.upd(1,1,t,arr[g],u);
		}
		u=st.get(1,1,t,1,arr[i]-1);
		dp[i]=max(u,0)+1;
		res=max(res,dp[i]);
		mx[arr[i]].insert(dp[i]);
		auto it=mx[arr[i]].end();
		it--;
		u=(*it);
		st.upd(1,1,t,arr[i],u);
	}
	cout<<res;
}
// N;

Compilation message

Main.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
Main.cpp: In function 'int main()':
Main.cpp:190:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  190 |   while(dq.size()>j && dq.back()>arr[i]) {
      |         ~~~~~~~~~^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 10 ms 21476 KB Output is correct
3 Correct 13 ms 21452 KB Output is correct
4 Correct 10 ms 21452 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21472 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 11 ms 21476 KB Output is correct
9 Correct 12 ms 21444 KB Output is correct
10 Correct 10 ms 21380 KB Output is correct
11 Correct 10 ms 21468 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 9 ms 21452 KB Output is correct
14 Correct 9 ms 21452 KB Output is correct
15 Correct 10 ms 21452 KB Output is correct
16 Correct 10 ms 21472 KB Output is correct
17 Correct 10 ms 21452 KB Output is correct
18 Correct 11 ms 21452 KB Output is correct
19 Correct 10 ms 21432 KB Output is correct
20 Correct 10 ms 21496 KB Output is correct
21 Correct 10 ms 21376 KB Output is correct
22 Correct 11 ms 21472 KB Output is correct
23 Correct 13 ms 21448 KB Output is correct
24 Correct 11 ms 21476 KB Output is correct
25 Correct 11 ms 21420 KB Output is correct
26 Correct 10 ms 21452 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 10 ms 21476 KB Output is correct
3 Correct 13 ms 21452 KB Output is correct
4 Correct 10 ms 21452 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21472 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 11 ms 21476 KB Output is correct
9 Correct 12 ms 21444 KB Output is correct
10 Correct 10 ms 21380 KB Output is correct
11 Correct 10 ms 21468 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 9 ms 21452 KB Output is correct
14 Correct 9 ms 21452 KB Output is correct
15 Correct 10 ms 21452 KB Output is correct
16 Correct 10 ms 21472 KB Output is correct
17 Correct 10 ms 21452 KB Output is correct
18 Correct 11 ms 21452 KB Output is correct
19 Correct 10 ms 21432 KB Output is correct
20 Correct 10 ms 21496 KB Output is correct
21 Correct 10 ms 21376 KB Output is correct
22 Correct 11 ms 21472 KB Output is correct
23 Correct 13 ms 21448 KB Output is correct
24 Correct 11 ms 21476 KB Output is correct
25 Correct 11 ms 21420 KB Output is correct
26 Correct 10 ms 21452 KB Output is correct
27 Correct 10 ms 21468 KB Output is correct
28 Correct 10 ms 21472 KB Output is correct
29 Correct 10 ms 21528 KB Output is correct
30 Correct 10 ms 21600 KB Output is correct
31 Correct 11 ms 21476 KB Output is correct
32 Correct 10 ms 21452 KB Output is correct
33 Correct 12 ms 21564 KB Output is correct
34 Correct 11 ms 21532 KB Output is correct
35 Correct 10 ms 21580 KB Output is correct
36 Correct 11 ms 21508 KB Output is correct
37 Correct 11 ms 21504 KB Output is correct
38 Correct 11 ms 21468 KB Output is correct
39 Correct 12 ms 21512 KB Output is correct
40 Correct 12 ms 21484 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 10 ms 21476 KB Output is correct
3 Correct 13 ms 21452 KB Output is correct
4 Correct 10 ms 21452 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21472 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 11 ms 21476 KB Output is correct
9 Correct 12 ms 21444 KB Output is correct
10 Correct 10 ms 21380 KB Output is correct
11 Correct 10 ms 21468 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 9 ms 21452 KB Output is correct
14 Correct 9 ms 21452 KB Output is correct
15 Correct 10 ms 21452 KB Output is correct
16 Correct 10 ms 21472 KB Output is correct
17 Correct 10 ms 21452 KB Output is correct
18 Correct 11 ms 21452 KB Output is correct
19 Correct 10 ms 21432 KB Output is correct
20 Correct 10 ms 21496 KB Output is correct
21 Correct 10 ms 21376 KB Output is correct
22 Correct 11 ms 21472 KB Output is correct
23 Correct 13 ms 21448 KB Output is correct
24 Correct 11 ms 21476 KB Output is correct
25 Correct 11 ms 21420 KB Output is correct
26 Correct 10 ms 21452 KB Output is correct
27 Correct 10 ms 21468 KB Output is correct
28 Correct 10 ms 21472 KB Output is correct
29 Correct 10 ms 21528 KB Output is correct
30 Correct 10 ms 21600 KB Output is correct
31 Correct 11 ms 21476 KB Output is correct
32 Correct 10 ms 21452 KB Output is correct
33 Correct 12 ms 21564 KB Output is correct
34 Correct 11 ms 21532 KB Output is correct
35 Correct 10 ms 21580 KB Output is correct
36 Correct 11 ms 21508 KB Output is correct
37 Correct 11 ms 21504 KB Output is correct
38 Correct 11 ms 21468 KB Output is correct
39 Correct 12 ms 21512 KB Output is correct
40 Correct 12 ms 21484 KB Output is correct
41 Correct 18 ms 22404 KB Output is correct
42 Correct 19 ms 22988 KB Output is correct
43 Correct 15 ms 22252 KB Output is correct
44 Correct 18 ms 22508 KB Output is correct
45 Correct 18 ms 22632 KB Output is correct
46 Correct 18 ms 22800 KB Output is correct
47 Correct 19 ms 22988 KB Output is correct
48 Correct 19 ms 23004 KB Output is correct
49 Correct 19 ms 23008 KB Output is correct
50 Correct 20 ms 23144 KB Output is correct
51 Correct 19 ms 22988 KB Output is correct
52 Correct 21 ms 23012 KB Output is correct
53 Correct 18 ms 23016 KB Output is correct
54 Correct 18 ms 22920 KB Output is correct
55 Correct 19 ms 23204 KB Output is correct
56 Correct 18 ms 23116 KB Output is correct
57 Correct 21 ms 23120 KB Output is correct
58 Correct 16 ms 22744 KB Output is correct
59 Correct 18 ms 22764 KB Output is correct
60 Correct 17 ms 23132 KB Output is correct
61 Correct 17 ms 23116 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 63156 KB Output is correct
2 Correct 254 ms 53600 KB Output is correct
3 Correct 356 ms 52288 KB Output is correct
4 Correct 925 ms 80272 KB Output is correct
5 Correct 663 ms 89924 KB Output is correct
6 Correct 908 ms 88524 KB Output is correct
7 Correct 477 ms 93232 KB Output is correct
8 Correct 441 ms 98184 KB Output is correct
9 Correct 426 ms 90716 KB Output is correct
10 Correct 404 ms 94480 KB Output is correct
11 Correct 600 ms 88632 KB Output is correct
12 Correct 662 ms 88708 KB Output is correct
13 Correct 813 ms 93520 KB Output is correct
14 Correct 917 ms 84616 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 45484 KB Output is correct
2 Correct 255 ms 44376 KB Output is correct
3 Correct 326 ms 44736 KB Output is correct
4 Correct 631 ms 80680 KB Output is correct
5 Correct 558 ms 80624 KB Output is correct
6 Correct 663 ms 80832 KB Output is correct
7 Correct 277 ms 81824 KB Output is correct
8 Correct 284 ms 80624 KB Output is correct
9 Correct 298 ms 80584 KB Output is correct
10 Correct 457 ms 80652 KB Output is correct
11 Correct 601 ms 80720 KB Output is correct
12 Correct 497 ms 80736 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21464 KB Output is correct
2 Correct 10 ms 21476 KB Output is correct
3 Correct 13 ms 21452 KB Output is correct
4 Correct 10 ms 21452 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21472 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 11 ms 21476 KB Output is correct
9 Correct 12 ms 21444 KB Output is correct
10 Correct 10 ms 21380 KB Output is correct
11 Correct 10 ms 21468 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 9 ms 21452 KB Output is correct
14 Correct 9 ms 21452 KB Output is correct
15 Correct 10 ms 21452 KB Output is correct
16 Correct 10 ms 21472 KB Output is correct
17 Correct 10 ms 21452 KB Output is correct
18 Correct 11 ms 21452 KB Output is correct
19 Correct 10 ms 21432 KB Output is correct
20 Correct 10 ms 21496 KB Output is correct
21 Correct 10 ms 21376 KB Output is correct
22 Correct 11 ms 21472 KB Output is correct
23 Correct 13 ms 21448 KB Output is correct
24 Correct 11 ms 21476 KB Output is correct
25 Correct 11 ms 21420 KB Output is correct
26 Correct 10 ms 21452 KB Output is correct
27 Correct 10 ms 21468 KB Output is correct
28 Correct 10 ms 21472 KB Output is correct
29 Correct 10 ms 21528 KB Output is correct
30 Correct 10 ms 21600 KB Output is correct
31 Correct 11 ms 21476 KB Output is correct
32 Correct 10 ms 21452 KB Output is correct
33 Correct 12 ms 21564 KB Output is correct
34 Correct 11 ms 21532 KB Output is correct
35 Correct 10 ms 21580 KB Output is correct
36 Correct 11 ms 21508 KB Output is correct
37 Correct 11 ms 21504 KB Output is correct
38 Correct 11 ms 21468 KB Output is correct
39 Correct 12 ms 21512 KB Output is correct
40 Correct 12 ms 21484 KB Output is correct
41 Correct 18 ms 22404 KB Output is correct
42 Correct 19 ms 22988 KB Output is correct
43 Correct 15 ms 22252 KB Output is correct
44 Correct 18 ms 22508 KB Output is correct
45 Correct 18 ms 22632 KB Output is correct
46 Correct 18 ms 22800 KB Output is correct
47 Correct 19 ms 22988 KB Output is correct
48 Correct 19 ms 23004 KB Output is correct
49 Correct 19 ms 23008 KB Output is correct
50 Correct 20 ms 23144 KB Output is correct
51 Correct 19 ms 22988 KB Output is correct
52 Correct 21 ms 23012 KB Output is correct
53 Correct 18 ms 23016 KB Output is correct
54 Correct 18 ms 22920 KB Output is correct
55 Correct 19 ms 23204 KB Output is correct
56 Correct 18 ms 23116 KB Output is correct
57 Correct 21 ms 23120 KB Output is correct
58 Correct 16 ms 22744 KB Output is correct
59 Correct 18 ms 22764 KB Output is correct
60 Correct 17 ms 23132 KB Output is correct
61 Correct 17 ms 23116 KB Output is correct
62 Correct 221 ms 63156 KB Output is correct
63 Correct 254 ms 53600 KB Output is correct
64 Correct 356 ms 52288 KB Output is correct
65 Correct 925 ms 80272 KB Output is correct
66 Correct 663 ms 89924 KB Output is correct
67 Correct 908 ms 88524 KB Output is correct
68 Correct 477 ms 93232 KB Output is correct
69 Correct 441 ms 98184 KB Output is correct
70 Correct 426 ms 90716 KB Output is correct
71 Correct 404 ms 94480 KB Output is correct
72 Correct 600 ms 88632 KB Output is correct
73 Correct 662 ms 88708 KB Output is correct
74 Correct 813 ms 93520 KB Output is correct
75 Correct 917 ms 84616 KB Output is correct
76 Correct 136 ms 45484 KB Output is correct
77 Correct 255 ms 44376 KB Output is correct
78 Correct 326 ms 44736 KB Output is correct
79 Correct 631 ms 80680 KB Output is correct
80 Correct 558 ms 80624 KB Output is correct
81 Correct 663 ms 80832 KB Output is correct
82 Correct 277 ms 81824 KB Output is correct
83 Correct 284 ms 80624 KB Output is correct
84 Correct 298 ms 80584 KB Output is correct
85 Correct 457 ms 80652 KB Output is correct
86 Correct 601 ms 80720 KB Output is correct
87 Correct 497 ms 80736 KB Output is correct
88 Correct 431 ms 52172 KB Output is correct
89 Correct 890 ms 86936 KB Output is correct
90 Correct 541 ms 59048 KB Output is correct
91 Correct 714 ms 97952 KB Output is correct
92 Correct 354 ms 62964 KB Output is correct
93 Correct 396 ms 62780 KB Output is correct
94 Correct 603 ms 74436 KB Output is correct
95 Correct 757 ms 88892 KB Output is correct
96 Correct 810 ms 89000 KB Output is correct
97 Correct 918 ms 90564 KB Output is correct
98 Correct 818 ms 97948 KB Output is correct
99 Correct 826 ms 99192 KB Output is correct
100 Correct 785 ms 99148 KB Output is correct
101 Correct 431 ms 89368 KB Output is correct
102 Correct 515 ms 86276 KB Output is correct
103 Correct 506 ms 85824 KB Output is correct
104 Correct 511 ms 86040 KB Output is correct
105 Correct 624 ms 88512 KB Output is correct
106 Correct 468 ms 98904 KB Output is correct
107 Correct 496 ms 99224 KB Output is correct
108 Correct 726 ms 99076 KB Output is correct
109 Correct 649 ms 94668 KB Output is correct
110 Correct 752 ms 96044 KB Output is correct
111 Correct 748 ms 97308 KB Output is correct
112 Correct 548 ms 98116 KB Output is correct
113 Correct 721 ms 98948 KB Output is correct
114 Correct 769 ms 98976 KB Output is correct
115 Correct 312 ms 81668 KB Output is correct
116 Correct 308 ms 81656 KB Output is correct
117 Correct 341 ms 90560 KB Output is correct
118 Correct 346 ms 90492 KB Output is correct
119 Correct 407 ms 99096 KB Output is correct
120 Correct 414 ms 99156 KB Output is correct