結果

問題 No.1012 荷物収集
ユーザー raooooo0__eeicraooooo0__eeic
提出日時 2020-03-20 22:16:47
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 174 ms / 2,000 ms
コード長 4,597 bytes
コンパイル時間 4,124 ms
コンパイル使用メモリ 178,784 KB
実行使用メモリ 7,392 KB
最終ジャッジ日時 2023-08-21 16:58:43
合計ジャッジ時間 11,768 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 168 ms
7,392 KB
testcase_05 AC 165 ms
7,216 KB
testcase_06 AC 167 ms
7,332 KB
testcase_07 AC 169 ms
7,216 KB
testcase_08 AC 169 ms
7,316 KB
testcase_09 AC 170 ms
7,272 KB
testcase_10 AC 167 ms
7,336 KB
testcase_11 AC 174 ms
7,232 KB
testcase_12 AC 173 ms
7,180 KB
testcase_13 AC 173 ms
7,252 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 3 ms
4,380 KB
testcase_16 AC 3 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,376 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 3 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 133 ms
5,636 KB
testcase_25 AC 169 ms
6,488 KB
testcase_26 AC 55 ms
4,996 KB
testcase_27 AC 12 ms
4,380 KB
testcase_28 AC 140 ms
6,384 KB
testcase_29 AC 34 ms
4,792 KB
testcase_30 AC 137 ms
6,544 KB
testcase_31 AC 105 ms
4,744 KB
testcase_32 AC 62 ms
4,408 KB
testcase_33 AC 111 ms
4,900 KB
testcase_34 AC 131 ms
5,112 KB
testcase_35 AC 118 ms
5,952 KB
testcase_36 AC 133 ms
5,104 KB
testcase_37 AC 35 ms
4,940 KB
testcase_38 AC 134 ms
5,984 KB
testcase_39 AC 51 ms
4,412 KB
testcase_40 AC 72 ms
4,584 KB
testcase_41 AC 167 ms
6,908 KB
testcase_42 AC 91 ms
4,808 KB
testcase_43 AC 104 ms
5,724 KB
testcase_44 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
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(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};


int main(){
    iosetup;
    int N, Q; cin >> N >> Q;
    vector<pii> P(N);
    cin >> P;
    vector<int> X(Q);
    cin >> X;
    vector<pair<pii,int> > S(N + Q);
    rep(i, 0, N) S[i] = mp(P[i], -1);
    rep(i, 0, Q) S[i + N] = mp(mp(X[i], -1), i);
    sort(ALL(S));
    ll INC = 0, DEC = 0, cnt = 0, t = 0, pre = 0;
    rep(i, 0, N) DEC += P[i].second;
    rep(i, 0, N) t += ll(P[i].second) * P[i].first;
    // cerr << t << endl;
    vector<ll> ans(Q);
    rep(i, 0, N + Q){
        if(S[i].second == -1){
            t -= DEC * (S[i].first.first - pre);
            t += INC * (S[i].first.first - pre);
            INC += S[i].first.second;
            DEC -= S[i].first.second;
            pre = S[i].first.first;
        }else{
            int idx = S[i].second;
            t -= DEC * (S[i].first.first - pre);
            t += INC * (S[i].first.first - pre);
            pre = S[i].first.first;
            ans[idx] = t;
        }
        // cerr << t << endl;
    }
    rep(i, 0, Q) cout << ans[i] << endl;

    return 0;
}
0