oj.uz

Submission #429576

# Submission time Handle Problem Language Result Execution time Memory
429576 2021-06-16T07:10:10 Z Evirir Financial Report (JOI21_financial) C++17
100 / 100
 706 ms 43372 KB 
#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;

#pragma GCC optimize("Ofast")
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
template<typename T>
using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

class PointSegmentTree{
private:
	int size_;
	vector<ll> v;
	void update(int p, ll val, int k, int l, int r)
	{
		if(p < l || r < p) return;
		if(l == r){
			v[k]=val;	//modification
			return;
		}
		int mid = (l+r)>>1;
		update(p, val, k*2, l, mid);
		update(p, val, k*2+1, mid+1, r);
		v[k] = merge(v[k*2], v[k*2+1]);
	}
	ll query(int s, int e, int k, int l, int r)
	{
		if(e < l || r < s) return 0; //dummy value
		if(s <= l && r <= e) return v[k];
		int mid = (l+r)>>1;
		ll lc = query(s, e, k*2, l, mid);
		ll rc = query(s, e, k*2+1, mid+1, r);
		return merge(lc, rc);
	}
	
public:
	PointSegmentTree(): v(vector<ll>()) {}
	PointSegmentTree(int n){
		for(size_=1;size_<n;) size_<<=1;
		v.resize(size_*4);
	}
	//void reset(){}
	inline ll merge(ll x, ll y){
		return max(x,y);
	}
	inline void update(int p, ll val){
		update(p, val, 1, 0, size_-1);
	}
	inline ll query(int l, int r){
		return query(l, r, 1, 0, size_-1);
	}
};

struct DSU {
	struct Node{ int p, sz, l; };
	vector<Node> dsu; int cc;
	Node& operator[](int id){ return dsu[rt(id)]; }
	DSU(int n){ dsu.resize(n);
		forn(i,0,n){ cc=n; dsu[i]={i,1,i}; }
	}
	inline int rt(int u){ return (dsu[u].p==u) ? u : dsu[u].p=rt(dsu[u].p); }
	inline bool sameset(int u, int v){ return rt(u)==rt(v); }
	void merge(int u, int v){
		u = rt(u); v = rt(v);
		if(u == v) return;
		if(dsu[u].sz < dsu[v].sz) swap(u,v);
		dsu[v].p = u;
		dsu[u].sz += dsu[v].sz;
		dsu[u].l = min(dsu[u].l, dsu[v].l);
		cc--;
	}
	inline Node& get(int u){ return dsu[rt(u)]; }
};

const bool DEBUG = 0;
const int MAXN = 300005;

