結果

問題 No.2698 Many Asakatsu
コンテスト
ユーザー noya2
提出日時 2025-03-04 23:06:47
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 655 ms / 2,000 ms
コード長 6,726 bytes
コンパイル時間 4,224 ms
コンパイル使用メモリ 293,056 KB
実行使用メモリ 112,336 KB
最終ジャッジ日時 2025-03-04 23:07:01
合計ジャッジ時間 12,999 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

using bll = __int128_t;

void solve(){
    int n; in(n);
    ll m; in(m);
    vector<ll> a(n), b(n);
    rep(i,n) in(a[i],b[i]);
    // sum[i = l..r] ia + ib*i
    auto get = [&](ll l, ll r, ll ia, ll ib) -> bll {
        if (l > r) return 0;
        return bll(ia + ib*l + ia + ib*r) * (r - l + 1) / 2;
    };
    auto dist = [&](int i, ll r) -> bll {
        if (b[i] == 0){
            return bll(abs(a[i] - r)) * m;
        }
        ll e = clamp<ll>(floor_div(r - a[i], b[i]), -1, m-1);
        // 0 <= j <= e : neg
        // e+1 <= j <= m-1 : pos
        bll ret = get(0,e,-a[i]+r,-b[i]);
        ret += get(e+1,m-1,a[i]-r,b[i]);
        return ret;
    };
    vector<tuple<ll,ll,ll>> ds;
    // lx <= x <= rx, lc <= c <= rc
    auto dfs = [&](auto sfs, ll lx, ll rx, int lc, int rc) -> void {
        if (lx > rx) return ;
        int lxc = [&]{
            bll mi = bll(1) << 120;
            int ret = -1;
            repp(i,lc,rc+1){
                if (chmin(mi,dist(i,lx))){
                    ret = i;
                }
            }
            return ret;
        }();
        int rxc = [&]{
            bll mi = bll(1) << 120;
            int ret = -1;
            repp(i,lc,rc+1){
                if (chmin(mi,dist(i,rx))){
                    ret = i;
                }
            }
            return ret;
        }();
        if (lxc == rxc){
            ds.emplace_back(lx,rx,lxc);
            return ;
        }
        ll mx = (lx + rx) / 2;
        int mxc = [&]{
            bll mi = bll(1) << 120;
            int ret = -1;
            repp(i,lc,rc+1){
                if (chmin(mi,dist(i,mx))){
                    ret = i;
                }
            }
            return ret;
        }();
        sfs(sfs,lx,mx-1,lc,mxc);
        ds.emplace_back(mx,mx,mxc);
        sfs(sfs,mx+1,rx,mxc,rc);
    };
    dfs(dfs,0,linf,0,n-1);
    vector<ll> rs;
    vector<int> cs;
    ll px = -1;
    for (auto [lx, rx, c] : ds){
        assert(lx == px + 1);
        rs.emplace_back(lx);
        cs.emplace_back(c);
        px = rx;
    }
    int q; in(q);
    ll x; in(x);
    vector<ll> c(n); in(c);
    vector<int> ans; ans.reserve(q);
    while (q--){
        // x <= rs[i+1], smallest i
        int id = cs[upper_bound(all(rs),x) - rs.begin() - 1];
        ans.emplace_back(id+1);
        x += c[id];
    }
    out(ans);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0