結果

問題 No.2806 Cornflake Man
ユーザー Slephy
提出日時 2024-07-12 21:36:28
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 372 ms / 2,000 ms
コード長 2,646 bytes
コンパイル時間 2,393 ms
コンパイル使用メモリ 204,256 KB
最終ジャッジ日時 2025-02-22 03:40:41
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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 ELM_SEP = " ", VEC_SEP = 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 ? ELM_SEP : "");} return
    o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEP : ""
    );} 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 <cpp-dump/dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
struct InitCppDump{
InitCppDump(){
if(!isatty(fileno(stderr))) CPP_DUMP_SET_OPTION(es_style, cpp_dump::es_style_t::no_es);
CPP_DUMP_SET_OPTION(log_label_func, cp::log_label::line());
CPP_DUMP_SET_OPTION(max_iteration_count, 30);
}
} init_cpp_dump;
#else
#define dump(...)
#endif
// ================================== ==================================
int main(int argc, char *argv[]){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, m; cin >> n >> m;
set<ll> a;
for(int i = 0; i < n; i++){
int tmp; cin >> tmp;
a.emplace(tmp);
}
vector<ll> b;
set<ll> used;
for(auto val : a){
if(val == 0) continue;
if(used.count(val)) continue;
b.emplace_back(val);
for(ll i = 2*val; i <= m; i+=val){
if(!a.count(i)){
cout << -1 << endl;
return 0;
}
else{
used.emplace(i);
}
}
}
cout << b.size() << endl;
cout << b << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0