int n,D;
int a[MAXN];
vii eve;
PointSegmentTree st;
DSU dsu(0);
bool vst[MAXN];
set<int> ban;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>D;
	forn(i,0,n)
	{
		cin>>a[i];
		eve.pb({a[i],i});
	}
	
	auto cmp=[&](ii x, ii y){ return ii(-x.F, x.S)<ii(-y.F, y.S); };
	sort(eve.begin(), eve.end(), cmp);
	st=PointSegmentTree(n);
	dsu=DSU(n);
	
	for(ii tmp: eve)
	{
		int i=tmp.S;
		
		auto rp=ban.lower_bound(i);
		int r;
		if(rp==ban.end()) r=n;
		else r=*rp+D;
		st.update(i, 1+st.query(i+1, r-1));
		//cout<<"st("<<i+1<<")="<<st.query(i,i)<<" r="<<r<<'\n';
		//cout<<"ban: "; for(int x: ban) cout<<x+1<<" "; cout<<'\n';
		
		if(i && vst[i-1]) dsu.merge(i,i-1);
		if(i<n-1 && vst[i+1]) dsu.merge(i,i+1);
		if(dsu.get(i).sz>=D) ban.insert(dsu.get(i).l);
		vst[i]=1;
	}
	
	cout<<st.query(0,n-1)<<'\n';
	
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 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 1 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 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 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 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 1 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 6 ms 976 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 5 ms 844 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 4 ms 844 KB Output is correct
46 Correct 7 ms 844 KB Output is correct
47 Correct 6 ms 844 KB Output is correct
48 Correct 5 ms 844 KB Output is correct
49 Correct 5 ms 844 KB Output is correct
50 Correct 7 ms 844 KB Output is correct
51 Correct 6 ms 972 KB Output is correct
52 Correct 6 ms 844 KB Output is correct
53 Correct 5 ms 980 KB Output is correct
54 Correct 5 ms 844 KB Output is correct
55 Correct 5 ms 844 KB Output is correct
56 Correct 5 ms 844 KB Output is correct
57 Correct 5 ms 844 KB Output is correct
58 Correct 4 ms 844 KB Output is correct
59 Correct 3 ms 844 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 4 ms 844 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 26504 KB Output is correct
2 Correct 277 ms 32420 KB Output is correct
3 Correct 506 ms 36212 KB Output is correct
4 Correct 706 ms 36416 KB Output is correct
5 Correct 496 ms 38240 KB Output is correct
6 Correct 672 ms 36412 KB Output is correct
7 Correct 282 ms 43088 KB Output is correct
8 Correct 180 ms 29076 KB Output is correct
9 Correct 236 ms 39364 KB Output is correct
10 Correct 227 ms 34396 KB Output is correct
11 Correct 341 ms 36300 KB Output is correct
12 Correct 410 ms 36260 KB Output is correct
13 Correct 495 ms 43372 KB Output is correct
14 Correct 438 ms 29396 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 26400 KB Output is correct
2 Correct 343 ms 26412 KB Output is correct
3 Correct 320 ms 26452 KB Output is correct
4 Correct 363 ms 26388 KB Output is correct
5 Correct 271 ms 26532 KB Output is correct
6 Correct 332 ms 26412 KB Output is correct
7 Correct 175 ms 26308 KB Output is correct
8 Correct 174 ms 26372 KB Output is correct
9 Correct 202 ms 26272 KB Output is correct
10 Correct 238 ms 26376 KB Output is correct
11 Correct 275 ms 26408 KB Output is correct
12 Correct 293 ms 26420 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 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 1 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 6 ms 976 KB Output is correct
42 Correct 7 ms 844 KB Output is correct
43 Correct 5 ms 844 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 4 ms 844 KB Output is correct
46 Correct 7 ms 844 KB Output is correct
47 Correct 6 ms 844 KB Output is correct
48 Correct 5 ms 844 KB Output is correct
49 Correct 5 ms 844 KB Output is correct
50 Correct 7 ms 844 KB Output is correct
51 Correct 6 ms 972 KB Output is correct
52 Correct 6 ms 844 KB Output is correct
53 Correct 5 ms 980 KB Output is correct
54 Correct 5 ms 844 KB Output is correct
55 Correct 5 ms 844 KB Output is correct
56 Correct 5 ms 844 KB Output is correct
57 Correct 5 ms 844 KB Output is correct
58 Correct 4 ms 844 KB Output is correct
59 Correct 3 ms 844 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 4 ms 844 KB Output is correct
62 Correct 172 ms 26504 KB Output is correct
63 Correct 277 ms 32420 KB Output is correct
64 Correct 506 ms 36212 KB Output is correct
65 Correct 706 ms 36416 KB Output is correct
66 Correct 496 ms 38240 KB Output is correct
67 Correct 672 ms 36412 KB Output is correct
68 Correct 282 ms 43088 KB Output is correct
69 Correct 180 ms 29076 KB Output is correct
70 Correct 236 ms 39364 KB Output is correct
71 Correct 227 ms 34396 KB Output is correct
72 Correct 341 ms 36300 KB Output is correct
73 Correct 410 ms 36260 KB Output is correct
74 Correct 495 ms 43372 KB Output is correct
75 Correct 438 ms 29396 KB Output is correct
76 Correct 190 ms 26400 KB Output is correct
77 Correct 343 ms 26412 KB Output is correct
78 Correct 320 ms 26452 KB Output is correct
79 Correct 363 ms 26388 KB Output is correct
80 Correct 271 ms 26532 KB Output is correct
81 Correct 332 ms 26412 KB Output is correct
82 Correct 175 ms 26308 KB Output is correct
83 Correct 174 ms 26372 KB Output is correct
84 Correct 202 ms 26272 KB Output is correct
85 Correct 238 ms 26376 KB Output is correct
86 Correct 275 ms 26408 KB Output is correct
87 Correct 293 ms 26420 KB Output is correct
88 Correct 502 ms 33588 KB Output is correct
89 Correct 439 ms 31884 KB Output is correct
90 Correct 412 ms 28980 KB Output is correct
91 Correct 396 ms 27320 KB Output is correct
92 Correct 285 ms 27948 KB Output is correct
93 Correct 385 ms 28596 KB Output is correct
94 Correct 376 ms 28856 KB Output is correct
95 Correct 599 ms 34500 KB Output is correct
96 Correct 398 ms 30584 KB Output is correct
97 Correct 362 ms 28952 KB Output is correct
98 Correct 382 ms 28328 KB Output is correct
99 Correct 422 ms 27748 KB Output is correct
100 Correct 371 ms 27380 KB Output is correct
101 Correct 246 ms 34988 KB Output is correct
102 Correct 235 ms 29932 KB Output is correct
103 Correct 233 ms 28664 KB Output is correct
104 Correct 241 ms 28600 KB Output is correct
105 Correct 330 ms 28388 KB Output is correct
106 Correct 241 ms 28516 KB Output is correct
107 Correct 309 ms 28352 KB Output is correct
108 Correct 317 ms 27820 KB Output is correct
109 Correct 495 ms 41312 KB Output is correct
110 Correct 422 ms 29572 KB Output is correct
111 Correct 364 ms 28300 KB Output is correct
112 Correct 273 ms 31136 KB Output is correct
113 Correct 326 ms 29028 KB Output is correct
114 Correct 287 ms 29060 KB Output is correct
115 Correct 180 ms 28920 KB Output is correct
116 Correct 188 ms 28628 KB Output is correct
117 Correct 238 ms 28944 KB Output is correct
118 Correct 231 ms 28584 KB Output is correct
119 Correct 220 ms 28500 KB Output is correct
120 Correct 225 ms 28524 KB Output is correct