답안 #676286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676286	2022-12-30T06:44:33 Z	armashka	Cigle (COI21_cigle)	C++17	48 / 100	1000 ms	27464 KB

cigle

#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ft first
#define sd second
#define ll int
#define pll pair<ll,ll>
const int N = 2e5 + 5;
const int M = 1e7 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e9;

ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x);x=binmul(x,x);ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, a[5001], dp[5001][5001], pr[5001];
bool used[5001][5001];

void check(ll l, ll r) {
	if (used[l][r]) return;
	used[l][r] = 1;

	int j = l, cnt = 0, sum = 0;
	for (int i = l - 1; i >= 1; -- i) {
		while (pr[l - 1] - pr[i - 1] > sum && j <= r) sum += a[j++];
		
		if (!used[i][l - 1]) check(i, l - 1);
		
		dp[l][r] = max(dp[l][r], dp[i][l - 1] + cnt);
		if (pr[l - 1] - pr[i - 1] == sum && j <= r) ++ cnt;			
	}
}

const void solve() {
	cin >> n;
	for (int i = 1; i <= n; ++ i) cin >> a[i], pr[i] = pr[i - 1] + a[i];
	for (int i = 1; i <= n; ++ i) used[1][i] = 1;
	ll ans = 0;
	for (int i = n; i >= 1; -- i) {
		if (!used[i][n]) check(i, n);
		ans = max(ans, dp[i][n]);
	} 
	cout << ans;
}

int main() {
   	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	srand(time(NULL));
    
	ll tt = 1;
	// cin >> tt; 

	while (tt --) solve();

	return 0;
}

Compilation message

cigle.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization("O3")
      | 
cigle.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("unroll-loops")
      | 
cigle.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 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	1 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	1 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	1 ms	468 KB	Output is correct
2	Correct	1 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	1 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	1 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	2 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	2 ms	980 KB	Output is correct
14	Correct	2 ms	980 KB	Output is correct
15	Correct	2 ms	980 KB	Output is correct
16	Correct	2 ms	980 KB	Output is correct
17	Correct	2 ms	980 KB	Output is correct
18	Correct	2 ms	992 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	2 ms	980 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	93 ms	4928 KB	Output is correct
2	Correct	95 ms	4968 KB	Output is correct
3	Correct	91 ms	4972 KB	Output is correct
4	Correct	98 ms	4912 KB	Output is correct
5	Correct	101 ms	4904 KB	Output is correct
6	Correct	109 ms	4940 KB	Output is correct
7	Correct	109 ms	4976 KB	Output is correct
8	Correct	107 ms	4920 KB	Output is correct
9	Correct	153 ms	4884 KB	Output is correct
10	Correct	95 ms	4976 KB	Output is correct
11	Correct	114 ms	4952 KB	Output is correct
12	Correct	122 ms	4968 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 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	1 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	1 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	2 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	2 ms	980 KB	Output is correct
14	Correct	2 ms	980 KB	Output is correct
15	Correct	2 ms	980 KB	Output is correct
16	Correct	2 ms	980 KB	Output is correct
17	Correct	2 ms	980 KB	Output is correct
18	Correct	2 ms	992 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	2 ms	980 KB	Output is correct
21	Correct	93 ms	4928 KB	Output is correct
22	Correct	95 ms	4968 KB	Output is correct
23	Correct	91 ms	4972 KB	Output is correct
24	Correct	98 ms	4912 KB	Output is correct
25	Correct	101 ms	4904 KB	Output is correct
26	Correct	109 ms	4940 KB	Output is correct
27	Correct	109 ms	4976 KB	Output is correct
28	Correct	107 ms	4920 KB	Output is correct
29	Correct	153 ms	4884 KB	Output is correct
30	Correct	95 ms	4976 KB	Output is correct
31	Correct	114 ms	4952 KB	Output is correct
32	Correct	122 ms	4968 KB	Output is correct
33	Correct	97 ms	4928 KB	Output is correct
34	Correct	95 ms	4984 KB	Output is correct
35	Correct	100 ms	4876 KB	Output is correct
36	Correct	114 ms	5048 KB	Output is correct
37	Correct	145 ms	4980 KB	Output is correct
38	Correct	108 ms	4952 KB	Output is correct
39	Correct	140 ms	4988 KB	Output is correct
40	Correct	163 ms	4984 KB	Output is correct
41	Correct	130 ms	4992 KB	Output is correct
42	Correct	121 ms	4940 KB	Output is correct
43	Correct	113 ms	5080 KB	Output is correct
44	Correct	122 ms	4932 KB	Output is correct
45	Correct	120 ms	4920 KB	Output is correct
46	Correct	117 ms	4940 KB	Output is correct
47	Correct	126 ms	4988 KB	Output is correct
48	Correct	104 ms	4940 KB	Output is correct
49	Correct	103 ms	4904 KB	Output is correct

Subtask #5
0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 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	1 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	1 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	2 ms	980 KB	Output is correct
12	Correct	1 ms	980 KB	Output is correct
13	Correct	2 ms	980 KB	Output is correct
14	Correct	2 ms	980 KB	Output is correct
15	Correct	2 ms	980 KB	Output is correct
16	Correct	2 ms	980 KB	Output is correct
17	Correct	2 ms	980 KB	Output is correct
18	Correct	2 ms	992 KB	Output is correct
19	Correct	1 ms	980 KB	Output is correct
20	Correct	2 ms	980 KB	Output is correct
21	Correct	93 ms	4928 KB	Output is correct
22	Correct	95 ms	4968 KB	Output is correct
23	Correct	91 ms	4972 KB	Output is correct
24	Correct	98 ms	4912 KB	Output is correct
25	Correct	101 ms	4904 KB	Output is correct
26	Correct	109 ms	4940 KB	Output is correct
27	Correct	109 ms	4976 KB	Output is correct
28	Correct	107 ms	4920 KB	Output is correct
29	Correct	153 ms	4884 KB	Output is correct
30	Correct	95 ms	4976 KB	Output is correct
31	Correct	114 ms	4952 KB	Output is correct
32	Correct	122 ms	4968 KB	Output is correct
33	Correct	97 ms	4928 KB	Output is correct
34	Correct	95 ms	4984 KB	Output is correct
35	Correct	100 ms	4876 KB	Output is correct
36	Correct	114 ms	5048 KB	Output is correct
37	Correct	145 ms	4980 KB	Output is correct
38	Correct	108 ms	4952 KB	Output is correct
39	Correct	140 ms	4988 KB	Output is correct
40	Correct	163 ms	4984 KB	Output is correct
41	Correct	130 ms	4992 KB	Output is correct
42	Correct	121 ms	4940 KB	Output is correct
43	Correct	113 ms	5080 KB	Output is correct
44	Correct	122 ms	4932 KB	Output is correct
45	Correct	120 ms	4920 KB	Output is correct
46	Correct	117 ms	4940 KB	Output is correct
47	Correct	126 ms	4988 KB	Output is correct
48	Correct	104 ms	4940 KB	Output is correct
49	Correct	103 ms	4904 KB	Output is correct
50	Execution timed out	1085 ms	27464 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-

답안 #676286

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 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
0 / 52.0