oj.uz

답안 #679839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679839 2023-01-09T12:07:54 Z myrcella Financial Report (JOI21_financial) C++17
100 / 100
 397 ms 27096 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 3e5+10;

int fa[maxn];

int getf(int x) {
	if (fa[x]==x) return x;
	else return fa[x] = getf(fa[x]);
}

int n,m;
bool chosen[maxn];
int a[maxn];
int r[maxn];
set <int> pos;
vector <pii> b;
int sz[maxn];

int tree[maxn*4],f[maxn];

void merge(int x,int y) {
	int fx = getf(x),fy = getf(y);
	fa[fy] = fx;
	for (int i = max(1,m-sz[fy]);i<=sz[fx] and i<m;i++) {
		//auto it = pos.lower_bound(fx+sz[fx]-i);
		//assert (it==pos.end() or (*it)!=fx+sz[fx]-i);
		pos.insert(fx+sz[fx]-i);
	}
	sz[fx] += sz[fy];
}

void add(int tmp) {
	chosen[tmp]=1;
	if (m==1) pos.insert(tmp);
	if (tmp!=0 and chosen[tmp-1]) merge(tmp-1,tmp);
	if (tmp+1<n and chosen[tmp+1]) merge(tmp,tmp+1);
}

void update(int c,int cl,int cr,int pos) {
	if (cl==cr) tree[c] = f[pos];
	else {
		int mid=cl+cr>>1;
		if (pos<=mid) update(c<<1,cl,mid,pos);
		else update(c<<1|1,mid+1,cr,pos);
		tree[c] = max(tree[c<<1],tree[c<<1|1]);
	}
}

int query(int c,int cl,int cr,int l ,int r) {
	if (l<=cl and cr<=r) return tree[c];
	int mid=cl+cr>>1;
	int ret = 0;
	if (l<=mid) ret = query(c<<1,cl,mid,l,r);
	if (r>mid) ret = max(ret,query(c<<1|1,mid+1,cr,l,r));
	return ret;
}

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	rep(i,0,n) cin>>a[i],b.pb({a[i],i}),fa[i]=i,sz[i] = 1;
	sort(ALL(b));
	reverse(ALL(b));
	int cur = 0;
	rep(i,0,n) {
		while (cur<n and b[cur].fi>b[i].fi) add(b[cur++].se);
		auto it = pos.upper_bound(b[i].se);
		int tmp;
		if (it==pos.end()) tmp = n-m;
		else tmp = *it;
		r[b[i].se] = tmp+m-1;
	}
	//rep(i,0,n) debug(r[i]);
	cur = 0;
	int ans = 0;
	rep(i,0,n) {
		while (cur<n and b[cur].fi>b[i].fi) update(1,0,n-1,b[cur++].se);
		int val = 1;
		val += query(1,0,n-1,b[i].se,r[b[i].se]);
		f[b[i].se] = val;
		//cout<<b[i].se<<" "<<rend[b[i].se]<<" "<<val<<endl;
		ans = max(ans,val);
	}
	cout<<ans;
	return 0;
}

Compilation message

Main.cpp: In function 'void update(int, int, int, int)':
Main.cpp:64:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |   int mid=cl+cr>>1;
      |           ~~^~~
Main.cpp: In function 'int query(int, int, int, int, int)':
Main.cpp:73:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |  int mid=cl+cr>>1;
      |          ~~^~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 852 KB Output is correct
