結果
問題 | No.2803 Bocching Star |
ユーザー | 👑 binap |
提出日時 | 2024-07-12 21:21:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 2,544 bytes |
コンパイル時間 | 4,415 ms |
コンパイル使用メモリ | 264,728 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-12 21:21:15 |
合計ジャッジ時間 | 9,229 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 17 ms
5,376 KB |
testcase_04 | AC | 117 ms
5,760 KB |
testcase_05 | AC | 67 ms
5,376 KB |
testcase_06 | AC | 13 ms
5,376 KB |
testcase_07 | AC | 44 ms
5,376 KB |
testcase_08 | AC | 25 ms
5,376 KB |
testcase_09 | AC | 140 ms
5,632 KB |
testcase_10 | AC | 131 ms
6,016 KB |
testcase_11 | AC | 130 ms
6,052 KB |
testcase_12 | AC | 39 ms
5,376 KB |
testcase_13 | AC | 107 ms
5,376 KB |
testcase_14 | AC | 73 ms
5,376 KB |
testcase_15 | AC | 130 ms
6,016 KB |
testcase_16 | AC | 69 ms
5,376 KB |
testcase_17 | AC | 26 ms
5,376 KB |
testcase_18 | AC | 17 ms
5,376 KB |
testcase_19 | AC | 108 ms
5,504 KB |
testcase_20 | AC | 64 ms
5,376 KB |
testcase_21 | AC | 51 ms
5,376 KB |
testcase_22 | AC | 51 ms
5,376 KB |
testcase_23 | AC | 139 ms
6,016 KB |
testcase_24 | AC | 151 ms
6,944 KB |
testcase_25 | AC | 151 ms
6,780 KB |
testcase_26 | AC | 152 ms
6,912 KB |
testcase_27 | AC | 152 ms
6,400 KB |
testcase_28 | AC | 148 ms
6,268 KB |
testcase_29 | AC | 143 ms
6,144 KB |
testcase_30 | AC | 150 ms
6,776 KB |
testcase_31 | AC | 138 ms
6,272 KB |
testcase_32 | AC | 164 ms
6,780 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 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} int main(){ int n, s; cin >> n >> s; vector<int> p(n); cin >> p; vector<int> u = p; sort(u.begin(), u.end()); vector<int> cnt(n); rep(i, n){ cnt[i] += n - (lower_bound(u.begin(), u.end(), p[i] - s) - u.begin()); cnt[i] -= n - (upper_bound(u.begin(), u.end(), p[i] + s) - u.begin()); } vector<int> ans; rep(i, n) if(cnt[i] == 1) ans.push_back(i + 1); cout << ans.size() << "\n"; cout << ans; return 0; }