結果

問題 No.1012 荷物収集
ユーザー maimai
提出日時 2020-03-20 23:19:25
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 6,005 bytes
コンパイル時間 2,730 ms
コンパイル使用メモリ 217,372 KB
実行使用メモリ 8,296 KB
最終ジャッジ日時 2023-08-21 23:35:28
合計ジャッジ時間 7,625 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,456 KB
testcase_01 AC 2 ms
5,412 KB
testcase_02 AC 2 ms
5,412 KB
testcase_03 AC 2 ms
5,644 KB
testcase_04 AC 22 ms
8,040 KB
testcase_05 AC 22 ms
8,248 KB
testcase_06 AC 22 ms
8,172 KB
testcase_07 AC 21 ms
8,156 KB
testcase_08 AC 22 ms
8,112 KB
testcase_09 AC 21 ms
8,296 KB
testcase_10 AC 21 ms
8,044 KB
testcase_11 AC 21 ms
8,100 KB
testcase_12 AC 21 ms
8,096 KB
testcase_13 AC 22 ms
8,092 KB
testcase_14 AC 2 ms
5,480 KB
testcase_15 AC 2 ms
5,420 KB
testcase_16 AC 2 ms
5,464 KB
testcase_17 AC 2 ms
5,612 KB
testcase_18 AC 2 ms
5,412 KB
testcase_19 AC 2 ms
5,408 KB
testcase_20 AC 2 ms
5,424 KB
testcase_21 AC 2 ms
5,428 KB
testcase_22 AC 2 ms
5,420 KB
testcase_23 AC 2 ms
5,484 KB
testcase_24 AC 29 ms
7,008 KB
testcase_25 AC 38 ms
7,612 KB
testcase_26 AC 19 ms
7,420 KB
testcase_27 AC 5 ms
6,076 KB
testcase_28 AC 37 ms
7,812 KB
testcase_29 AC 18 ms
7,984 KB
testcase_30 AC 38 ms
8,092 KB
testcase_31 AC 15 ms
5,564 KB
testcase_32 AC 14 ms
6,140 KB
testcase_33 AC 21 ms
6,028 KB
testcase_34 AC 22 ms
5,856 KB
testcase_35 AC 32 ms
7,708 KB
testcase_36 AC 19 ms
5,668 KB
testcase_37 AC 17 ms
7,864 KB
testcase_38 AC 32 ms
7,104 KB
testcase_39 AC 14 ms
6,584 KB
testcase_40 AC 17 ms
6,652 KB
testcase_41 AC 44 ms
7,996 KB
testcase_42 AC 20 ms
6,644 KB
testcase_43 AC 27 ms
7,296 KB
testcase_44 AC 2 ms
5,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=remove_reference<decltype(l)>::type();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
  os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
  FILE* fp_;
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
  inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
  inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);



//

int N, Q;
constexpr int R = 1e9;

array<int, 2> XW[100010];
int ___ = 0;
int X[100010];
int W[100010];

array<ll, 2> leftsum[100010]; // XW, W
array<ll, 2> rightsum[100010]; // XW, W

//

int main() {
  
  scanner >> N >> Q;
  repeat(i, N) {
    int x, w; scanner >> x >> w;
    XW[i] = {x, w};
  }
  sort(XW, XW+N);
  repeat(i, N) {
    X[i] = XW[i][0];
    W[i] = XW[i][1];
  }
  
  {
    ll x = X[0];
    repeat(i, N) {
      leftsum[i+1][0] = leftsum[i][0] + leftsum[i][1]*(X[i]-x);
      leftsum[i+1][1] = leftsum[i][1] + W[i];
      x = X[i];
    }
  }
  {
    ll x = X[N-1];
    rrepeat(i, N) {
      rightsum[i][0] = rightsum[i+1][0] + rightsum[i+1][1]*(x-X[i]);
      rightsum[i][1] = rightsum[i+1][1] + W[i];
      x = X[i];
    }
  }
  
  repeat(q, Q) {
    ll y; scanner >> y;
    auto it = lower_bound(X, X+N, (int)y);
    int p = it - X;
    --p;
    ll total = 0;
    if (p >= 0) {
      ll x = X[p];
      total += leftsum[p+1][0] + leftsum[p+1][1]*(y-x);
    }
    if (p < N-1) {
      ll x = X[p+1];
      total += rightsum[p+1][0] + rightsum[p+1][1]*(x-y);
    }
    printer << total << '\n';
  }
  
  return 0;
}
0