結果

問題 No.1012 荷物収集
ユーザー ミドリムシミドリムシ
提出日時 2020-03-20 21:49:08
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 232 ms / 2,000 ms
コード長 3,958 bytes
コンパイル時間 1,622 ms
コンパイル使用メモリ 173,420 KB
実行使用メモリ 7,420 KB
最終ジャッジ日時 2023-08-21 16:08:58
合計ジャッジ時間 10,142 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 230 ms
7,384 KB
testcase_05 AC 225 ms
7,192 KB
testcase_06 AC 232 ms
7,396 KB
testcase_07 AC 229 ms
7,220 KB
testcase_08 AC 231 ms
7,192 KB
testcase_09 AC 228 ms
7,420 KB
testcase_10 AC 228 ms
7,224 KB
testcase_11 AC 232 ms
7,228 KB
testcase_12 AC 230 ms
7,416 KB
testcase_13 AC 229 ms
7,164 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 4 ms
4,380 KB
testcase_18 AC 3 ms
4,380 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 3 ms
4,384 KB
testcase_22 AC 3 ms
4,380 KB
testcase_23 AC 3 ms
4,500 KB
testcase_24 AC 168 ms
5,620 KB
testcase_25 AC 211 ms
7,168 KB
testcase_26 AC 89 ms
5,060 KB
testcase_27 AC 21 ms
4,380 KB
testcase_28 AC 196 ms
7,224 KB
testcase_29 AC 75 ms
5,072 KB
testcase_30 AC 194 ms
7,156 KB
testcase_31 AC 121 ms
5,100 KB
testcase_32 AC 79 ms
4,620 KB
testcase_33 AC 137 ms
5,132 KB
testcase_34 AC 150 ms
5,096 KB
testcase_35 AC 165 ms
7,396 KB
testcase_36 AC 155 ms
5,208 KB
testcase_37 AC 73 ms
5,068 KB
testcase_38 AC 172 ms
5,584 KB
testcase_39 AC 70 ms
4,600 KB
testcase_40 AC 92 ms
5,072 KB
testcase_41 AC 221 ms
7,220 KB
testcase_42 AC 118 ms
5,324 KB
testcase_43 AC 144 ms
5,324 KB
testcase_44 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using lint128 = __int128_t;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void assert_NO(T condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
template<class T> inline void assert_No(T condition){ if(!condition){ cout << "No" << endl; exit(0); } }
template<class T> inline void assert_minus_1(T condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd_calc(T a, T b){ if(b){ return gcd_calc(b, a % b); }else{ return a; }}
template<class T> T gcd(T a, T b){ if(a < b) swap(a, b); return gcd_calc(a, b); }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int at(int x, int k){ return (x >> k) & 1; }
random_device rnd;
#define rep(i, n) for(int i = 0; i < n; i++)

int main(){
    int N, Q;
    cin >> N >> Q;
    vector<pair<lint, int>> event;
    for(int i = 0; i < N; i++){
        lint x;
        int w;
        cin >> x >> w;
        event.push_back({x, w});
    }
    for(int i = 0; i < Q; i++){
        lint X;
        cin >> X;
        event.push_back({X, -i});
    }
    sort(all(event));
    lint l_cost = 0, l_weight = 0, r_cost = 0, r_weight = 0, saved = 0;
    for(auto i: event){
        if(i.second >= 1){
            r_cost += i.first * i.second;
            r_weight += i.second;
        }
    }
    lint ans[Q];
    for(auto i: event){
        if(i.second >= 1){
            l_cost += l_weight * (i.first - saved);
            l_weight += i.second;
            r_cost -= r_weight * (i.first - saved);
            r_weight -= i.second;
            saved = i.first;
        }else{
            ans[-i.second] = l_cost + l_weight * (i.first - saved) + r_cost - r_weight * (i.first - saved);
        }
    }
    rep(i, Q){
        cout << ans[i] << endl;
    }
}
0