답안 #679032

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679032	2023-01-07T08:37:44 Z	sunwukong123	Cigle (COI21_cigle)	C++14	100 / 100	248 ms	234616 KB

cigle

#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;
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
			chmax(dp[i][j], mx[idx-1][i-1] + sum); // the bottom row has 1 more than this. 
			mx[i][j]=max(mx[i-1][j], 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	0 ms	468 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	980 KB	Output is correct
11	Correct	1 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	1 ms	980 KB	Output is correct
14	Correct	1 ms	980 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	980 KB	Output is correct
17	Correct	1 ms	980 KB	Output is correct
18	Correct	1 ms	980 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	1 ms	956 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	7252 KB	Output is correct
2	Correct	4 ms	7252 KB	Output is correct
3	Correct	4 ms	7252 KB	Output is correct
4	Correct	4 ms	7252 KB	Output is correct
5	Correct	4 ms	7252 KB	Output is correct
6	Correct	4 ms	7252 KB	Output is correct
7	Correct	4 ms	7252 KB	Output is correct
8	Correct	7 ms	7252 KB	Output is correct
9	Correct	5 ms	7252 KB	Output is correct
10	Correct	6 ms	7252 KB	Output is correct
11	Correct	4 ms	7252 KB	Output is correct
12	Correct	4 ms	7224 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	980 KB	Output is correct
11	Correct	1 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	1 ms	980 KB	Output is correct
14	Correct	1 ms	980 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	980 KB	Output is correct
17	Correct	1 ms	980 KB	Output is correct
18	Correct	1 ms	980 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	1 ms	956 KB	Output is correct
21	Correct	4 ms	7252 KB	Output is correct
22	Correct	4 ms	7252 KB	Output is correct
23	Correct	4 ms	7252 KB	Output is correct
24	Correct	4 ms	7252 KB	Output is correct
25	Correct	4 ms	7252 KB	Output is correct
26	Correct	4 ms	7252 KB	Output is correct
27	Correct	4 ms	7252 KB	Output is correct
28	Correct	7 ms	7252 KB	Output is correct
29	Correct	5 ms	7252 KB	Output is correct
30	Correct	6 ms	7252 KB	Output is correct
31	Correct	4 ms	7252 KB	Output is correct
32	Correct	4 ms	7224 KB	Output is correct
33	Correct	5 ms	7252 KB	Output is correct
34	Correct	4 ms	7252 KB	Output is correct
35	Correct	4 ms	7280 KB	Output is correct
36	Correct	4 ms	7252 KB	Output is correct
37	Correct	4 ms	7252 KB	Output is correct
38	Correct	4 ms	7252 KB	Output is correct
39	Correct	5 ms	7252 KB	Output is correct
40	Correct	5 ms	7220 KB	Output is correct
41	Correct	4 ms	7252 KB	Output is correct
42	Correct	4 ms	7252 KB	Output is correct
43	Correct	5 ms	7252 KB	Output is correct
44	Correct	4 ms	7252 KB	Output is correct
45	Correct	4 ms	7252 KB	Output is correct
46	Correct	4 ms	7252 KB	Output is correct
47	Correct	4 ms	7252 KB	Output is correct
48	Correct	4 ms	7228 KB	Output is correct
49	Correct	4 ms	7252 KB	Output is correct

Subtask #5
52.0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	0 ms	468 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	0 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	980 KB	Output is correct
11	Correct	1 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	1 ms	980 KB	Output is correct
14	Correct	1 ms	980 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	980 KB	Output is correct
17	Correct	1 ms	980 KB	Output is correct
18	Correct	1 ms	980 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	1 ms	956 KB	Output is correct
21	Correct	4 ms	7252 KB	Output is correct
22	Correct	4 ms	7252 KB	Output is correct
23	Correct	4 ms	7252 KB	Output is correct
24	Correct	4 ms	7252 KB	Output is correct
25	Correct	4 ms	7252 KB	Output is correct
26	Correct	4 ms	7252 KB	Output is correct
27	Correct	4 ms	7252 KB	Output is correct
28	Correct	7 ms	7252 KB	Output is correct
29	Correct	5 ms	7252 KB	Output is correct
30	Correct	6 ms	7252 KB	Output is correct
31	Correct	4 ms	7252 KB	Output is correct
32	Correct	4 ms	7224 KB	Output is correct
33	Correct	5 ms	7252 KB	Output is correct
34	Correct	4 ms	7252 KB	Output is correct
35	Correct	4 ms	7280 KB	Output is correct
36	Correct	4 ms	7252 KB	Output is correct
37	Correct	4 ms	7252 KB	Output is correct
38	Correct	4 ms	7252 KB	Output is correct
39	Correct	5 ms	7252 KB	Output is correct
40	Correct	5 ms	7220 KB	Output is correct
41	Correct	4 ms	7252 KB	Output is correct
42	Correct	4 ms	7252 KB	Output is correct
43	Correct	5 ms	7252 KB	Output is correct
44	Correct	4 ms	7252 KB	Output is correct
45	Correct	4 ms	7252 KB	Output is correct
46	Correct	4 ms	7252 KB	Output is correct
47	Correct	4 ms	7252 KB	Output is correct
48	Correct	4 ms	7228 KB	Output is correct
49	Correct	4 ms	7252 KB	Output is correct
50	Correct	199 ms	234552 KB	Output is correct
51	Correct	196 ms	234452 KB	Output is correct
52	Correct	199 ms	234480 KB	Output is correct
53	Correct	229 ms	234452 KB	Output is correct
54	Correct	210 ms	234540 KB	Output is correct
55	Correct	203 ms	234516 KB	Output is correct
56	Correct	233 ms	234572 KB	Output is correct
57	Correct	217 ms	234448 KB	Output is correct
58	Correct	220 ms	234508 KB	Output is correct
59	Correct	224 ms	234552 KB	Output is correct
60	Correct	209 ms	234520 KB	Output is correct
61	Correct	206 ms	234444 KB	Output is correct
62	Correct	212 ms	234608 KB	Output is correct
63	Correct	207 ms	234444 KB	Output is correct
64	Correct	205 ms	234516 KB	Output is correct
65	Correct	211 ms	234616 KB	Output is correct
66	Correct	210 ms	234444 KB	Output is correct
67	Correct	207 ms	234472 KB	Output is correct
68	Correct	219 ms	234532 KB	Output is correct
69	Correct	209 ms	234560 KB	Output is correct
70	Correct	201 ms	234504 KB	Output is correct
71	Correct	248 ms	234516 KB	Output is correct
72	Correct	227 ms	234532 KB	Output is correct

답안 #679032

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 11.0 / 11.0

Subtask #3 13.0 / 13.0

Subtask #4 15.0 / 15.0

Subtask #5 52.0 / 52.0

Subtask #1
9.0 / 9.0

Subtask #2
11.0 / 11.0

Subtask #3
13.0 / 13.0

Subtask #4
15.0 / 15.0

Subtask #5
52.0 / 52.0