답안 #957146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957146	2024-04-03T05:13:56 Z	Requiem	Bigger segments (IZhO19_segments)	C++17	37 / 100	1500 ms	3420 KB

segments

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<=n;i++)
#define add(a,b) a=(a+b)%MOD
#define BIT(mask,i) ((mask >> i) & 1ll )
#define OFF(mask,i) (mask & (~(1ll << i))) 
#define ON(mask,i) (mask | (1ll << i))
#define xd '\n'
#define DAO(mask,i) (mask ^ (1ll << i))    
#define add(a,b) a=(a+b)%MOD
#define built(mask) __builtin_popcountll(mask)
#define all(x) x.begin(),x.end()
#define XD cout << '\n'
#define TASK "task"
//dqxzzz
using namespace std;
const int oo = 1e18;
const int maxn = 1e5+5;
const int MOD = 1e9+7;
int a[maxn];
pair<int,int> dp[maxn];
int f[maxn];
int n;

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen(TASK".inp","r",stdin);
//	freopen(TASK".out","w",stdout);
	cin >> n;
	f1(i,n) cin >> a[i];
	f1(i,n) f[i]=f[i-1]+a[i];
	dp[1] = {1,a[1]};
	f1(i,n)
	{
		f0(j,i-1)
		{
			if (f[i] - f[j] >= dp[j].se)
			{
				if (dp[j].fi + 1 > dp[i].fi)
				{
					dp[i].fi = dp[j].fi + 1;
					dp[i].se = f[i]-f[j];
				}
				else if (dp[j].fi + 1 == dp[i].fi && f[i]-f[j] < dp[i].se)
				{
					dp[i].fi = dp[j].fi + 1;
					dp[i].se = f[i]-f[j];
				}
			}
		}
	}
	cout << dp[n].fi;
	return 0;
}

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2424 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2424 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2392 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2392 KB	Output is correct
31	Correct	4 ms	2392 KB	Output is correct
32	Correct	5 ms	2648 KB	Output is correct
33	Correct	5 ms	2572 KB	Output is correct
34	Correct	5 ms	2396 KB	Output is correct
35	Correct	5 ms	2396 KB	Output is correct
36	Correct	6 ms	2396 KB	Output is correct
37	Correct	4 ms	2396 KB	Output is correct
38	Correct	3 ms	2396 KB	Output is correct
39	Correct	6 ms	2396 KB	Output is correct
40	Correct	6 ms	2592 KB	Output is correct
41	Correct	5 ms	2396 KB	Output is correct
42	Correct	5 ms	2572 KB	Output is correct
43	Correct	5 ms	2396 KB	Output is correct
44	Correct	5 ms	2572 KB	Output is correct
45	Correct	5 ms	2396 KB	Output is correct

Subtask #4
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2424 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2392 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2392 KB	Output is correct
31	Correct	4 ms	2392 KB	Output is correct
32	Correct	5 ms	2648 KB	Output is correct
33	Correct	5 ms	2572 KB	Output is correct
34	Correct	5 ms	2396 KB	Output is correct
35	Correct	5 ms	2396 KB	Output is correct
36	Correct	6 ms	2396 KB	Output is correct
37	Correct	4 ms	2396 KB	Output is correct
38	Correct	3 ms	2396 KB	Output is correct
39	Correct	6 ms	2396 KB	Output is correct
40	Correct	6 ms	2592 KB	Output is correct
41	Correct	5 ms	2396 KB	Output is correct
42	Correct	5 ms	2572 KB	Output is correct
43	Correct	5 ms	2396 KB	Output is correct
44	Correct	5 ms	2572 KB	Output is correct
45	Correct	5 ms	2396 KB	Output is correct
46	Execution timed out	1552 ms	3420 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2648 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2424 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2392 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2392 KB	Output is correct
31	Correct	4 ms	2392 KB	Output is correct
32	Correct	5 ms	2648 KB	Output is correct
33	Correct	5 ms	2572 KB	Output is correct
34	Correct	5 ms	2396 KB	Output is correct
35	Correct	5 ms	2396 KB	Output is correct
36	Correct	6 ms	2396 KB	Output is correct
37	Correct	4 ms	2396 KB	Output is correct
38	Correct	3 ms	2396 KB	Output is correct
39	Correct	6 ms	2396 KB	Output is correct
40	Correct	6 ms	2592 KB	Output is correct
41	Correct	5 ms	2396 KB	Output is correct
42	Correct	5 ms	2572 KB	Output is correct
43	Correct	5 ms	2396 KB	Output is correct
44	Correct	5 ms	2572 KB	Output is correct
45	Correct	5 ms	2396 KB	Output is correct
46	Execution timed out	1552 ms	3420 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

답안 #957146

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 36.0

Subtask #5 0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0