結果
問題 | No.2806 Cornflake Man |
ユーザー | 👑 binap |
提出日時 | 2024-07-12 22:40:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 2,632 bytes |
コンパイル時間 | 4,286 ms |
コンパイル使用メモリ | 270,584 KB |
実行使用メモリ | 23,676 KB |
最終ジャッジ日時 | 2024-07-17 20:27:31 |
合計ジャッジ時間 | 6,317 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
8,832 KB |
testcase_01 | AC | 189 ms
18,944 KB |
testcase_02 | AC | 17 ms
6,944 KB |
testcase_03 | AC | 199 ms
19,712 KB |
testcase_04 | AC | 16 ms
6,944 KB |
testcase_05 | AC | 37 ms
7,168 KB |
testcase_06 | AC | 42 ms
6,940 KB |
testcase_07 | AC | 252 ms
22,144 KB |
testcase_08 | AC | 40 ms
6,940 KB |
testcase_09 | AC | 112 ms
13,312 KB |
testcase_10 | AC | 57 ms
8,448 KB |
testcase_11 | AC | 8 ms
6,940 KB |
testcase_12 | AC | 72 ms
9,472 KB |
testcase_13 | AC | 150 ms
16,304 KB |
testcase_14 | AC | 29 ms
6,940 KB |
testcase_15 | AC | 270 ms
23,676 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,940 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, m; cin >> n >> m; vector<int> a(n); cin >> a; sort(a.begin(), a.end()); set<int> alpha; rep(i, n) alpha.insert(a[i]); set<int> beta; vector<int> ans; rep(i, n){ if(i == 0) continue; int x = a[i]; if(beta.find(x) == beta.end()){ for(int y = 0; y <= m; y += x){ if(alpha.find(y) == alpha.end()){ cout << "-1\n"; return 0; } beta.insert(y); } ans.push_back(x); } } cout << ans.size() << "\n"; for(int x : ans) cout << x << ' '; return 0; }