제출 #1167522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167522		yeediot	Fish 3 (JOI24_fish3)	C++20	100 / 100	495 ms	44128 KiB

Main

#include<bits/stdc++.h>
#include <mutex>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 3e5 + 5;
struct segtree{
    int seg[4 * mxn], tag[4 * mxn];
    void push(int id, int l, int r){
        int mm = l + r >> 1;
        tag[id * 2] += tag[id];
        tag[id * 2 + 1] += tag[id];
        seg[id * 2] += tag[id] * (mm - l + 1);
        seg[id * 2 + 1] += tag[id] * (r - mm);
        tag[id] = 0;
        return;
    }
    void pull(int id){
        seg[id] = seg[id * 2] + seg[id * 2 + 1];
    }
    void m(int l, int r, int id, int ql, int qr, int v){
        if(qr < l or r < ql)return;
        if(ql <= l and r <= qr){
            seg[id] += v * (r - l + 1);
            tag[id] += v;
            return;
        }
        int mm = l + r >> 1;
        push(id, l, r);
        m(l, mm, id * 2, ql, qr, v);
        m(mm + 1, r, id * 2 + 1, ql, qr, v);
        pull(id);
    }
    int q(int l, int r, int id, int ql, int qr){
        if(qr < l or r < ql) return 0;
        if(ql <= l and r <= qr){
            return seg[id];
        }
        int mm = l + r >> 1;
        push(id, l, r);
        return q(l, mm, id * 2, ql, qr) + q(mm + 1, r, id * 2 + 1, ql, qr);
    }
}tr;
void solve(){
    int n, d;
    cin >> n >> d;
    vector<int>v(n + 1), st, o(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> v[i];
    }
    o = v;
    int q;
    cin >> q;
    vector<int>ans(q + 1);
    vector<array<int, 2>>vec[n + 1];
    for(int i = 1; i <= q; i++){
        int l, r;
        cin >> l >> r;
        vec[r].pb({l, i});
    }
    auto cal = [&](int p){
        return o[p] - d * tr.q(1, n, 1, p, p);
    };
    for(int i = 1; i <= n; i++){
        int prv = i;
        while(sz(st)){
            int r = st.back();
            int x = cal(st.back()), y = cal(st.back() + 1);
            debug(x, y);
            if(x <= y) break;
            st.pop_back();
            int l = (sz(st) ? st.back() + 1 : 1);
            tr.m(1, n, 1, l, r, (x - y + d - 1) / d);
        }
        while(sz(st) and v[i] - v[st.back()] < d){
            st.pop_back();
        }
        st.pb(i);
        for(auto [l, id] : vec[i]){
            if(cal(l) < 0) ans[id] = -1;
            else ans[id] = tr.q(1, n, 1, l, i);
        }
        debug(st, v);
    }
    for(int i = 1; i <= q; i++){
        cout << ans[i] << '\n';
    }
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
        std::ifstream file1(p1);
        std::ifstream file2(p2);
        if(!file1.is_open() || !file2.is_open()) return false;
        std::string line1, line2;
        while (getline(file1, line1) && getline(file2, line2)) {
            if (line1 != line2)return false;
        }
        int cnta = 0, cntb = 0;
        while(getline(file1,line1))cnta++;
        while(getline(file2,line2))cntb++;
        return cntb - cnta <= 1;
    };
    bool check = compareFiles("output.txt","expected.txt");
    if(check) cerr<<"ACCEPTED\n";
    else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36