結果

問題 No.2803 Bocching Star
ユーザー hibit_athibit_at
提出日時 2024-07-12 21:11:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 179 ms / 2,000 ms
コード長 4,142 bytes
コンパイル時間 1,303 ms
コンパイル使用メモリ 119,928 KB
実行使用メモリ 6,120 KB
最終ジャッジ日時 2024-07-12 21:11:43
合計ジャッジ時間 5,844 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 18 ms
5,376 KB
testcase_04 AC 106 ms
5,376 KB
testcase_05 AC 57 ms
5,376 KB
testcase_06 AC 12 ms
5,376 KB
testcase_07 AC 42 ms
5,376 KB
testcase_08 AC 23 ms
5,376 KB
testcase_09 AC 108 ms
5,376 KB
testcase_10 AC 114 ms
5,376 KB
testcase_11 AC 122 ms
5,376 KB
testcase_12 AC 42 ms
5,376 KB
testcase_13 AC 92 ms
5,376 KB
testcase_14 AC 63 ms
5,376 KB
testcase_15 AC 122 ms
5,376 KB
testcase_16 AC 67 ms
5,376 KB
testcase_17 AC 27 ms
5,376 KB
testcase_18 AC 17 ms
5,376 KB
testcase_19 AC 99 ms
5,376 KB
testcase_20 AC 63 ms
5,376 KB
testcase_21 AC 47 ms
5,376 KB
testcase_22 AC 48 ms
5,376 KB
testcase_23 AC 128 ms
5,376 KB
testcase_24 AC 179 ms
6,120 KB
testcase_25 AC 143 ms
5,996 KB
testcase_26 AC 146 ms
6,120 KB
testcase_27 AC 130 ms
5,376 KB
testcase_28 AC 145 ms
5,504 KB
testcase_29 AC 124 ms
5,376 KB
testcase_30 AC 148 ms
6,120 KB
testcase_31 AC 131 ms
5,376 KB
testcase_32 AC 155 ms
6,120 KB
testcase_33 AC 3 ms
5,376 KB
testcase_34 AC 3 ms
5,376 KB
testcase_35 AC 3 ms
5,376 KB
testcase_36 AC 3 ms
5,376 KB
testcase_37 AC 3 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

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

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

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

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

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

int main(){
    int n,s;
    cin >> n >> s;
    vector<pair<int,int>> vp(n);
    rep(i,n){
        int p;
        cin >> p;
        vp[i] = {p,i+1};
    }
    sort(all(vp));
    // debug(vp);
    vector<int> ans;
    rep(i,n){
        int now = vp[i].first;
        int cnt = upper_bound(all(vp),make_pair(now+s,INT_MAX)) - lower_bound(all(vp),make_pair(now-s,INT_MIN));
        // debug(cnt);
        if(cnt == 1){
            ans.push_back(vp[i].second);
        }
    }
    cout << ans.size() << endl;
    sort(all(ans));
    cout << ans << endl;

}
0