Submission #2875006
Source Code Expand
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200000
int main(){
long long a[N + 1];
int n;
int x, y, z;
long long p, q, r, s;
long long mi, ma, ans;
scanf("%d", &n);
a[0] = 0;
for (int i = 0; i < n; i++){
scanf("%d", &p);
a[i + 1] = a[i] + p;
}
x = 1;
z = 3;
ans = 10000000000000000;
for (y = 2; y < n - 1; y++){
for (; x < y - 1; x++){
if (a[y] + a[0] < (2 * a[x]))break;
}
for (; z < n - 1; z++){
if (a[y] + a[n] < (2 * a[z]))break;
}
if (1<x && (y + 1)<z){
p = a[x - 1] - a[0];
q = a[y] - a[x - 1];
r = a[z - 1] - a[y];
s = a[n] - a[z - 1];
mi = min(min(p, q), min(r, s));
ma = max(max(p, q), max(r, s));
ans = min(ans, ma - mi);
}
if ((y + 1)<z){
p = a[x] - a[0];
q = a[y] - a[x];
r = a[z - 1] - a[y];
s = a[n] - a[z - 1];
mi = min(min(p, q), min(r, s));
ma = max(max(p, q), max(r, s));
ans = min(ans, ma - mi);
}
if (1<x){
p = a[x - 1] - a[0];
q = a[y] - a[x - 1];
r = a[z] - a[y];
s = a[n] - a[z];
mi = min(min(p, q), min(r, s));
ma = max(max(p, q), max(r, s));
ans = min(ans, ma - mi);
}
p = a[x] - a[0];
q = a[y] - a[x];
r = a[z] - a[y];
s = a[n] - a[z];
mi = min(min(p, q), min(r, s));
ma = max(max(p, q), max(r, s));
ans = min(ans, ma - mi);
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Submission Time
2018-07-21 17:25:43+0900
Task
D - Equal Cut
User
ptrs
Language
C++14 (GCC 5.4.1)
Score
600
Code Size
1625 Byte
Status
AC
Exec Time
26 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:26:17: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
scanf("%d", &p);
^
./Main.cpp:23:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:26:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &p);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
600 / 600
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt, sample_03.txt
All
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
128 KB
sample_02.txt
AC
1 ms
128 KB
sample_03.txt
AC
0 ms
128 KB
subtask_1_01.txt
AC
0 ms
128 KB
subtask_1_02.txt
AC
25 ms
1536 KB
subtask_1_03.txt
AC
10 ms
896 KB
subtask_1_04.txt
AC
18 ms
1152 KB
subtask_1_05.txt
AC
1 ms
128 KB
subtask_1_06.txt
AC
3 ms
384 KB
subtask_1_07.txt
AC
14 ms
1024 KB
subtask_1_08.txt
AC
8 ms
768 KB
subtask_1_09.txt
AC
13 ms
1024 KB
subtask_1_10.txt
AC
17 ms
1408 KB
subtask_1_11.txt
AC
21 ms
1536 KB
subtask_1_12.txt
AC
9 ms
896 KB
subtask_1_13.txt
AC
14 ms
1152 KB
subtask_1_14.txt
AC
5 ms
512 KB
subtask_1_15.txt
AC
3 ms
384 KB
subtask_1_16.txt
AC
10 ms
1024 KB
subtask_1_17.txt
AC
9 ms
896 KB
subtask_1_18.txt
AC
1 ms
256 KB
subtask_1_19.txt
AC
18 ms
1664 KB
subtask_1_20.txt
AC
26 ms
1664 KB
subtask_1_21.txt
AC
12 ms
896 KB
subtask_1_22.txt
AC
9 ms
640 KB
subtask_1_23.txt
AC
19 ms
1408 KB
subtask_1_24.txt
AC
21 ms
1664 KB
subtask_1_25.txt
AC
21 ms
1792 KB
subtask_1_26.txt
AC
21 ms
1664 KB
subtask_1_27.txt
AC
21 ms
1664 KB
subtask_1_28.txt
AC
21 ms
1664 KB
subtask_1_29.txt
AC
22 ms
1664 KB
subtask_1_30.txt
AC
22 ms
1664 KB
subtask_1_31.txt
AC
22 ms
1664 KB
subtask_1_32.txt
AC
22 ms
1664 KB
subtask_1_33.txt
AC
22 ms
1664 KB
subtask_1_34.txt
AC
18 ms
1664 KB
subtask_1_35.txt
AC
20 ms
1664 KB
subtask_1_36.txt
AC
17 ms
1664 KB
subtask_1_37.txt
AC
19 ms
1664 KB