#993881 (C++23) No.2803 Bocching Star

• 問題: No.2803 Bocching Star
• ユーザー: wingu
• 提出日時: 2024-07-12 21:04:37
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 71 ms / 2,000 ms
• コード長: 3,166 bytes
• コンパイル時間: 3,096 ms
• コンパイル使用メモリ: 258,312 KB
• 実行使用メモリ: 6,020 KB
• 最終ジャッジ日時: 2024-07-12 21:05:36
• 合計ジャッジ時間: 6,064 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	9 ms; 5,376 KB
testcase_04	AC	41 ms; 5,376 KB
testcase_05	AC	21 ms; 5,376 KB
testcase_06	AC	5 ms; 5,376 KB
testcase_07	AC	18 ms; 5,376 KB
testcase_08	AC	10 ms; 5,376 KB
testcase_09	AC	41 ms; 5,376 KB
testcase_10	AC	46 ms; 5,376 KB
testcase_11	AC	58 ms; 5,376 KB
testcase_12	AC	17 ms; 5,376 KB
testcase_13	AC	35 ms; 5,376 KB
testcase_14	AC	25 ms; 5,376 KB
testcase_15	AC	54 ms; 5,376 KB
testcase_16	AC	29 ms; 5,376 KB
testcase_17	AC	9 ms; 5,376 KB
testcase_18	AC	7 ms; 5,376 KB
testcase_19	AC	40 ms; 5,376 KB
testcase_20	AC	25 ms; 5,376 KB
testcase_21	AC	19 ms; 5,376 KB
testcase_22	AC	21 ms; 5,376 KB
testcase_23	AC	50 ms; 5,376 KB
testcase_24	AC	64 ms; 6,020 KB
testcase_25	AC	61 ms; 6,012 KB
testcase_26	AC	65 ms; 6,016 KB
testcase_27	AC	52 ms; 5,504 KB
testcase_28	AC	57 ms; 5,504 KB
testcase_29	AC	51 ms; 5,376 KB
testcase_30	AC	61 ms; 5,888 KB
testcase_31	AC	47 ms; 5,376 KB
testcase_32	AC	71 ms; 6,016 KB
testcase_33	AC	3 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	2 ms; 5,376 KB
testcase_36	AC	3 ms; 5,376 KB
testcase_37	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;

#ifdef DEFINED_ONLY_IN_LOCAL
#include <dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
#else
#undef dump
#define dump(...)
#endif
#define rep1(i, a) for (int i = 0; i < (int)(a); i++)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep3(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define overloadRep(a, b, c, d, e, ...) e
#define rep(...) overloadRep(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define drep(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using ll = long long;
using ull = unsigned long long;
const int inf = 1e9;
const ll INF = 1e18;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
const int ddy[8] = {0, 1, 0, -1, 1, -1, -1, 1};

struct cincout {
    cincout() {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} init;

// chmax chmin
template <class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

// pair
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    os << p.first << " " << p.second << '\n';
    return os;
}

// vector
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) {
        is >> in;
    }
    return is;
}

template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    rep(i, (int)v.size()) {
        os << v[i] << " \n"[i + 1 == (int)v.size()];
    }
    return os;
}

template <class T>
istream &operator>>(istream &is, vector<vector<T>> &vv) {
    for (vector<T> &v : vv) {
        is >> v;
    }
    return is;
}

template <class T>
ostream &operator<<(ostream &os, vector<vector<T>> &vv) {
    for (vector<T> &v : vv) {
        os << v;
    }
    return os;
}

// bit
bool bit(ll x, int p) {
    return (x >> p) & 1;
}

// grid out
bool out(int ni, int nj, int h, int w) {
    return (ni < 0 or ni >= h or nj < 0 or nj >= w);
}

// popcount
int pc(ll x) {
    return __builtin_popcountll(x);
}

// max(vector)
template <class T>
T max(vector<T> x) {
    return *max_element(x.begin(), x.end());
}
using P=pair<int,int>;
int main(){
    int n,s;cin>>n>>s;
    vector<P>p(n);
    rep(i,n){
        int a;cin>>a;
        p[i]=P(a,i);
    }

    vector<int>ans;
    sort(all(p));
    rep(i,n){
        auto[x,id]=p[i];
        bool ok=true;
        if(i)if(x-p[i-1].first<=s)ok=false;
        if(i!=n-1 and p[i+1].first-x<=s)ok=false;
        if(ok)ans.push_back(id);
    }
    sort(all(ans));
    
    cout<<ans.size()<<endl;
    rep(i,ans.size())ans[i]++;
    cout<<ans;
    return 0;
}