結果
問題 |
No.2774 Wake up Record 2
|
ユーザー |
|
提出日時 | 2024-06-08 19:07:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 37 ms / 2,000 ms |
コード長 | 2,235 bytes |
コンパイル時間 | 2,213 ms |
コンパイル使用メモリ | 209,456 KB |
最終ジャッジ日時 | 2025-02-21 20:58:34 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = (int)1e9 + 1001010; const ll llINF = (long long)4e18 + 22000020; const string endn = "\n"; template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));} const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn; template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;} template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;} template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;} template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;} template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;} template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);} template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);} ll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;} ll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;} ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;} #ifdef DEBUG #include <debug_slephy.cpp> #else #define debug(...) #endif // ================================== ここまでテンプレ ================================== int main(int argc, char *argv[]){ ios::sync_with_stdio(false); cin.tie(nullptr); ll n, k; cin >> n >> k; vector<ll> a(n); cin >> a; set<ll> sleep; vector<ll> sa = a; sort(sa.begin(), sa.end()); for(int i = 0; i < k; i++) sleep.emplace(sa[i]); vector<bool> is_sleep(n); for(int i = 0; i < n; i++) is_sleep[i] = sleep.count(a[i]); debug(is_sleep); vector<ll> ans; for(int i = 0; i < n-1; i++){ if(is_sleep[i] && !is_sleep[i+1]) ans.emplace_back(i+2); } cout << ans.size() << endl; cout << ans << endl; return 0; }