oj.uz

답안 #679035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679035 2023-01-07T08:45:29 Z sunwukong123 Cigle (COI21_cigle) C++14
100 / 100
 788 ms 288200 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 5005;
int dp[MAXN][MAXN];
int mx[MAXN][MAXN];
int n;
int A[MAXN];
int ans;
struct fenv{
	int fw[MAXN];
	fenv(){
		FOR(i,0,n)fw[i]=-inf;
	}
	void update(int x, int nval) {
		for(;x<MAXN;x+=x&-x)chmax(fw[x],nval);
	}
	int get(int x) {
		int r=-inf;
		for(;x;x-=x&-x)chmax(r,fw[x]);
		return r;
	}
} BIT[MAXN];
int32_t main() 
{
	cin >> n;
	FOR(i,1,n) cin >> A[i];
	FOR(i,0,n)mx[i][0]=mx[0][i]=-inf;
	FOR(i,1,n) {
		int sum = 0, same=0, lf = 0, rg = 0, idx=i;
		FOR(j,i,n) { // count the equal for the previous guy here.
			dp[i][j]=dp[i][j-1]; // this guy has nothing underneath
			chmax(dp[i][j], dp[idx][i-1] + sum - same); // the last equal can't be counted if the previous row doesn't have a thing after this
			if(i!=1)chmax(dp[i][j], BIT[i-1].get(idx-1)+ sum); // the bottom row has 1 more than this. 
			//mx[i][j]=max(mx[i-1][j], dp[i][j]);
			BIT[j].update(i,dp[i][j]);
			rg += A[j];
			while(rg>lf && idx>1) {
				--idx;
				lf += A[idx];
			}
			sum += (lf == rg);
			if(lf>=rg)same=(lf==rg); // there's 
		}
		chmax(ans, dp[i][n]);
	}
	cout << ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21076 KB Output is correct
2 Correct 8 ms 21076 KB Output is correct
3 Correct 9 ms 21084 KB Output is correct
4 Correct 8 ms 21076 KB Output is correct
5 Correct 8 ms 21076 KB Output is correct
6 Correct 8 ms 21076 KB Output is correct
7 Correct 8 ms 20820 KB Output is correct
8 Correct 8 ms 21008 KB Output is correct
9 Correct 8 ms 21076 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21076 KB Output is correct
2 Correct 8 ms 21076 KB Output is correct
3 Correct 9 ms 21084 KB Output is correct
4 Correct 8 ms 21076 KB Output is correct
5 Correct 8 ms 21076 KB Output is correct
6 Correct 8 ms 21076 KB Output is correct
7 Correct 8 ms 20820 KB Output is correct
8 Correct 8 ms 21008 KB Output is correct
9 Correct 8 ms 21076 KB Output is correct
10 Correct 9 ms 22596 KB Output is correct
11 Correct 11 ms 22516 KB Output is correct
12 Correct 9 ms 22484 KB Output is correct
13 Correct 11 ms 22548 KB Output is correct
14 Correct 9 ms 22612 KB Output is correct
15 Correct 9 ms 22612 KB Output is correct
16 Correct 9 ms 21716 KB Output is correct
17 Correct 9 ms 22508 KB Output is correct
18 Correct 9 ms 22516 KB Output is correct
19 Correct 9 ms 22356 KB Output is correct
20 Correct 9 ms 22424 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 33620 KB Output is correct
2 Correct 20 ms 33608 KB Output is correct
3 Correct 22 ms 33612 KB Output is correct
4 Correct 23 ms 33600 KB Output is correct
5 Correct 25 ms 33600 KB Output is correct
6 Correct 20 ms 33604 KB Output is correct
7 Correct 20 ms 33620 KB Output is correct
8 Correct 19 ms 33684 KB Output is correct
9 Correct 18 ms 33620 KB Output is correct
10 Correct 19 ms 33600 KB Output is correct
11 Correct 22 ms 33708 KB Output is correct
12 Correct 19 ms 33704 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21076 KB Output is correct
2 Correct 8 ms 21076 KB Output is correct
3 Correct 9 ms 21084 KB Output is correct
4 Correct 8 ms 21076 KB Output is correct
5 Correct 8 ms 21076 KB Output is correct
6 Correct 8 ms 21076 KB Output is correct
7 Correct 8 ms 20820 KB Output is correct
8 Correct 8 ms 21008 KB Output is correct
9 Correct 8 ms 21076 KB Output is correct
10 Correct 9 ms 22596 KB Output is correct
11 Correct 11 ms 22516 KB Output is correct
12 Correct 9 ms 22484 KB Output is correct
13 Correct 11 ms 22548 KB Output is correct
14 Correct 9 ms 22612 KB Output is correct
15 Correct 9 ms 22612 KB Output is correct
16 Correct 9 ms 21716 KB Output is correct
17 Correct 9 ms 22508 KB Output is correct
18 Correct 9 ms 22516 KB Output is correct
19 Correct 9 ms 22356 KB Output is correct
20 Correct 9 ms 22424 KB Output is correct
21 Correct 18 ms 33620 KB Output is correct
22 Correct 20 ms 33608 KB Output is correct
23 Correct 22 ms 33612 KB Output is correct
24 Correct 23 ms 33600 KB Output is correct
25 Correct 25 ms 33600 KB Output is correct
26 Correct 20 ms 33604 KB Output is correct
27 Correct 20 ms 33620 KB Output is correct
28 Correct 19 ms 33684 KB Output is correct
29 Correct 18 ms 33620 KB Output is correct
30 Correct 19 ms 33600 KB Output is correct
31 Correct 22 ms 33708 KB Output is correct
32 Correct 19 ms 33704 KB Output is correct
33 Correct 18 ms 33620 KB Output is correct
34 Correct 19 ms 33612 KB Output is correct
35 Correct 19 ms 33676 KB Output is correct
36 Correct 24 ms 33672 KB Output is correct
37 Correct 22 ms 33676 KB Output is correct
38 Correct 20 ms 33620 KB Output is correct
39 Correct 26 ms 33700 KB Output is correct
40 Correct 19 ms 31632 KB Output is correct
41 Correct 18 ms 33652 KB Output is correct
42 Correct 18 ms 33620 KB Output is correct
43 Correct 18 ms 33512 KB Output is correct
44 Correct 21 ms 31972 KB Output is correct
45 Correct 19 ms 33252 KB Output is correct
46 Correct 19 ms 33364 KB Output is correct
47 Correct 19 ms 33492 KB Output is correct
48 Correct 20 ms 33364 KB Output is correct
49 Correct 29 ms 33508 KB Output is correct

Subtask #5
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21076 KB Output is correct
2 Correct 8 ms 21076 KB Output is correct
3 Correct 9 ms 21084 KB Output is correct
4 Correct 8 ms 21076 KB Output is correct
5 Correct 8 ms 21076 KB Output is correct
6 Correct 8 ms 21076 KB Output is correct
7 Correct 8 ms 20820 KB Output is correct
8 Correct 8 ms 21008 KB Output is correct
9 Correct 8 ms 21076 KB Output is correct
10 Correct 9 ms 22596 KB Output is correct
11 Correct 11 ms 22516 KB Output is correct
12 Correct 9 ms 22484 KB Output is correct
13 Correct 11 ms 22548 KB Output is correct
14 Correct 9 ms 22612 KB Output is correct
15 Correct 9 ms 22612 KB Output is correct
16 Correct 9 ms 21716 KB Output is correct
17 Correct 9 ms 22508 KB Output is correct
18 Correct 9 ms 22516 KB Output is correct
19 Correct 9 ms 22356 KB Output is correct
20 Correct 9 ms 22424 KB Output is correct
21 Correct 18 ms 33620 KB Output is correct
22 Correct 20 ms 33608 KB Output is correct
23 Correct 22 ms 33612 KB Output is correct
24 Correct 23 ms 33600 KB Output is correct
25 Correct 25 ms 33600 KB Output is correct
26 Correct 20 ms 33604 KB Output is correct
27 Correct 20 ms 33620 KB Output is correct
28 Correct 19 ms 33684 KB Output is correct
29 Correct 18 ms 33620 KB Output is correct
30 Correct 19 ms 33600 KB Output is correct
31 Correct 22 ms 33708 KB Output is correct
32 Correct 19 ms 33704 KB Output is correct
33 Correct 18 ms 33620 KB Output is correct
34 Correct 19 ms 33612 KB Output is correct
35 Correct 19 ms 33676 KB Output is correct
36 Correct 24 ms 33672 KB Output is correct
37 Correct 22 ms 33676 KB Output is correct
38 Correct 20 ms 33620 KB Output is correct
39 Correct 26 ms 33700 KB Output is correct
40 Correct 19 ms 31632 KB Output is correct
41 Correct 18 ms 33652 KB Output is correct
42 Correct 18 ms 33620 KB Output is correct
43 Correct 18 ms 33512 KB Output is correct
44 Correct 21 ms 31972 KB Output is correct
45 Correct 19 ms 33252 KB Output is correct
46 Correct 19 ms 33364 KB Output is correct
47 Correct 19 ms 33492 KB Output is correct
48 Correct 20 ms 33364 KB Output is correct
49 Correct 29 ms 33508 KB Output is correct
50 Correct 630 ms 288048 KB Output is correct
51 Correct 634 ms 288072 KB Output is correct
52 Correct 564 ms 288072 KB Output is correct
53 Correct 609 ms 288040 KB Output is correct
54 Correct 564 ms 288016 KB Output is correct
55 Correct 705 ms 288200 KB Output is correct
56 Correct 660 ms 288016 KB Output is correct
57 Correct 711 ms 288052 KB Output is correct
58 Correct 613 ms 288104 KB Output is correct
59 Correct 697 ms 287908 KB Output is correct
60 Correct 601 ms 287272 KB Output is correct
61 Correct 663 ms 288072 KB Output is correct
62 Correct 761 ms 288000 KB Output is correct
63 Correct 719 ms 287836 KB Output is correct
64 Correct 629 ms 288004 KB Output is correct
65 Correct 623 ms 287780 KB Output is correct
66 Correct 582 ms 287632 KB Output is correct
67 Correct 597 ms 287428 KB Output is correct
68 Correct 626 ms 287304 KB Output is correct
69 Correct 753 ms 287252 KB Output is correct
70 Correct 788 ms 287380 KB Output is correct
71 Correct 618 ms 287920 KB Output is correct
72 Correct 583 ms 287968 KB Output is correct