結果

問題 No.2698 Many Asakatsu
ユーザー woodywoodywoodywoody
提出日時 2024-03-22 23:30:09
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,908 bytes
コンパイル時間 3,718 ms
コンパイル使用メモリ 245,076 KB
実行使用メモリ 9,892 KB
最終ジャッジ日時 2024-09-30 12:44:01
合計ジャッジ時間 7,815 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
9,888 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 1 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 1 ms
6,820 KB
testcase_05 AC 1 ms
6,816 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 3 ms
6,816 KB
testcase_08 AC 3 ms
6,820 KB
testcase_09 AC 3 ms
6,820 KB
testcase_10 AC 3 ms
6,816 KB
testcase_11 AC 19 ms
6,816 KB
testcase_12 AC 17 ms
6,820 KB
testcase_13 AC 12 ms
6,820 KB
testcase_14 AC 21 ms
6,816 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    int n,m; cin>>n>>m;
    vl a(n),b(n);
    rep(i,n) cin>>a[i]>>b[i];


    auto itoj = [&](ll aa,ll bb, ll i, ll j)->ll{ // aa + bb*i ~ aa + bb*j の和
    if (j < i) return 0;
        ll ret = 0;
        ret += j*(j+1)/2;
        ret -= i*(i-1)/2;
        ret *= bb;
        ret += aa*(j-i+1);
        return ret;
    };

    auto getX = [&](int i, ll x){
        if (b[i]==0){
            ll ret = (ll)abs(a[i]-x) * m;
            return ret;
        }
        ll t = x - a[i];
        ll ret = 0;
        ll id;
        if (t < 0){
            id = -1;
        }else{
            id = t / b[i];
            chmin(id, (ll)m-1);
            ret = x*(id+1) - itoj(a[i], b[i], 0, id);
        }
        id++;
        ret += itoj(a[i], b[i], id, m-1);
        ret -= x*(m-1-id+1);
        {
            ll val = 0;
            rep(j,m) val += abs(a[i] + b[i]*j - x);
            if (val!=ret){
                show(x,i);
                show(val, ret);
            }
            assert(val == ret);
        }
        return ret;
    };

    auto getIdx = [&](int i,int j)->ll{
        auto check = [&](ll y)->bool{
            ll val1 = getX(i, y);
            ll val2 = getX(j, y);
            return (val1 <= val2);
        };
        ll l = 0, u = 1e9;
        while(u-l>1){
            ll mid = (l+u) / 2;
            if (check(mid)) l = mid;
            else u = mid;
        }
        return u;
    };

    vl idx(n-1);
    unordered_map<int,int> idl;
    rep(i,n-1){
        idx[i] = getIdx(i,i+1);
        idl[i+1] = i;
    }

    int l = 0;
    int q; cin>>q;
    ll xx; cin>>xx;
    vl c(n);
    rep(i,n) cin>>c[i];

    vi ans(q);
    vb flg(n);

    auto get1D = [&](int i,int j)->ll{
        return (ll)i*n + j;
    };

    mpq<pair<ll, ll>> ev;
    rep(i,n-1) ev.push({idx[i], get1D(i, i+1)});
    rep(i,q){
        while(sz(ev) && ev.top().fi <= xx){
            ll pp = ev.top().se;
            ev.pop();
            int l = pp/n;
            int r = pp%n;
            int nl = -1;
            if (idl.count(l)){
                nl = idl[l];
            }
            flg[l] = true;
            idl[r] = nl;
            if (nl==-1) continue;
            ll val = getIdx(nl, r);
            ev.push({val, get1D(nl, r)});
        }
        while(l < n-1 && flg[l]) l++;
        ans[i] = l + 1;
        xx += c[l];
    }
    coutv(ans);

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0