Submission #330246


Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cstdio>
#include <numeric>

using namespace std;

typedef long long ll;

const int kN = 100002;

int N;
ll L;

ll A[kN];
ll B[kN];
ll C[kN];

ll S[kN];
ll T[kN];

ll solve() {
  ll sum_b = accumulate(B, B+N, 0LL);

  if (N > 5000 || sum_b > 5000) {
    return -1LL;
  }

  ll ans = 1LL<<59;
  ll end_to_start = min(A[N-1], L - A[N-1]);

  for (ll init_move = sum_b; init_move >= -sum_b; --init_move) {
    vector<ll> tmp;
    for (int i = 0; i < N; i++) {
      tmp.push_back(B[i]);
    }

    tmp[N-1] -= init_move;
    tmp[0] += init_move;

    ll cost = abs(init_move) * end_to_start;
    for (int i = 0; i < N-1; i++) {
      ll delta = tmp[i] - C[i];
      tmp[i] -= delta;
      tmp[i+1] += delta;
      cost += abs(delta) * (A[i+1] - A[i]);
    }

    ans = min(ans, cost);
  }

  return ans;
}

int main() {
  while (cin>>N>>L) {
    for (int i = 0; i < N; i++) {
      cin >> A[i] >> B[i] >> C[i];
    }
    ll ans = solve();
    cout << ans << endl;
  }

  return 0;
}

Submission Info

Submission Time
Task D - タクシー
User brly
Language C++ (G++ 4.6.4)
Score 15
Code Size 1374 Byte
Status WA
Exec Time 472 ms
Memory 3244 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 15 / 15 0 / 30 0 / 55
Status
AC × 2
AC × 22
AC × 22
WA × 20
AC × 22
WA × 40
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt
Subtask3 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt, subtask3-11.txt, subtask3-12.txt, subtask3-13.txt, subtask3-14.txt, subtask3-15.txt, subtask3-16.txt, subtask3-17.txt, subtask3-18.txt, subtask3-19.txt, subtask3-20.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 23 ms 928 KB
subtask0-sample-02.txt AC 24 ms 924 KB
subtask1-01.txt AC 24 ms 932 KB
subtask1-02.txt AC 24 ms 924 KB
subtask1-03.txt AC 462 ms 924 KB
subtask1-04.txt AC 464 ms 928 KB
subtask1-05.txt AC 465 ms 1048 KB
subtask1-06.txt AC 31 ms 932 KB
subtask1-07.txt AC 466 ms 936 KB
subtask1-08.txt AC 465 ms 932 KB
subtask1-09.txt AC 465 ms 928 KB
subtask1-10.txt AC 472 ms 928 KB
subtask1-11.txt AC 247 ms 924 KB
subtask1-12.txt AC 464 ms 928 KB
subtask1-13.txt AC 468 ms 932 KB
subtask1-14.txt AC 462 ms 924 KB
subtask1-15.txt AC 461 ms 940 KB
subtask1-16.txt AC 459 ms 920 KB
subtask1-17.txt AC 460 ms 920 KB
subtask1-18.txt AC 458 ms 924 KB
subtask1-19.txt AC 462 ms 988 KB
subtask1-20.txt AC 461 ms 932 KB
subtask2-01.txt WA 35 ms 796 KB
subtask2-02.txt WA 35 ms 796 KB
subtask2-03.txt WA 32 ms 924 KB
subtask2-04.txt WA 35 ms 876 KB
subtask2-05.txt WA 30 ms 1052 KB
subtask2-06.txt WA 31 ms 928 KB
subtask2-07.txt WA 35 ms 872 KB
subtask2-08.txt WA 34 ms 932 KB
subtask2-09.txt WA 33 ms 924 KB
subtask2-10.txt WA 32 ms 924 KB
subtask2-11.txt WA 33 ms 928 KB
subtask2-12.txt WA 32 ms 932 KB
subtask2-13.txt WA 32 ms 928 KB
subtask2-14.txt WA 31 ms 932 KB
subtask2-15.txt WA 33 ms 860 KB
subtask2-16.txt WA 32 ms 928 KB
subtask2-17.txt WA 33 ms 932 KB
subtask2-18.txt WA 30 ms 932 KB
subtask2-19.txt WA 34 ms 924 KB
subtask2-20.txt WA 32 ms 928 KB
subtask3-01.txt WA 58 ms 1192 KB
subtask3-02.txt WA 108 ms 1960 KB
subtask3-03.txt WA 192 ms 3112 KB
subtask3-04.txt WA 158 ms 3112 KB
subtask3-05.txt WA 217 ms 3112 KB
subtask3-06.txt WA 197 ms 3116 KB
subtask3-07.txt WA 195 ms 3108 KB
subtask3-08.txt WA 204 ms 3104 KB
subtask3-09.txt WA 151 ms 3104 KB
subtask3-10.txt WA 191 ms 3108 KB
subtask3-11.txt WA 147 ms 3112 KB
subtask3-12.txt WA 191 ms 3108 KB
subtask3-13.txt WA 188 ms 3112 KB
subtask3-14.txt WA 193 ms 3104 KB
subtask3-15.txt WA 191 ms 3112 KB
subtask3-16.txt WA 192 ms 3104 KB
subtask3-17.txt WA 194 ms 3244 KB
subtask3-18.txt WA 178 ms 3104 KB
subtask3-19.txt WA 187 ms 3108 KB
subtask3-20.txt WA 193 ms 3112 KB