結果

問題 No.2735 Demarcation
ユーザー noya2noya2
提出日時 2024-04-20 00:25:50
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 392 ms / 1,500 ms
コード長 5,468 bytes
コンパイル時間 3,485 ms
コンパイル使用メモリ 256,040 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-10-11 19:25:34
合計ジャッジ時間 9,209 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 62 ms
11,008 KB
testcase_05 AC 108 ms
5,248 KB
testcase_06 AC 129 ms
9,344 KB
testcase_07 AC 392 ms
10,368 KB
testcase_08 AC 244 ms
10,240 KB
testcase_09 AC 208 ms
5,888 KB
testcase_10 AC 229 ms
6,912 KB
testcase_11 AC 33 ms
5,248 KB
testcase_12 AC 77 ms
5,248 KB
testcase_13 AC 160 ms
5,248 KB
testcase_14 AC 271 ms
8,576 KB
testcase_15 AC 175 ms
5,248 KB
testcase_16 AC 135 ms
9,472 KB
testcase_17 AC 181 ms
6,912 KB
testcase_18 AC 69 ms
5,248 KB
testcase_19 AC 222 ms
10,496 KB
testcase_20 AC 295 ms
9,856 KB
testcase_21 AC 65 ms
8,448 KB
testcase_22 AC 97 ms
10,624 KB
testcase_23 AC 31 ms
5,504 KB
testcase_24 AC 53 ms
6,912 KB
testcase_25 AC 83 ms
9,344 KB
testcase_26 AC 75 ms
8,832 KB
testcase_27 AC 66 ms
7,808 KB
testcase_28 AC 106 ms
10,880 KB
testcase_29 AC 107 ms
10,880 KB
権限があれば一括ダウンロードができます

ソースコード

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 1 "/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 << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),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(vector<T> &v){
    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"


void solve(){
    int n; in(n);
    vector<int> a(n); in(a);
    vector<int> rui(n,0);
    rep(i,n-1){
        rui[i+1] = rui[i] + (a[i] == a[i+1] ? 1 : 0);
    }
    int q; in(q);
    while (q--){
        int l, r; in(l,r); l--;
        ll s; in(s);
        // f(1)
        int same = rui[r-1] - rui[l];
        if (same >= 61 || (1LL<<same) > s){
            out(0);
            continue;
        }
        // same <= 60 && (1LL<<same) <= s
        if (r-l >= 100){
            // f(1) > s
            out(1);
            continue;
        }
        if (r-1-l <= 61 && (1LL<<(r-1-l)) <= s){
            out(-1);
            continue;
        }
        for (int k = 2; ; k++){
            vector<ll> dp(r-l+1,0);
            dp[0] = 1;
            set<int> st;
            repp(i,l,r){
                st.clear();
                for (int j = i; j >= l; j--){
                    st.insert(a[j]);
                    if ((int)(st.size()) > k) break;
                    dp[i-l+1] += dp[j-l];
                    chmin(dp[i-l+1],s+1);
                }
            }
            if (dp[r-l] > s){
                out(k-1);
                break;
            }
        }
    }
}

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