oj.uz

답안 #488434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488434 2021-11-18T21:54:12 Z cfalas Financial Report (JOI21_financial) C++14
100 / 100
 1770 ms 95108 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

vi a, b;
int n, k;
map<int, int> m;

int pos[900000];

struct node{
	node *L, *R;
	int val, p;

	void build(int l=0, int r=n-1){
		if(l==r) val = -MOD, p=l;
		else{
			L = new node();
			R = new node();
			L->build(l,MID);
			R->build(MID+1, r);
			val = -MOD;
			p = L->p;
		}
	}

	void update(int pos, int v, int l=0, int r=n-1){
		if(l==r && l==pos) val = v;
		else if (l==r || pos<l || pos>r) return;
		else{
			L->update(pos,v,l,MID);
			R->update(pos,v,MID+1,r);
			val = max(L->val, R->val);
			if(L->val > R->val) p = L->val;
			else p = R->val;
		}
	}

	int query(int rl, int rr, int l=0, int r=n-1){
		if(rl<=l && r<=rr) return val;
		else if(l>rr || rl>r) return -MOD;
		else return max(L->query(rl,rr,l,MID), R->query(rl,rr,MID+1,r));
	}

	int queryp(int rl, int rr, int l=0, int r=n-1){
		if(rl<=l && r<=rr) return p;
		else if(l>rr || rl>r) return 0;
		else{
			int a1 = L->query(rl,rr,l,MID);
			int a2 = R->query(rl,rr,MID+1,r);
			if(a1>=a2) return L->queryp(rl,rr,l,MID);
			else return R->queryp(rl,rr,MID+1,r);
		}
	}
};

