結果

問題 No.1012 荷物収集
ユーザー ningenMeningenMe
提出日時 2020-04-24 03:56:12
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 366 ms / 2,000 ms
コード長 3,463 bytes
コンパイル時間 1,988 ms
コンパイル使用メモリ 181,424 KB
実行使用メモリ 23,552 KB
最終ジャッジ日時 2024-10-14 15:39:22
合計ジャッジ時間 14,069 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 338 ms
23,552 KB
testcase_05 AC 312 ms
23,552 KB
testcase_06 AC 312 ms
23,552 KB
testcase_07 AC 312 ms
23,552 KB
testcase_08 AC 307 ms
23,552 KB
testcase_09 AC 307 ms
23,552 KB
testcase_10 AC 311 ms
23,552 KB
testcase_11 AC 312 ms
23,552 KB
testcase_12 AC 307 ms
23,552 KB
testcase_13 AC 309 ms
23,552 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 4 ms
5,248 KB
testcase_16 AC 3 ms
5,248 KB
testcase_17 AC 4 ms
5,248 KB
testcase_18 AC 4 ms
5,248 KB
testcase_19 AC 3 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 3 ms
5,248 KB
testcase_22 AC 4 ms
5,248 KB
testcase_23 AC 3 ms
5,248 KB
testcase_24 AC 273 ms
15,872 KB
testcase_25 AC 352 ms
19,968 KB
testcase_26 AC 137 ms
12,288 KB
testcase_27 AC 29 ms
5,376 KB
testcase_28 AC 316 ms
19,456 KB
testcase_29 AC 115 ms
13,056 KB
testcase_30 AC 320 ms
19,968 KB
testcase_31 AC 183 ms
10,496 KB
testcase_32 AC 112 ms
8,960 KB
testcase_33 AC 217 ms
12,160 KB
testcase_34 AC 237 ms
12,928 KB
testcase_35 AC 267 ms
17,152 KB
testcase_36 AC 232 ms
12,416 KB
testcase_37 AC 112 ms
12,544 KB
testcase_38 AC 270 ms
16,512 KB
testcase_39 AC 104 ms
9,344 KB
testcase_40 AC 142 ms
10,368 KB
testcase_41 AC 366 ms
21,504 KB
testcase_42 AC 179 ms
12,032 KB
testcase_43 AC 222 ms
15,232 KB
testcase_44 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N,Q; cin >> N >> Q;
    vector<ll> x(N+Q),w(N+Q,0);
    for(int i = 0; i < N; ++i) {
        cin >> x[i] >> w[i];
    }
    vector<ll> ans(Q);
    for(int i = 0; i < Q; ++i) {
        cin >> ans[i];
        x[i+N] = ans[i];
    }
    vector<int> idx(N+Q);
    iota(ALL(idx),0);
    sort(ALL(idx),[&](int l,int r){return x[l]<x[r];});
    vector<ll> suml(N+Q,0),sumr(N+Q,0);
    ll wl = w[idx.front()];
    for(int i = 1; i < N+Q; ++i) {
        int j = idx[i];
        int k = idx[i-1];
        suml[j] += suml[k] + (x[j]-x[k])*wl;
        wl += w[j];
    }
    ll wr = w[idx.back()];
    for(int i = N+Q-2; 0 <= i; --i) {
        int j = idx[i];
        int k = idx[i+1];
        sumr[j] += sumr[k] + (x[k]-x[j])*wr;
        wr += w[j];
    }
    map<ll,ll> mp;
    for(int i = 0; i < N+Q; ++i) {
        int j = idx[i];
        mp[x[j]] = suml[j]+sumr[j];
    }
    for(auto& e:ans){
        cout << mp[e] << endl;
    }

    return 0;
}
0