Submission #5947484
Source Code Expand
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<complex> #include<bitset> #include<stack> #include<unordered_map> #include<utility> using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; typedef long double ld; const ll INF = 1e+14; typedef pair<int, int> P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef complex<ld> Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair<ld, ld> LDP; typedef pair<ll, ll> LP; #define fr first #define sc second #define all(c) c.begin(),c.end() #define pb push_back void Yes(){ cout<<"Yes"<<endl; exit(0); } void No(){ cout<<"No"<<endl; exit(0); } int main() { ios::sync_with_stdio(false); cin.tie(0); int N; cin >> N; ll A[200200], B[200200]; B[0] = 0; rep(i, N) { cin >> A[i]; B[i + 1] = B[i] + A[i] * 2; } ll ans = INF; Rep(i, 2, N - 2) { ll X = B[i], Y = B[N] - B[i]; ll P, Q; ll P1 = *(upper_bound(B, B + N, X / 2) - 1); ll P2 = *(upper_bound(B, B + N, X / 2)); ll Q1 = X - P1, Q2 = X - P2; if(abs(P1 - Q1) > abs(P2 - Q2)) {P = P2; Q = Q2;} else {P = P1; Q = Q1;} ll R, S; ll R1 = *(upper_bound(B, B + N, X + Y / 2) - 1) - X; ll R2 = *(upper_bound(B, B + N, X + Y / 2)) - X; ll S1 = Y - R1, S2 = Y - R2; if(abs(R1 - R1) > abs(R2 - R2)) {R = R2; S = S2;} else {R = R1; S = S1;} P /= 2; Q /= 2; R /= 2; S /= 2; ll Z[4]; Z[0] = P; Z[1] = Q; Z[2] = R; Z[3] = S; sort(Z, Z + 4); ll res = Z[3] - Z[0]; ans = min(ans, res); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Equal Cut |
User | otera |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2163 Byte |
Status | WA |
Exec Time | 51 ms |
Memory | 3456 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 2 ms | 2304 KB |
sample_02.txt | AC | 2 ms | 2304 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | WA | 1 ms | 256 KB |
subtask_1_02.txt | WA | 50 ms | 3072 KB |
subtask_1_03.txt | WA | 19 ms | 1536 KB |
subtask_1_04.txt | AC | 35 ms | 2176 KB |
subtask_1_05.txt | WA | 2 ms | 2304 KB |
subtask_1_06.txt | WA | 6 ms | 2560 KB |
subtask_1_07.txt | AC | 30 ms | 2048 KB |
subtask_1_08.txt | AC | 14 ms | 2816 KB |
subtask_1_09.txt | AC | 28 ms | 2688 KB |
subtask_1_10.txt | AC | 30 ms | 2688 KB |
subtask_1_11.txt | AC | 43 ms | 3200 KB |
subtask_1_12.txt | WA | 17 ms | 1664 KB |
subtask_1_13.txt | AC | 29 ms | 2176 KB |
subtask_1_14.txt | WA | 8 ms | 2560 KB |
subtask_1_15.txt | AC | 6 ms | 640 KB |
subtask_1_16.txt | AC | 20 ms | 3072 KB |
subtask_1_17.txt | AC | 18 ms | 1664 KB |
subtask_1_18.txt | AC | 2 ms | 2304 KB |
subtask_1_19.txt | WA | 37 ms | 3200 KB |
subtask_1_20.txt | WA | 51 ms | 3200 KB |
subtask_1_21.txt | AC | 21 ms | 1792 KB |
subtask_1_22.txt | WA | 18 ms | 2816 KB |
subtask_1_23.txt | AC | 35 ms | 3072 KB |
subtask_1_24.txt | WA | 41 ms | 3456 KB |
subtask_1_25.txt | AC | 41 ms | 3328 KB |
subtask_1_26.txt | WA | 40 ms | 3328 KB |
subtask_1_27.txt | AC | 38 ms | 3328 KB |
subtask_1_28.txt | AC | 38 ms | 3328 KB |
subtask_1_29.txt | WA | 43 ms | 3328 KB |
subtask_1_30.txt | AC | 43 ms | 3328 KB |
subtask_1_31.txt | AC | 43 ms | 3328 KB |
subtask_1_32.txt | AC | 41 ms | 3328 KB |
subtask_1_33.txt | WA | 41 ms | 3328 KB |
subtask_1_34.txt | WA | 38 ms | 3328 KB |
subtask_1_35.txt | WA | 40 ms | 3456 KB |
subtask_1_36.txt | AC | 34 ms | 3328 KB |
subtask_1_37.txt | AC | 37 ms | 3456 KB |