oj.uz

답안 #528550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528550 2022-02-20T13:58:50 Z Ninja_Kunai Financial Report (JOI21_financial) C++14
65 / 100
 293 ms 15356 KB 
/** 
*    Author :  Nguyen Tuan Vu
*    Created : 20.02.2022
**/

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define fx(i,j,n) for(int i=(j);i<=(n);i++)
#define fn(i,j,n) for(int i=(j);i>=(n);i--)
#define fi first
#define se second
#define MASK(i) (1LL<<(i))
#define BIT(x,i) (((x)>>(i))&1)
#define ALL(v) (v).begin(), (v).end()
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> ii;
typedef pair <ll, ll> li;
typedef tuple <int, int, int> tup;

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

void file(){
	#define TASK "TASK"
	freopen(TASK".inp","r",stdin);
	freopen(TASK".out","w",stdout);
}

const int Mod = 1e9 + 7;
const int N = 3e5 + 5;
const int INF = 1e9 + 7;
const ll INFLL = 1e18 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l, ll r) {return l + rng() % (r - l + 1);}

int n, d, a[N], dp[7005][7005];

void sub2() {
	a[0] = -1;
	fx (i, 0, n - 1) fx (j, 0, i) fx (k, 1, min(d, n - i)) {
		int new_k = (a[i + k] >= a[j] ? i + k : j);
		maximize(dp[i + k][new_k], dp[i][j] + (a[i + k] > a[j]));
	}

	int ans = 0;
	fx (i, 0, n) maximize(ans, dp[n][i]);
	cout << ans;
}

struct Fenwick_Tree{
	vector <int> bit;

	Fenwick_Tree(int _n = 0) {
		n = _n;
		bit.resize(n + 7, 0);
	}

	void update(int x, int val) {
		for (; x <= n; x += x&-x) maximize(bit[x], val);
	}

	int get(int x) {
		int ans = 0;
		for (; x; x -= x&-x) maximize(ans, bit[x]);
		return ans;
	}
} mybit;

void sub5() {
	mybit = Fenwick_Tree(n);
	vector <int> ctz;
	fx (i, 1, n) ctz.push_back(a[i]);
	sort (ALL(ctz)); ctz.erase(unique(ALL(ctz)), ctz.end());
	int ans = 0;
	fx (i, 1, n) {
		a[i] = lower_bound(ALL(ctz), a[i]) - ctz.begin() + 1;
		int x = mybit.get(a[i] - 1) + 1;
		mybit.update(a[i], x);
		maximize(ans, x);
	}
	cout << ans;
}

void sub4() {
	multiset <int> s;
	int ans = 0;
	fn (i, n, 1) {
		stack <int> tmp;
		if (s.size()) 
			for (auto it = s.begin(); it != s.end(); ++it) 
				if (*it <= a[i]) tmp.push(*it);
				else break;
		while (tmp.size()) {
			int u = tmp.top();
			tmp.pop();
			s.erase(s.lower_bound(u));
		}
		s.insert(a[i]);
		maximize(ans, s.size());
	}
	cout << ans;
}

int f[7005];

void sub3() {
	fn (i, n, 1) {
		int lim = min(i + d, n);
		f[i] = 1;
		fx (j, i + 1, lim) 
			if (a[i] >= a[j]) lim = min(j + d, n);
			else maximize(f[i], f[j] + 1);
	}
	cout << *max_element(f + 1, f + n + 1);
}

void solve()
{
	cin >> n >> d;
	fx (i, 1, n) cin >> a[i];
	if (d == n) sub5();
	else if (d == 1) sub4();
	else if (n <= 400) sub2();
	else sub3();
}
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//	file();
	int T = 1;
	//cin>>T;
	while(T--)
	{
	solve();
	}
	return 0;
}
/*** DEBUG, DON'T LAZY AND DON'T ASK OTHERS MUCH ***/
/*
|----------------|
|   TRY  HARD    |
|----------------|
 (\_/)  ||
(=.-.=) ||
/> o  \>||
\  o  / ||
 \/ \/  ||
*/

Compilation message

Main.cpp: In function 'void sub4()':
Main.cpp:100:6: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
  100 |   if (s.size())
      |      ^
Main.cpp: In instantiation of 'bool maximize(X&, Y) [with X = int; Y = long unsigned int]':
Main.cpp:110:25:   required from here
Main.cpp:29:11: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   29 |     if (a < b) return a = b, true;
      |         ~~^~~
