답안 #334151

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

segments

#include "bits/stdc++.h"
#define MAXN 500009
#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;}
int dp[MAXN],arr[MAXN],n,ok;
ll par[MAXN];
bool vis[MAXN];
int get(int i){
	return lower_bound(par+i+1,par+n+1,2*par[i]-par[dp[i]])-par;
}	
int main(){
 //   freopen("file.in", "r", stdin);
    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++){
    	ok=0;
    	for(int i=n;i>=j-1;i--)
    		if(vis[i]){
				for(int k=get(i);k<=n;k++)
					if(!vis[k])
						dp[k]=i,ok=1,vis[k]=1;
				vis[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:37:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   37 |      for(int i=n;i>=j-1;i--)
      |      ^~~
segments.cpp:44:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   44 |   if(!ok){
      |   ^~
segments.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:30:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 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	384 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 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	512 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	384 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Correct	24 ms	364 KB	Output is correct
20	Correct	34 ms	364 KB	Output is correct
21	Correct	4 ms	364 KB	Output is correct
22	Correct	3 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	5 ms	364 KB	Output is correct
25	Correct	4 ms	364 KB	Output is correct
26	Correct	38 ms	400 KB	Output is correct
27	Correct	8 ms	364 KB	Output is correct
28	Correct	8 ms	364 KB	Output is correct
29	Correct	36 ms	492 KB	Output is correct
30	Correct	32 ms	364 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 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	384 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Correct	24 ms	364 KB	Output is correct
20	Correct	34 ms	364 KB	Output is correct
21	Correct	4 ms	364 KB	Output is correct
22	Correct	3 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	5 ms	364 KB	Output is correct
25	Correct	4 ms	364 KB	Output is correct
26	Correct	38 ms	400 KB	Output is correct
27	Correct	8 ms	364 KB	Output is correct
28	Correct	8 ms	364 KB	Output is correct
29	Correct	36 ms	492 KB	Output is correct
30	Correct	32 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	13 ms	364 KB	Output is correct
33	Correct	441 ms	364 KB	Output is correct
34	Execution timed out	1598 ms	364 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

Subtask #4
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 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	384 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Correct	24 ms	364 KB	Output is correct
20	Correct	34 ms	364 KB	Output is correct
21	Correct	4 ms	364 KB	Output is correct
22	Correct	3 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	5 ms	364 KB	Output is correct
25	Correct	4 ms	364 KB	Output is correct
26	Correct	38 ms	400 KB	Output is correct
27	Correct	8 ms	364 KB	Output is correct
28	Correct	8 ms	364 KB	Output is correct
29	Correct	36 ms	492 KB	Output is correct
30	Correct	32 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	13 ms	364 KB	Output is correct
33	Correct	441 ms	364 KB	Output is correct
34	Execution timed out	1598 ms	364 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 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	384 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Correct	24 ms	364 KB	Output is correct
20	Correct	34 ms	364 KB	Output is correct
21	Correct	4 ms	364 KB	Output is correct
22	Correct	3 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	5 ms	364 KB	Output is correct
25	Correct	4 ms	364 KB	Output is correct
26	Correct	38 ms	400 KB	Output is correct
27	Correct	8 ms	364 KB	Output is correct
28	Correct	8 ms	364 KB	Output is correct
29	Correct	36 ms	492 KB	Output is correct
30	Correct	32 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	13 ms	364 KB	Output is correct
33	Correct	441 ms	364 KB	Output is correct
34	Execution timed out	1598 ms	364 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

답안 #334151

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