結果

問題 No.2735 Demarcation
ユーザー woodywoodywoodywoody
提出日時 2024-04-20 18:03:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 881 ms / 1,500 ms
コード長 7,648 bytes
コンパイル時間 4,778 ms
コンパイル使用メモリ 273,952 KB
実行使用メモリ 35,308 KB
最終ジャッジ日時 2024-10-12 14:02:52
合計ジャッジ時間 14,960 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 83 ms
35,288 KB
testcase_05 AC 208 ms
6,820 KB
testcase_06 AC 356 ms
32,172 KB
testcase_07 AC 868 ms
34,360 KB
testcase_08 AC 527 ms
33,808 KB
testcase_09 AC 294 ms
16,920 KB
testcase_10 AC 352 ms
19,160 KB
testcase_11 AC 79 ms
10,524 KB
testcase_12 AC 98 ms
6,820 KB
testcase_13 AC 202 ms
7,224 KB
testcase_14 AC 812 ms
30,404 KB
testcase_15 AC 504 ms
6,820 KB
testcase_16 AC 408 ms
32,168 KB
testcase_17 AC 476 ms
18,880 KB
testcase_18 AC 166 ms
10,704 KB
testcase_19 AC 665 ms
34,132 KB
testcase_20 AC 881 ms
33,164 KB
testcase_21 AC 82 ms
30,012 KB
testcase_22 AC 107 ms
34,584 KB
testcase_23 AC 99 ms
15,904 KB
testcase_24 AC 161 ms
18,956 KB
testcase_25 AC 263 ms
31,736 KB
testcase_26 AC 233 ms
30,824 KB
testcase_27 AC 211 ms
29,124 KB
testcase_28 AC 331 ms
35,308 KB
testcase_29 AC 332 ms
35,272 KB
権限があれば一括ダウンロードができます

ソースコード

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 ull = 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__)

ll op(ll a,ll b){
    if (a>=LLONG_MAX/b) return LINF;
    else return a*b;
}
ll e(){
    return 1;
}

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

    vl two(62);
    two[0] = 1;
    rep1(i,62) two[i] = two[i-1]*2;

    segtree<ll,op,e> sg(n);
    int li = 0;
    rep(i,n-1){
        if (a[i]==a[i+1]) continue;
        else{
            int len = (i-li)+1;
            if (len-1<62) sg.set(i, two[len-1]);
            else sg.set(i, LINF);
            li = i+1;
        }
    }
    if (n-li-1<62) sg.set(n-1, two[n-li-1]);
    else sg.set(n-1, LINF);

    vi l(n),r(n);
    rep1(i,n){
        if (a[i]==a[i-1]) l[i] = l[i-1];
        else l[i] = i;
    }
    rrep(i,n-1){
        if (a[i]==a[i+1]) r[i] = r[i+1];
        else r[i] = i;
    }

    int q; cin>>q;
    vl ans(q);
    const int threshold = 200;
    rep(i,q){
        ll li,ri,s; cin>>li>>ri>>s;
        li--; ri--;
        if ((ri-li+1)>=threshold){
            ll k = 0;
            int li2 = r[li]+1;
            int ri2 = l[ri]-1;
            if (r[li]<l[ri]){
                if (li2<=ri2){
                    k = sg.prod(li2,ri2+1);
                }else{
                    k = 1;
                }
                ll lenl = li2-li;
                ll lenr = ri-ri2;
                if (lenl-1<62){
                    if (k >= LLONG_MAX/two[lenl-1]) k = LINF;
                    else k *= two[lenl-1];
                }else k = LINF;
                if (lenr-1<62){
                    if (k >= LLONG_MAX/two[lenr-1]) k = LINF;
                    else k *= two[lenr-1];
                }else k = LINF;

                if (k<=s) ans[i] = 1;
                else ans[i] = 0;
            }else{
                assert(a[li]==a[ri]);
                ll k = 0;
                ll len = ri-li+1;
                if (len-1<62) k = two[len-1];
                else k = LINF;
                if (k<=s) ans[i] = 1;
                else ans[i] = 0;
            }
        }else{
            int len = ri-li+1;
            auto check = [&](int mid)->bool{
                fenwick_tree<ll> fw(len+1);
                fw.add(0,1);
                int l = 1;
                unordered_map<int,int> mp;
                rep1(j,len+1){
                    mp[a[li+j-1]]++;
                    while(sz(mp)>mid){
                        if (--mp[a[li+l-1]]==0) mp.erase(a[li+l-1]);
                        l++;
                    }
                    ll sum = fw.sum(l-1, j);
                    if (sum > s){
                        return false;
                    }
                    fw.add(j,sum);
                }
                return true;
            };
            if (!check(1)){
                ans[i] = 0;
                continue;
            }
            if (check(len)){
                ans[i] = -1;
                continue;
            }
            int l2 = 1, u2 = len;
            while(u2-l2>1){
                int mid = (l2+u2)/2;
                if (check(mid)) l2 = mid;
                else u2 = mid;
            }
            ans[i] = l2;
        }
    }
    outv;

    return;
}

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

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

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

    return 0;
}
0