Main.cpp: In function 'void file()':
Main.cpp:35:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen(TASK".inp","r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  freopen(TASK".out","w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 2 ms 2124 KB Output is correct
29 Correct 2 ms 1996 KB Output is correct
30 Correct 4 ms 2124 KB Output is correct
31 Correct 10 ms 2092 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 2252 KB Output is correct
34 Correct 4 ms 2252 KB Output is correct
35 Correct 3 ms 2124 KB Output is correct
36 Correct 6 ms 2124 KB Output is correct
37 Correct 2 ms 1868 KB Output is correct
38 Correct 3 ms 1996 KB Output is correct
39 Correct 4 ms 2252 KB Output is correct
40 Correct 5 ms 2252 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 12 ms 332 KB Output is correct
44 Correct 43 ms 332 KB Output is correct
45 Correct 67 ms 372 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 5 ms 332 KB Output is correct
48 Correct 25 ms 508 KB Output is correct
49 Correct 34 ms 332 KB Output is correct
50 Correct 41 ms 380 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 3 ms 332 KB Output is correct
55 Correct 65 ms 376 KB Output is correct
56 Correct 37 ms 332 KB Output is correct
57 Correct 39 ms 332 KB Output is correct
58 Correct 27 ms 384 KB Output is correct
59 Correct 24 ms 380 KB Output is correct
60 Correct 25 ms 368 KB Output is correct
61 Correct 20 ms 332 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 1484 KB Output is correct
2 Correct 50 ms 1472 KB Output is correct
3 Correct 56 ms 1464 KB Output is correct
4 Correct 57 ms 1480 KB Output is correct
5 Correct 64 ms 1484 KB Output is correct
6 Correct 77 ms 1400 KB Output is correct
7 Correct 101 ms 15356 KB Output is correct
8 Correct 45 ms 1420 KB Output is correct
9 Correct 100 ms 10912 KB Output is correct
10 Correct 51 ms 1484 KB Output is correct
11 Correct 62 ms 1496 KB Output is correct
12 Correct 58 ms 1480 KB Output is correct
13 Correct 68 ms 1544 KB Output is correct
14 Correct 47 ms 1480 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 4792 KB Output is correct
2 Correct 57 ms 4864 KB Output is correct
3 Correct 88 ms 4760 KB Output is correct
4 Correct 125 ms 4800 KB Output is correct
5 Correct 97 ms 4788 KB Output is correct
6 Correct 109 ms 4836 KB Output is correct
7 Correct 54 ms 4836 KB Output is correct
8 Correct 53 ms 4836 KB Output is correct
9 Correct 77 ms 4800 KB Output is correct
10 Correct 101 ms 4772 KB Output is correct
11 Correct 102 ms 4800 KB Output is correct
12 Correct 85 ms 4796 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 2 ms 2124 KB Output is correct
29 Correct 2 ms 1996 KB Output is correct
30 Correct 4 ms 2124 KB Output is correct
31 Correct 10 ms 2092 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 2252 KB Output is correct
34 Correct 4 ms 2252 KB Output is correct
35 Correct 3 ms 2124 KB Output is correct
36 Correct 6 ms 2124 KB Output is correct
37 Correct 2 ms 1868 KB Output is correct
38 Correct 3 ms 1996 KB Output is correct
39 Correct 4 ms 2252 KB Output is correct
40 Correct 5 ms 2252 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 12 ms 332 KB Output is correct
44 Correct 43 ms 332 KB Output is correct
45 Correct 67 ms 372 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 5 ms 332 KB Output is correct
48 Correct 25 ms 508 KB Output is correct
49 Correct 34 ms 332 KB Output is correct
50 Correct 41 ms 380 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 3 ms 332 KB Output is correct
55 Correct 65 ms 376 KB Output is correct
56 Correct 37 ms 332 KB Output is correct
57 Correct 39 ms 332 KB Output is correct
58 Correct 27 ms 384 KB Output is correct
59 Correct 24 ms 380 KB Output is correct
60 Correct 25 ms 368 KB Output is correct
61 Correct 20 ms 332 KB Output is correct
62 Correct 49 ms 1484 KB Output is correct
63 Correct 50 ms 1472 KB Output is correct
64 Correct 56 ms 1464 KB Output is correct
65 Correct 57 ms 1480 KB Output is correct
66 Correct 64 ms 1484 KB Output is correct
67 Correct 77 ms 1400 KB Output is correct
68 Correct 101 ms 15356 KB Output is correct
69 Correct 45 ms 1420 KB Output is correct
70 Correct 100 ms 10912 KB Output is correct
71 Correct 51 ms 1484 KB Output is correct
72 Correct 62 ms 1496 KB Output is correct
73 Correct 58 ms 1480 KB Output is correct
74 Correct 68 ms 1544 KB Output is correct
75 Correct 47 ms 1480 KB Output is correct
76 Correct 50 ms 4792 KB Output is correct
77 Correct 57 ms 4864 KB Output is correct
78 Correct 88 ms 4760 KB Output is correct
79 Correct 125 ms 4800 KB Output is correct
80 Correct 97 ms 4788 KB Output is correct
81 Correct 109 ms 4836 KB Output is correct
82 Correct 54 ms 4836 KB Output is correct
83 Correct 53 ms 4836 KB Output is correct
84 Correct 77 ms 4800 KB Output is correct
85 Correct 101 ms 4772 KB Output is correct
86 Correct 102 ms 4800 KB Output is correct
87 Correct 85 ms 4796 KB Output is correct
88 Runtime error 293 ms 8068 KB Execution killed with signal 11
89 Halted 0 ms 0 KB -