42 Correct 4 ms 852 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 4 ms 852 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 4 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 4 ms 852 KB Output is correct
50 Correct 5 ms 852 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 852 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 4 ms 852 KB Output is correct
56 Correct 4 ms 852 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 2 ms 596 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 4 ms 920 KB Output is correct
61 Correct 4 ms 860 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 8624 KB Output is correct
2 Correct 187 ms 25012 KB Output is correct
3 Correct 328 ms 26856 KB Output is correct
4 Correct 365 ms 26960 KB Output is correct
5 Correct 289 ms 27068 KB Output is correct
6 Correct 397 ms 26904 KB Output is correct
7 Correct 214 ms 26868 KB Output is correct
8 Correct 193 ms 26892 KB Output is correct
9 Correct 163 ms 26936 KB Output is correct
10 Correct 173 ms 26980 KB Output is correct
11 Correct 246 ms 26984 KB Output is correct
12 Correct 259 ms 26916 KB Output is correct
13 Correct 288 ms 26936 KB Output is correct
14 Correct 355 ms 26944 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 8648 KB Output is correct
2 Correct 160 ms 13012 KB Output is correct
3 Correct 170 ms 12984 KB Output is correct
4 Correct 171 ms 12984 KB Output is correct
5 Correct 183 ms 12996 KB Output is correct
6 Correct 181 ms 13044 KB Output is correct
7 Correct 105 ms 13016 KB Output is correct
8 Correct 104 ms 12968 KB Output is correct
9 Correct 130 ms 12928 KB Output is correct
10 Correct 151 ms 13004 KB Output is correct
11 Correct 178 ms 13072 KB Output is correct
12 Correct 140 ms 13012 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 852 KB Output is correct
42 Correct 4 ms 852 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 4 ms 852 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 4 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 4 ms 852 KB Output is correct
50 Correct 5 ms 852 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 852 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 4 ms 852 KB Output is correct
56 Correct 4 ms 852 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 2 ms 596 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 4 ms 920 KB Output is correct
61 Correct 4 ms 860 KB Output is correct
62 Correct 72 ms 8624 KB Output is correct
63 Correct 187 ms 25012 KB Output is correct
64 Correct 328 ms 26856 KB Output is correct
65 Correct 365 ms 26960 KB Output is correct
66 Correct 289 ms 27068 KB Output is correct
67 Correct 397 ms 26904 KB Output is correct
68 Correct 214 ms 26868 KB Output is correct
69 Correct 193 ms 26892 KB Output is correct
70 Correct 163 ms 26936 KB Output is correct
71 Correct 173 ms 26980 KB Output is correct
72 Correct 246 ms 26984 KB Output is correct
73 Correct 259 ms 26916 KB Output is correct
74 Correct 288 ms 26936 KB Output is correct
75 Correct 355 ms 26944 KB Output is correct
76 Correct 104 ms 8648 KB Output is correct
77 Correct 160 ms 13012 KB Output is correct
78 Correct 170 ms 12984 KB Output is correct
79 Correct 171 ms 12984 KB Output is correct
80 Correct 183 ms 12996 KB Output is correct
81 Correct 181 ms 13044 KB Output is correct
82 Correct 105 ms 13016 KB Output is correct
83 Correct 104 ms 12968 KB Output is correct
84 Correct 130 ms 12928 KB Output is correct
85 Correct 151 ms 13004 KB Output is correct
86 Correct 178 ms 13072 KB Output is correct
87 Correct 140 ms 13012 KB Output is correct
88 Correct 378 ms 26992 KB Output is correct
89 Correct 343 ms 26916 KB Output is correct
90 Correct 279 ms 26996 KB Output is correct
91 Correct 229 ms 27000 KB Output is correct
92 Correct 152 ms 13120 KB Output is correct
93 Correct 190 ms 13476 KB Output is correct
94 Correct 183 ms 16228 KB Output is correct
95 Correct 309 ms 26956 KB Output is correct
96 Correct 311 ms 26948 KB Output is correct
97 Correct 282 ms 26996 KB Output is correct
98 Correct 226 ms 26900 KB Output is correct
99 Correct 209 ms 26952 KB Output is correct
100 Correct 212 ms 26864 KB Output is correct
101 Correct 172 ms 26952 KB Output is correct
102 Correct 182 ms 26948 KB Output is correct
103 Correct 211 ms 27076 KB Output is correct
104 Correct 234 ms 26920 KB Output is correct
105 Correct 240 ms 25528 KB Output is correct
106 Correct 195 ms 26984 KB Output is correct
107 Correct 212 ms 27016 KB Output is correct
108 Correct 237 ms 26520 KB Output is correct
109 Correct 267 ms 27096 KB Output is correct
110 Correct 232 ms 27024 KB Output is correct
111 Correct 213 ms 26948 KB Output is correct
112 Correct 203 ms 26620 KB Output is correct
113 Correct 232 ms 26484 KB Output is correct
114 Correct 196 ms 26552 KB Output is correct
115 Correct 110 ms 12988 KB Output is correct
116 Correct 110 ms 13072 KB Output is correct
117 Correct 163 ms 19968 KB Output is correct
118 Correct 149 ms 19964 KB Output is correct
119 Correct 189 ms 26984 KB Output is correct
120 Correct 226 ms 26936 KB Output is correct