int main(){
	node seg;
	node seg2;
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>k;
	seg.build();
	seg2.build();

	a.resize(n);
	FOR(i,n) cin>>a[i];

	int cnt=0;
	set<int> all;
	FOR(i,n) all.insert(a[i]);
	FOA(v, all) m[v] = ++cnt;
	FOR(i,n) a[i] = m[a[i]];
	//FOR(i,n) cout<<a[i]<<" "; cout<<endl;
	FOR(i,n) seg2.update(i, -a[i]);

	node seg3;
	seg3.build();
	FOR(i,n-k+1) seg3.update(i, -seg2.query(i, i+k-1));

	FOR(i,n){
		int l=i+1, r=n-k;
		pos[i] = n-1;
		while(l<=r){
			if(seg3.query(i+1, MID)>a[i]) pos[i] = MID+k-1, r=MID-1;
			else l=MID+1;
		}
		//cout<<pos[i]<<" ";
		/*
		int cnt=0;
		pos[i] = n-1;
		FORi(j,i+1,n){
			if(a[j]>a[i]) cnt++;
			else cnt=0;
			if(cnt<=k && a[j]>a[i]) pos[i] = j;
			if(cnt>=k) break;
		}*/
		//cout<<pos[i]<<endl;
	}
	//cout<<endl;

	vii b(n);
	FOR(i,n) b[i] = {-a[i], i};
	sort(b.begin(), b.end());
	FOA(v,b){
		int ans = seg.query(v.S+1, pos[v.S]);
		ans = max(ans, 0);
		//cout<<v.S+1<<" "<<pos[v.S]<<" "<<ans<<endl;
		seg.update(v.S, 1+ans);
	}
	//cout<<endl;
	cout<<seg.query(0, n-1)<<endl;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 17 ms 1824 KB Output is correct
42 Correct 20 ms 2300 KB Output is correct
43 Correct 17 ms 1792 KB Output is correct
44 Correct 16 ms 1772 KB Output is correct
45 Correct 17 ms 2008 KB Output is correct
46 Correct 8 ms 2392 KB Output is correct
47 Correct 18 ms 2372 KB Output is correct
48 Correct 19 ms 2296 KB Output is correct
49 Correct 26 ms 2420 KB Output is correct
50 Correct 21 ms 2336 KB Output is correct
51 Correct 19 ms 2456 KB Output is correct
52 Correct 19 ms 2448 KB Output is correct
53 Correct 18 ms 2332 KB Output is correct
54 Correct 20 ms 2380 KB Output is correct
55 Correct 20 ms 2396 KB Output is correct
56 Correct 19 ms 2380 KB Output is correct
57 Correct 19 ms 2452 KB Output is correct
58 Correct 6 ms 2380 KB Output is correct
59 Correct 6 ms 2400 KB Output is correct
60 Correct 17 ms 2396 KB Output is correct
61 Correct 19 ms 2400 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1044 ms 63648 KB Output is correct
2 Correct 1142 ms 66496 KB Output is correct
3 Correct 1211 ms 66556 KB Output is correct
4 Correct 1543 ms 90740 KB Output is correct
5 Correct 1421 ms 94800 KB Output is correct
6 Correct 1584 ms 94936 KB Output is correct
7 Correct 1202 ms 94264 KB Output is correct
8 Correct 1188 ms 94544 KB Output is correct
9 Correct 1205 ms 94824 KB Output is correct
10 Correct 1231 ms 94708 KB Output is correct
11 Correct 1314 ms 94728 KB Output is correct
12 Correct 1340 ms 94796 KB Output is correct
13 Correct 1362 ms 94920 KB Output is correct
14 Correct 1546 ms 94980 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 63772 KB Output is correct
2 Correct 338 ms 66636 KB Output is correct
3 Correct 396 ms 66976 KB Output is correct
4 Correct 706 ms 94808 KB Output is correct
5 Correct 584 ms 94860 KB Output is correct
6 Correct 696 ms 94856 KB Output is correct
7 Correct 352 ms 94920 KB Output is correct
8 Correct 354 ms 94900 KB Output is correct
9 Correct 350 ms 94092 KB Output is correct
10 Correct 449 ms 94496 KB Output is correct
11 Correct 659 ms 94804 KB Output is correct
12 Correct 532 ms 94848 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 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 17 ms 1824 KB Output is correct
42 Correct 20 ms 2300 KB Output is correct
43 Correct 17 ms 1792 KB Output is correct
44 Correct 16 ms 1772 KB Output is correct
45 Correct 17 ms 2008 KB Output is correct
46 Correct 8 ms 2392 KB Output is correct
47 Correct 18 ms 2372 KB Output is correct
48 Correct 19 ms 2296 KB Output is correct
49 Correct 26 ms 2420 KB Output is correct
50 Correct 21 ms 2336 KB Output is correct
51 Correct 19 ms 2456 KB Output is correct
52 Correct 19 ms 2448 KB Output is correct
53 Correct 18 ms 2332 KB Output is correct
54 Correct 20 ms 2380 KB Output is correct
55 Correct 20 ms 2396 KB Output is correct
56 Correct 19 ms 2380 KB Output is correct
57 Correct 19 ms 2452 KB Output is correct
58 Correct 6 ms 2380 KB Output is correct
59 Correct 6 ms 2400 KB Output is correct
60 Correct 17 ms 2396 KB Output is correct
61 Correct 19 ms 2400 KB Output is correct
62 Correct 1044 ms 63648 KB Output is correct
63 Correct 1142 ms 66496 KB Output is correct
64 Correct 1211 ms 66556 KB Output is correct
65 Correct 1543 ms 90740 KB Output is correct
66 Correct 1421 ms 94800 KB Output is correct
67 Correct 1584 ms 94936 KB Output is correct
68 Correct 1202 ms 94264 KB Output is correct
69 Correct 1188 ms 94544 KB Output is correct
70 Correct 1205 ms 94824 KB Output is correct
71 Correct 1231 ms 94708 KB Output is correct
72 Correct 1314 ms 94728 KB Output is correct
73 Correct 1340 ms 94796 KB Output is correct
74 Correct 1362 ms 94920 KB Output is correct
75 Correct 1546 ms 94980 KB Output is correct
76 Correct 217 ms 63772 KB Output is correct
77 Correct 338 ms 66636 KB Output is correct
78 Correct 396 ms 66976 KB Output is correct
79 Correct 706 ms 94808 KB Output is correct
80 Correct 584 ms 94860 KB Output is correct
81 Correct 696 ms 94856 KB Output is correct
82 Correct 352 ms 94920 KB Output is correct
83 Correct 354 ms 94900 KB Output is correct
84 Correct 350 ms 94092 KB Output is correct
85 Correct 449 ms 94496 KB Output is correct
86 Correct 659 ms 94804 KB Output is correct
87 Correct 532 ms 94848 KB Output is correct
88 Correct 1287 ms 66724 KB Output is correct
89 Correct 1616 ms 93840 KB Output is correct
90 Correct 1429 ms 71000 KB Output is correct
91 Correct 1625 ms 94860 KB Output is correct
92 Correct 1210 ms 66792 KB Output is correct
93 Correct 1271 ms 67204 KB Output is correct
94 Correct 869 ms 86420 KB Output is correct
95 Correct 1487 ms 94804 KB Output is correct
96 Correct 1675 ms 94980 KB Output is correct
97 Correct 1770 ms 94808 KB Output is correct
98 Correct 1640 ms 94884 KB Output is correct
99 Correct 1580 ms 94952 KB Output is correct
100 Correct 1596 ms 94796 KB Output is correct
101 Correct 1210 ms 94828 KB Output is correct
102 Correct 1264 ms 94728 KB Output is correct
103 Correct 1334 ms 94932 KB Output is correct
104 Correct 1411 ms 94836 KB Output is correct
105 Correct 1453 ms 94908 KB Output is correct
106 Correct 1303 ms 94936 KB Output is correct
107 Correct 1366 ms 94800 KB Output is correct
108 Correct 1493 ms 94784 KB Output is correct
109 Correct 1330 ms 94808 KB Output is correct
110 Correct 1565 ms 94872 KB Output is correct
111 Correct 1567 ms 94824 KB Output is correct
112 Correct 1348 ms 95036 KB Output is correct
113 Correct 1536 ms 94804 KB Output is correct
114 Correct 1547 ms 95108 KB Output is correct
115 Correct 353 ms 94756 KB Output is correct
116 Correct 349 ms 94832 KB Output is correct
117 Correct 771 ms 94908 KB Output is correct
118 Correct 769 ms 94932 KB Output is correct
119 Correct 1340 ms 94856 KB Output is correct
120 Correct 1328 ms 94892 KB Output is correct