Submission #2075780


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF (1LL<<40)
#define MOD 1000000007

int N, L;
int A[100001], B[100000], C[100000];
long long f(long long cur) {
  long long sum = 0;
  rep(i, N) {
    if (B[i]) cur += B[i];
    else cur -= C[i];
    sum += 1LL*(A[i+1]-A[i])*abs(cur);
  }
  return sum;
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> L;
  A[N] = L;
  rep(i, N) {
    cin >> A[i] >> B[i] >> C[i];
    int m = min(B[i], C[i]);
    B[i] -= m;
    C[i] -= m;
  }
  long long lo = -INF, hi = INF;
  while (hi - lo >= 3) {
    long long a = (lo+lo+hi) / 3;
    long long b = (lo+hi+hi) / 3;
    if (f(a) <= f(b)) hi = b;
    else lo = a;
  }
  long long m = INF;
  for (long long x=lo; x<=hi; x++) m = min(m, f(x));
  cout << m << "\n";
  //for (int x=-10; x<=10; x++) cout <<"F("<<x<<")="<< f(x) << "\n";
  return 0;
}

Submission Info

Submission Time
Task D - タクシー
User funcsr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1416 Byte
Status WA
Exec Time 94 ms
Memory 1408 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 15 0 / 30 0 / 55
Status
AC × 2
AC × 21
WA × 1
AC × 27
WA × 15
AC × 29
WA × 33
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 1 ms 256 KB
subtask0-sample-02.txt AC 1 ms 256 KB
subtask1-01.txt WA 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 5 ms 384 KB
subtask1-04.txt AC 5 ms 384 KB
subtask1-05.txt AC 5 ms 384 KB
subtask1-06.txt AC 3 ms 384 KB
subtask1-07.txt AC 5 ms 384 KB
subtask1-08.txt AC 5 ms 384 KB
subtask1-09.txt AC 5 ms 384 KB
subtask1-10.txt AC 5 ms 384 KB
subtask1-11.txt AC 5 ms 384 KB
subtask1-12.txt AC 5 ms 384 KB
subtask1-13.txt AC 5 ms 384 KB
subtask1-14.txt AC 5 ms 384 KB
subtask1-15.txt AC 5 ms 384 KB
subtask1-16.txt AC 5 ms 384 KB
subtask1-17.txt AC 5 ms 384 KB
subtask1-18.txt AC 5 ms 384 KB
subtask1-19.txt AC 5 ms 384 KB
subtask1-20.txt AC 5 ms 384 KB
subtask2-01.txt WA 6 ms 384 KB
subtask2-02.txt WA 5 ms 384 KB
subtask2-03.txt AC 4 ms 384 KB
subtask2-04.txt WA 6 ms 384 KB
subtask2-05.txt AC 5 ms 384 KB
subtask2-06.txt WA 4 ms 384 KB
subtask2-07.txt WA 5 ms 384 KB
subtask2-08.txt WA 6 ms 384 KB
subtask2-09.txt WA 6 ms 384 KB
subtask2-10.txt AC 6 ms 384 KB
subtask2-11.txt WA 6 ms 384 KB
subtask2-12.txt WA 6 ms 384 KB
subtask2-13.txt AC 5 ms 384 KB
subtask2-14.txt AC 5 ms 384 KB
subtask2-15.txt WA 6 ms 384 KB
subtask2-16.txt WA 6 ms 384 KB
subtask2-17.txt WA 5 ms 384 KB
subtask2-18.txt AC 5 ms 384 KB
subtask2-19.txt WA 6 ms 384 KB
subtask2-20.txt WA 6 ms 384 KB
subtask3-01.txt WA 20 ms 512 KB
subtask3-02.txt WA 47 ms 896 KB
subtask3-03.txt WA 94 ms 1408 KB
subtask3-04.txt WA 65 ms 1408 KB
subtask3-05.txt WA 94 ms 1408 KB
subtask3-06.txt WA 94 ms 1408 KB
subtask3-07.txt WA 94 ms 1408 KB
subtask3-08.txt WA 94 ms 1408 KB
subtask3-09.txt AC 81 ms 1408 KB
subtask3-10.txt WA 92 ms 1408 KB
subtask3-11.txt AC 47 ms 1408 KB
subtask3-12.txt WA 94 ms 1408 KB
subtask3-13.txt WA 94 ms 1408 KB
subtask3-14.txt WA 93 ms 1408 KB
subtask3-15.txt WA 94 ms 1408 KB
subtask3-16.txt WA 93 ms 1408 KB
subtask3-17.txt WA 94 ms 1408 KB
subtask3-18.txt WA 91 ms 1408 KB
subtask3-19.txt WA 94 ms 1408 KB
subtask3-20.txt WA 94 ms 1408 KB