Submission #2875660
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long long int LL;
#define st first
#define nd second
#define pb push_back
#define PLL pair <LL, LL>
#define PII pair <int, int>
const int N = 1e6 + 7;
const int MX = 1e9 + 7;
const LL INF = 1e18 + 9LL;
int n;
LL pref[N];
void check(LL &res, int i, int j, int k){
LL s1 = pref[i], s2 = pref[j] - pref[i];
LL s3 = pref[k] - pref[j], s4 = pref[n] - pref[k];
LL mn = min(min(s1, s2), min(s3, s4));
LL mx = max(max(s1, s2), max(s3, s4));
res = min(res, mx - mn);
}
int ask(int p, int k){
int from = p - 1, to = k;
while(from < to){
int m = (from + to + 1) >> 1;
if(pref[m] - pref[p - 1] <= pref[k] - pref[m])
from = m;
else
to = m - 1;
}
return from;
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
scanf("%d", &pref[i]),
pref[i] += pref[i - 1];
LL res = INF;
for(int i = 2; i + 2 <= n; ++i){
int p1 = ask(1, i);
int p2 = ask(i + 1, n);
check(res, p1, i, p2);
check(res, p1 + 1, i, p2);
check(res, p1, i, p2 + 1);
check(res, p1 + 1, i, p2 + 1);
}
printf("%lld\n", res);
return 0;
}
Submission Info
Submission Time
2018-07-21 20:09:12+0900
Task
D - Equal Cut
User
Anadi
Language
C++14 (GCC 5.4.1)
Score
600
Code Size
1183 Byte
Status
AC
Exec Time
42 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:46:23: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘LL* {aka long long int*}’ [-Wformat=]
scanf("%d", &pref[i]),
^
./Main.cpp:44:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:47:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
pref[i] += pref[i - 1];
^
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
256 KB
sample_02.txt
AC
1 ms
256 KB
sample_03.txt
AC
1 ms
256 KB
subtask_1_01.txt
AC
1 ms
256 KB
subtask_1_02.txt
AC
39 ms
1664 KB
subtask_1_03.txt
AC
20 ms
896 KB
subtask_1_04.txt
AC
27 ms
1280 KB
subtask_1_05.txt
AC
1 ms
256 KB
subtask_1_06.txt
AC
5 ms
384 KB
subtask_1_07.txt
AC
23 ms
1152 KB
subtask_1_08.txt
AC
13 ms
768 KB
subtask_1_09.txt
AC
22 ms
1152 KB
subtask_1_10.txt
AC
27 ms
1408 KB
subtask_1_11.txt
AC
36 ms
1664 KB
subtask_1_12.txt
AC
16 ms
896 KB
subtask_1_13.txt
AC
25 ms
1152 KB
subtask_1_14.txt
AC
7 ms
512 KB
subtask_1_15.txt
AC
6 ms
384 KB
subtask_1_16.txt
AC
18 ms
1024 KB
subtask_1_17.txt
AC
17 ms
896 KB
subtask_1_18.txt
AC
2 ms
256 KB
subtask_1_19.txt
AC
36 ms
1664 KB
subtask_1_20.txt
AC
40 ms
1664 KB
subtask_1_21.txt
AC
22 ms
1024 KB
subtask_1_22.txt
AC
14 ms
768 KB
subtask_1_23.txt
AC
36 ms
1536 KB
subtask_1_24.txt
AC
37 ms
1792 KB
subtask_1_25.txt
AC
37 ms
1792 KB
subtask_1_26.txt
AC
37 ms
1792 KB
subtask_1_27.txt
AC
35 ms
1792 KB
subtask_1_28.txt
AC
35 ms
1792 KB
subtask_1_29.txt
AC
39 ms
1792 KB
subtask_1_30.txt
AC
42 ms
1792 KB
subtask_1_31.txt
AC
40 ms
1792 KB
subtask_1_32.txt
AC
41 ms
1792 KB
subtask_1_33.txt
AC
42 ms
1792 KB
subtask_1_34.txt
AC
34 ms
1792 KB
subtask_1_35.txt
AC
39 ms
1792 KB
subtask_1_36.txt
AC
32 ms
1792 KB
subtask_1_37.txt
AC
39 ms
1792 KB