結果

問題 No.1012 荷物収集
ユーザー iiljjiiljj
提出日時 2020-03-21 12:12:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 7,013 bytes
コンパイル時間 2,348 ms
コンパイル使用メモリ 209,788 KB
実行使用メモリ 7,168 KB
最終ジャッジ日時 2024-06-01 08:31:22
合計ジャッジ時間 7,890 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 43 ms
7,040 KB
testcase_05 AC 43 ms
7,040 KB
testcase_06 AC 43 ms
7,168 KB
testcase_07 AC 43 ms
7,040 KB
testcase_08 AC 43 ms
7,168 KB
testcase_09 AC 43 ms
7,168 KB
testcase_10 AC 43 ms
7,168 KB
testcase_11 AC 43 ms
7,168 KB
testcase_12 AC 43 ms
7,168 KB
testcase_13 AC 43 ms
7,168 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 3 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 43 ms
5,376 KB
testcase_25 AC 56 ms
6,272 KB
testcase_26 AC 29 ms
5,760 KB
testcase_27 AC 8 ms
5,376 KB
testcase_28 AC 54 ms
6,656 KB
testcase_29 AC 31 ms
6,272 KB
testcase_30 AC 54 ms
6,912 KB
testcase_31 AC 20 ms
5,376 KB
testcase_32 AC 19 ms
5,376 KB
testcase_33 AC 28 ms
5,376 KB
testcase_34 AC 30 ms
5,376 KB
testcase_35 AC 46 ms
6,144 KB
testcase_36 AC 27 ms
5,376 KB
testcase_37 AC 29 ms
6,016 KB
testcase_38 AC 44 ms
5,504 KB
testcase_39 AC 20 ms
5,376 KB
testcase_40 AC 24 ms
5,376 KB
testcase_41 AC 62 ms
6,944 KB
testcase_42 AC 29 ms
5,376 KB
testcase_43 AC 40 ms
5,760 KB
testcase_44 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U>
using um = unordered_map<T, U>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqa = priority_queue<T, vc<T>, greater<T>>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)   \
    sort(ALL(c)); \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

// vector 入力
template <typename T>
istream &operator>>(istream &is, vc<T> &vec)
{
    for (T &x : vec)
        is >> x;
    return is;
}

// vector 出力 (for dump)
template <typename T>
ostream &operator<<(ostream &os, vc<T> &vec)
{
    ll len = SIZE(vec);
    os << "{";
    for (int i = 0; i < len; i++)
        os << vec[i] << (i == len - 1 ? "" : ", ");
    os << "}";
    return os;
}

// vector 出力 (inline)
template <typename T>
ostream &operator>>(ostream &os, vc<T> &vec)
{
    ll len = SIZE(vec);
    for (int i = 0; i < len; i++)
        os << vec[i] << (i == len - 1 ? "\n" : " ");
    return os;
}

// pair 入力
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var)
{
    is >> pair_var.first >> pair_var.second;
    return is;
}

// pair 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var)
{
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var)
{
    os << "{";
    REPI(itr, map_var)
    {
        os << *itr;
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

// um 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var)
{
    os << "{";
    REPI(itr, map_var)
    {
        os << *itr;
        auto itrcp = itr;
        itrcp++;
        if (itrcp != map_var.end())
            os << ", ";
    }
    os << "}";
    return os;
}

// set 出力
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var)
{
    os << "{";
    REPI(itr, set_var)
    {
        os << *itr;
        itr++;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

// dump
#define DUMPOUT cerr
void dump_func()
{
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail)
{
    DUMPOUT << head;
    if (sizeof...(Tail) > 0)
    {
        DUMPOUT << ", ";
    }
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                       \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                     \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
            << endl                                                     \
            << "    ",                                                  \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize
{
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;

    AtCoderInitialize()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH)
            cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";

/* #endregion */

struct Entity
{
    ll x;
    ll w;

    // Entity() {} // これがあるとリスト初期化ができないっぽい
    // Entity(ll x) : x(x) {}
    bool operator<(const Entity &another) const
    {
        return x < another.x;
    }
    bool operator<(const ll &another_x) const
    {
        return x < another_x;
    }
    bool operator==(const Entity &another) const
    {
        return x == another.x && w == another.w;
    }
    friend istream &operator>>(istream &is, Entity &entity)
    {
        is >> entity.x >> entity.w;
        return is;
    }
    friend ostream &operator<<(ostream &os, const Entity &entity)
    {
        os << "(" << entity.x << "," << entity.w << ")";
        return os;
    }
};

/**
Problem
 */
void solve()
{
    ll n, q;
    cin >> n >> q;

    vc<Entity> xws(n);
    cin >> xws;
    sort(ALL(xws));
    vll x(q);
    cin >> x;
    // sort(ALL(x));

    vll sum_w(n), sum_xw(n);
    sum_w[0] = xws[0].w;
    sum_xw[0] = xws[0].w * xws[0].x;
    REP(i, 1, n)
    {
        sum_w[i] = sum_w[i - 1] + xws[i].w;
        sum_xw[i] = sum_xw[i - 1] + (xws[i].w * xws[i].x);
    }

    // dump(xws);
    REP(i, 0, q)
    {
        ll X = x[i];
        auto it = lower_bound(ALL(xws), X); // 「X 以上の」最初の要素のイテレータを返す
        ll n2 = it - xws.begin();
        // assert(ret == 2);
        // dump(i, X, n2);
        ll ret = 0;
        if (n2 == 0)
        {
            ret += -X * (sum_w[n - 1]) + (sum_xw[n - 1]);
        }
        else if (it == xws.end())
        {
            ret += X * sum_w[n - 1] - sum_xw[n - 1];
        }
        else
        {
            ret += X * sum_w[n2 - 1] - sum_xw[n2 - 1];
            ret += -X * (sum_w[n - 1] - sum_w[n2 - 1]) + (sum_xw[n - 1] - sum_xw[n2 - 1]);
        }
        cout << ret << endl;
    }
}

/**
 * エントリポイント．
 * @return 0.
 */
int main()
{
    solve();
    return 0;
}
0