Submission #1436981


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long int64;

const int64 INF = 1LL << 58;

template< typename T >
struct SegmentTree
{
  const T INF;

  vector< T > seg;
  int sz;

  SegmentTree(int n) : INF(numeric_limits< T >::max())
  {
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz - 1, INF);
  }

  T merge(T a, T b)
  {
    return (min(a, b));
  }

  void set(int k, int x)
  {
    seg[k + sz - 1] = x;
  }

  void build()
  {
    for(int k = sz - 2; k >= 0; k--) {
      seg[k] = merge(seg[2 * k + 1], seg[2 * k + 2]);
    }
  }

  T rmq(int a, int b, int k, int l, int r)
  {
    if(a >= r || b <= l) return (INF);
    if(a <= l && r <= b) return (seg[k]);
    return (merge(rmq(a, b, 2 * k + 1, l, (l + r) >> 1),
                  rmq(a, b, 2 * k + 2, (l + r) >> 1, r)));
  }

  T rmq(int a, int b)
  {
    return (rmq(a, b, 0, 0, sz));
  }

  void update(int k, T x)
  {
    k += sz - 1;
    seg[k] = x;
    while(k > 0) {
      k = (k - 1) >> 1;
      seg[k] = merge(seg[2 * k + 1], seg[2 * k + 2]);
    }
  }
};


int main()
{
  int64 N, T, E, X[2002];

  cin >> N >> T >> E;
  for(int i = 1; i <= N; i++) cin >> X[i];

  /*
  int64 dp[2002][2002]; // curr, pending
  fill_n(*dp, 2002 * 2002, INF);
  dp[1][0] = 0;
  dp[1][1] = E;
*/
  auto chmin = [](int64 &a, int64 b)
  {
    a = min(a, b);
  };

  /*
  for(int i = 2; i <= N; i++) {
    for(int j = 0; j < i; j++) {
      chmin(dp[i][j], dp[i - 1][j]);
      chmin(dp[i][i], dp[i - 1][j] + max(E, (X[i] - X[j + 1]) * 2));
    }
  }
  // dp[j]+(X[i]-X[j+1])*2 = dp[j]+X[i]*2-X[j+1]*2
   // dp2[j]=dp[j]-X[j+1]*2
  */


  int64 dp[200002];
  fill_n(dp, 200002, INF);
  SegmentTree< int64 > dp2(N + 1);

  dp[0] = 0;
  dp[1] = E;
  dp2.update(0, dp[0] - X[1] * 2);
  dp2.update(1, dp[1] - X[2] * 2);

  for(int i = 2; i <= N; i++) {
    int low = 0, high = i - 1;
    while(high - low > 0) {
      int mid = (low + high) >> 1;
      if((X[i] - X[mid + 1]) * 2 <= E) high = mid;
      else low = mid + 1;
    }
/*
    cout << (X[i] - X[low + 1]) * 2 << " " << E << endl;

    for(int k = low; k < i; k++) cout << dp[k] << " ";
    cout << endl;
*/
    dp[i] = min(dp[low] + E, X[i] * 2 + dp2.rmq(0, low));
    //cout << low << endl;
    dp2.update(i, dp[i] - X[i + 1] * 2);
  }
  cout << dp[N] + T << endl;
}

Submission Info

Submission Time
Task D - Shik and Game
User ei13333
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2423 Byte
Status WA
Exec Time 66 ms
Memory 3968 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 600 0 / 600
Status
AC × 3
AC × 12
WA × 11
AC × 12
WA × 52
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask1 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt
Case Name Status Exec Time Memory
0_00.txt AC 2 ms 1792 KB
0_01.txt AC 2 ms 1792 KB
0_02.txt AC 2 ms 1792 KB
1_00.txt WA 3 ms 1792 KB
1_01.txt AC 2 ms 1792 KB
1_02.txt WA 3 ms 1792 KB
1_03.txt AC 3 ms 1792 KB
1_04.txt WA 2 ms 1792 KB
1_05.txt WA 2 ms 1792 KB
1_06.txt WA 2 ms 1792 KB
1_07.txt WA 2 ms 1792 KB
1_08.txt AC 3 ms 1792 KB
1_09.txt WA 2 ms 1792 KB
1_10.txt WA 3 ms 1792 KB
1_11.txt AC 2 ms 1792 KB
1_12.txt WA 2 ms 1792 KB
1_13.txt WA 3 ms 1792 KB
1_14.txt AC 2 ms 1792 KB
1_15.txt AC 2 ms 1792 KB
1_16.txt AC 2 ms 1792 KB
1_17.txt WA 3 ms 1792 KB
1_18.txt AC 2 ms 1792 KB
1_19.txt AC 3 ms 1792 KB
2_00.txt WA 51 ms 3840 KB
2_01.txt WA 55 ms 3840 KB
2_02.txt WA 57 ms 3840 KB
2_03.txt WA 55 ms 3840 KB
2_04.txt WA 50 ms 3840 KB
2_05.txt WA 56 ms 3840 KB
2_06.txt WA 56 ms 3968 KB
2_07.txt WA 50 ms 3840 KB
2_08.txt WA 50 ms 3840 KB
2_09.txt WA 55 ms 3840 KB
2_10.txt WA 60 ms 3840 KB
2_11.txt WA 61 ms 3840 KB
2_12.txt WA 60 ms 3840 KB
2_13.txt WA 58 ms 3840 KB
2_14.txt WA 64 ms 3840 KB
2_15.txt WA 61 ms 3840 KB
2_16.txt WA 63 ms 3840 KB
2_17.txt WA 57 ms 3840 KB
2_18.txt WA 56 ms 3840 KB
2_19.txt WA 56 ms 3840 KB
2_20.txt WA 58 ms 3840 KB
2_21.txt WA 60 ms 3840 KB
2_22.txt WA 59 ms 3840 KB
2_23.txt WA 59 ms 3840 KB
2_24.txt WA 59 ms 3840 KB
2_25.txt WA 59 ms 3840 KB
2_26.txt WA 61 ms 3840 KB
2_27.txt WA 59 ms 3840 KB
2_28.txt WA 59 ms 3840 KB
2_29.txt WA 59 ms 3840 KB
2_30.txt WA 65 ms 3840 KB
2_31.txt WA 59 ms 3840 KB
2_32.txt WA 59 ms 3840 KB
2_33.txt WA 64 ms 3840 KB
2_34.txt WA 59 ms 3840 KB
2_35.txt WA 66 ms 3840 KB
2_36.txt WA 63 ms 3840 KB
2_37.txt WA 65 ms 3840 KB
2_38.txt WA 65 ms 3840 KB
2_39.txt WA 65 ms 3840 KB
2_40.txt WA 65 ms 3840 KB