結果
問題 | No.2210 equence Squence Seuence |
ユーザー |
👑 ![]() |
提出日時 | 2023-02-10 22:01:40 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 78 ms / 2,000 ms |
コード長 | 3,363 bytes |
コンパイル時間 | 19,236 ms |
コンパイル使用メモリ | 355,564 KB |
最終ジャッジ日時 | 2025-02-10 12:45:59 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int,int>>#define vpll vector<pair<ll,ll>>#define vvpii vector<vector<pair<int,int>>>#define vvpll vector<vector<pair<ll,ll>>>template<typename T> void debug(T e){cerr << e << endl;}template<typename T> void debug(vector<T> &v){rep(i, v.size()){cerr << v[i] << " ";}cerr << endl;}template<typename T> void debug(vector<vector<T>> &v){rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";}cerr << endl;}}template<typename T> void debug(vector<pair<T, T>> &v){rep(i,v.size()){cerr << v[i].first << " " << v[i].second << endl;}}template<typename T> void debug(set<T> &st){for (auto itr = st.begin(); itr != st.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(multiset<T> &ms){for (auto itr = ms.begin(); itr != ms.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(map<T, T> &mp){for (auto itr = mp.begin(); itr != mp.end(); itr++){cerr << itr->first << " " << itr->second << endl;}}void debug_out(){cerr << endl;}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T){cerr << H << " ";debug_out(T...);}int main(){ll N, K;cin >> N >> K;ll left = 1;ll right = N;vl A(N);rep(i,N){cin >> A[i];}vpll rle(0);rle.push_back(pll(A[0], 1));for (ll i = 1; i < N; i++){if (A[i] == A[i - 1]){rle[rle.size() - 1].second++;}else{rle.push_back(pll(A[i], 1));}}for (ll i = 0; i < rle.size() - 1; i++){if (rle[i].first > rle[i + 1].first){left += rle[i].second;if (left > K){rle[i].second--;break;}}else if (rle[i].first < rle[i + 1].first){right -= rle[i].second;if (right < K){rle[i].second--;break;}}}if (left <= K && K <= right){rle[rle.size() - 1].second--;}vl ans(0);for (ll i = 0; i < rle.size(); i++){for (ll j = 0; j < rle[i].second; j++){ans.push_back(rle[i].first);}}rep(i,ans.size()){cout << ans[i] << " ";}cout << endl;}