Submission #2771405


Source Code Expand

/**
 * File    : D.cpp
 * Author  : Kazune Takahashi
 * Created : 2018-7-1 20:39:17
 * Powered by Visual Studio Code
 */

#include <iostream>
#include <iomanip>   // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set>
#include <random> // random_device rd; mt19937 mt(rd());
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
// start = std::chrono::system_clock::now();
// double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.

typedef long long ll;

// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

// const int C = 1e6+10;
const ll infty = 1000000000000007;

int N;
ll A[200010];
ll sum = 0;
ll imos[200010];

int index(ll sum)
{
  int lb = 0;
  int ub = N - 1;
  if (sum < imos[lb])
  {
    return lb;
  }
  while (ub - lb > 1)
  {
    int t = (ub + lb) / 2;
    if (sum < imos[t])
    {
      ub = t;
    }
    else
    {
      lb = t;
    }
  }
  return lb;
}

int main()
{
  cin >> N;
  for (auto i = 0; i < N; i++)
  {
    cin >> A[i];
    sum += A[i];
  }
  fill(imos, imos + 200010, 0);
  imos[0] = A[0];
  for (auto i = 1; i < N; i++)
  {
    imos[i] = imos[i - 1] + A[i];
  }
  ll ans = infty;
  for (auto s = 1; s < N - 2; s++)
  {
    ll PQ = imos[s];
    ll RS = sum - imos[s];
    int ind = index(PQ / 2);
    for (auto k = ind - 2; k <= ind + 2; k++)
    {
      if (0 <= k && k < s)
      {
        ll P = imos[k];
        ll Q = PQ - P;
        ll ind2 = index(PQ + RS / 2);
        for (auto t = ind2 - 2; t < ind2 + 2; t++)
        {
          if (s < t && t < N - 1)
          {
            // cerr << "k = " << k << ", s = " << s << ", t = " << t << endl;
            ll R = imos[t] - PQ;
            ll S = RS - R;
            ll maxi = max(max(P, Q), max(R, S));
            ll mini = min(min(P, Q), min(R, S));
            ans = min(ans, maxi - mini);
          }
        }
      }
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task D - Equal Cut
User kazunetakahashi
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2483 Byte
Status AC
Exec Time 180 ms
Memory 3328 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 43
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 2 ms 1792 KB
sample_02.txt AC 2 ms 1792 KB
sample_03.txt AC 2 ms 1792 KB
subtask_1_01.txt AC 2 ms 1792 KB
subtask_1_02.txt AC 174 ms 3200 KB
subtask_1_03.txt AC 71 ms 2432 KB
subtask_1_04.txt AC 118 ms 2816 KB
subtask_1_05.txt AC 2 ms 1792 KB
subtask_1_06.txt AC 14 ms 2048 KB
subtask_1_07.txt AC 95 ms 2688 KB
subtask_1_08.txt AC 40 ms 2432 KB
subtask_1_09.txt AC 92 ms 2688 KB
subtask_1_10.txt AC 94 ms 3072 KB
subtask_1_11.txt AC 151 ms 3200 KB
subtask_1_12.txt AC 47 ms 2560 KB
subtask_1_13.txt AC 100 ms 2688 KB
subtask_1_14.txt AC 28 ms 2176 KB
subtask_1_15.txt AC 19 ms 2048 KB
subtask_1_16.txt AC 47 ms 2560 KB
subtask_1_17.txt AC 63 ms 2560 KB
subtask_1_18.txt AC 4 ms 1792 KB
subtask_1_19.txt AC 132 ms 3200 KB
subtask_1_20.txt AC 180 ms 3200 KB
subtask_1_21.txt AC 80 ms 2560 KB
subtask_1_22.txt AC 57 ms 2304 KB
subtask_1_23.txt AC 136 ms 3072 KB
subtask_1_24.txt AC 108 ms 3328 KB
subtask_1_25.txt AC 111 ms 3328 KB
subtask_1_26.txt AC 112 ms 3328 KB
subtask_1_27.txt AC 122 ms 3328 KB
subtask_1_28.txt AC 144 ms 3328 KB
subtask_1_29.txt AC 162 ms 3328 KB
subtask_1_30.txt AC 161 ms 3328 KB
subtask_1_31.txt AC 163 ms 3328 KB
subtask_1_32.txt AC 163 ms 3328 KB
subtask_1_33.txt AC 162 ms 3328 KB
subtask_1_34.txt AC 93 ms 3328 KB
subtask_1_35.txt AC 148 ms 3328 KB
subtask_1_36.txt AC 90 ms 3328 KB
subtask_1_37.txt AC 144 ms 3328 KB