結果
問題 | No.532 Possible or Impossible |
ユーザー |
|
提出日時 | 2017-06-28 17:26:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,148 bytes |
コンパイル時間 | 1,247 ms |
コンパイル使用メモリ | 165,932 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-04 14:51:56 |
合計ジャッジ時間 | 2,005 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define FOR(i, a, b) for (ll i = (a); i < (b); i++)#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)#define rep(i, n) for (ll i = 0; i < (n); i++)#define rep1(i, n) for (ll i = 1; i <= (n); i++)#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)#define pb push_back#define mp make_pair#define fst first#define snd second#define show(x) cout << #x << " = " << x << endl#define chmin(x, y) x = min(x, y)#define chmax(x, y) x = max(x, y)#define pii pair<int, int>namespace is_stl_container_impl{template <typename T>struct is_stl_container : false_type {};template <typename T, size_t N>struct is_stl_container<array<T, N>> : true_type {};template <typename... Args>struct is_stl_container<vector<Args...>> : true_type {};template <typename... Args>struct is_stl_container<deque<Args...>> : true_type {};template <typename... Args>struct is_stl_container<list<Args...>> : true_type {};template <typename... Args>struct is_stl_container<forward_list<Args...>> : true_type {};template <typename... Args>struct is_stl_container<set<Args...>> : true_type {};template <typename... Args>struct is_stl_container<multiset<Args...>> : true_type {};template <typename... Args>struct is_stl_container<map<Args...>> : true_type {};template <typename... Args>struct is_stl_container<multimap<Args...>> : true_type {};template <typename... Args>struct is_stl_container<unordered_set<Args...>> : true_type {};template <typename... Args>struct is_stl_container<unordered_multiset<Args...>> : true_type {};template <typename... Args>struct is_stl_container<unordered_map<Args...>> : true_type {};template <typename... Args>struct is_stl_container<unordered_multimap<Args...>> : true_type {};template <typename... Args>struct is_stl_container<stack<Args...>> : true_type {};template <typename... Args>struct is_stl_container<queue<Args...>> : true_type {};template <typename... Args>struct is_stl_container<priority_queue<Args...>> : true_type {};} // namespace is_stl_container_impl//type trait to utilize the implementation type traits as well as decay the typetemplate <typename T>struct is_stl_container {static constexpr bool const value = is_stl_container_impl::is_stl_container<decay_t<T>>::value;};template <typename T>typename enable_if<is_stl_container<T>::value, ostream&>::type operator<<(ostream& os, const T& container){os << "[";for (const auto& p : container) {os << p << ",";}os << "]";return os;}template <typename S, typename T>ostream& operator<<(ostream& os, const pair<S, T>& p){os << "(" << p.first << "," << p.second<< ")";return os;}using ll = long long;constexpr ll MOD = 1000000007;template <typename T>constexpr T INF = numeric_limits<T>::inf() / 100;int main(){int n, m;cin >> n >> m;if (m == 0) {if (n > 2) {cout << "Possible" << endl;return 0;} else {cout << "Impossible" << endl;}} else {cout << "Possible" << endl;}return 0;}