답안 #334130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334130	2020-12-08T11:49:45 Z	Kerim	Bigger segments (IZhO19_segments)	C++17	27 / 100	1500 ms	12900 KB

segments

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=3004;
int dp[N][N],arr[MAXN];
ll par[MAXN];
bool vis[MAXN],ovis[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n,ok;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d",arr+i);
    	par[i]=par[i-1]+arr[i];
    }
    for(int i=1;i<=n;i++)
    	vis[i]=1;
    for(int j=2;j<=n;j++){
    	for(int i=j-1;i<=n;i++)
			for(int k=i+1;k<=n;k++)
				if(vis[i] and par[k]-par[i]>=par[i]-par[dp[i][j-1]])
					dp[k][j]=i,ovis[k]=1;
		ok=0;
		for(int i=j;i<=n;i++)
			vis[i]=ovis[i],ok|=vis[i],ovis[i]=0;
		if(!ok){
			printf("%d\n",j-1);	
			return 0;
		}
    }printf("%d\n",n);
	return 0;
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:29:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	3 ms	2156 KB	Output is correct
18	Correct	16 ms	2432 KB	Output is correct
19	Correct	37 ms	2796 KB	Output is correct
20	Correct	42 ms	2796 KB	Output is correct
21	Correct	8 ms	2412 KB	Output is correct
22	Correct	6 ms	2028 KB	Output is correct
23	Correct	3 ms	1516 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	9 ms	2412 KB	Output is correct
26	Correct	45 ms	2924 KB	Output is correct
27	Correct	26 ms	2540 KB	Output is correct
28	Correct	19 ms	2412 KB	Output is correct
29	Correct	47 ms	2924 KB	Output is correct
30	Correct	43 ms	2796 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	3 ms	2156 KB	Output is correct
18	Correct	16 ms	2432 KB	Output is correct
19	Correct	37 ms	2796 KB	Output is correct
20	Correct	42 ms	2796 KB	Output is correct
21	Correct	8 ms	2412 KB	Output is correct
22	Correct	6 ms	2028 KB	Output is correct
23	Correct	3 ms	1516 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	9 ms	2412 KB	Output is correct
26	Correct	45 ms	2924 KB	Output is correct
27	Correct	26 ms	2540 KB	Output is correct
28	Correct	19 ms	2412 KB	Output is correct
29	Correct	47 ms	2924 KB	Output is correct
30	Correct	43 ms	2796 KB	Output is correct
31	Correct	11 ms	492 KB	Output is correct
32	Correct	107 ms	11372 KB	Output is correct
33	Execution timed out	1567 ms	12900 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #4
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	3 ms	2156 KB	Output is correct
18	Correct	16 ms	2432 KB	Output is correct
19	Correct	37 ms	2796 KB	Output is correct
20	Correct	42 ms	2796 KB	Output is correct
21	Correct	8 ms	2412 KB	Output is correct
22	Correct	6 ms	2028 KB	Output is correct
23	Correct	3 ms	1516 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	9 ms	2412 KB	Output is correct
26	Correct	45 ms	2924 KB	Output is correct
27	Correct	26 ms	2540 KB	Output is correct
28	Correct	19 ms	2412 KB	Output is correct
29	Correct	47 ms	2924 KB	Output is correct
30	Correct	43 ms	2796 KB	Output is correct
31	Correct	11 ms	492 KB	Output is correct
32	Correct	107 ms	11372 KB	Output is correct
33	Execution timed out	1567 ms	12900 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	3 ms	2156 KB	Output is correct
18	Correct	16 ms	2432 KB	Output is correct
19	Correct	37 ms	2796 KB	Output is correct
20	Correct	42 ms	2796 KB	Output is correct
21	Correct	8 ms	2412 KB	Output is correct
22	Correct	6 ms	2028 KB	Output is correct
23	Correct	3 ms	1516 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	9 ms	2412 KB	Output is correct
26	Correct	45 ms	2924 KB	Output is correct
27	Correct	26 ms	2540 KB	Output is correct
28	Correct	19 ms	2412 KB	Output is correct
29	Correct	47 ms	2924 KB	Output is correct
30	Correct	43 ms	2796 KB	Output is correct
31	Correct	11 ms	492 KB	Output is correct
32	Correct	107 ms	11372 KB	Output is correct
33	Execution timed out	1567 ms	12900 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

답안 #334130

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 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
0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0