結果
問題 | No.1285 ゴミ捨て |
ユーザー | Gosu_Hiroo |
提出日時 | 2020-11-13 21:22:24 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 21 ms / 2,000 ms |
コード長 | 9,281 bytes |
コンパイル時間 | 2,337 ms |
コンパイル使用メモリ | 205,720 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-28 21:33:09 |
合計ジャッジ時間 | 3,310 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 20 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 10 ms
6,820 KB |
testcase_10 | AC | 18 ms
6,816 KB |
testcase_11 | AC | 17 ms
6,816 KB |
testcase_12 | AC | 12 ms
6,816 KB |
testcase_13 | AC | 12 ms
6,816 KB |
testcase_14 | AC | 20 ms
6,820 KB |
testcase_15 | AC | 14 ms
6,816 KB |
testcase_16 | AC | 5 ms
6,816 KB |
testcase_17 | AC | 5 ms
6,816 KB |
testcase_18 | AC | 5 ms
6,820 KB |
testcase_19 | AC | 9 ms
6,816 KB |
testcase_20 | AC | 4 ms
6,816 KB |
testcase_21 | AC | 7 ms
6,816 KB |
testcase_22 | AC | 21 ms
6,820 KB |
testcase_23 | AC | 21 ms
6,816 KB |
ソースコード
/*** code generated by JHelper* More info: https://github.com/AlexeyDmitriev/JHelper* @author Gosu_Hiroo*/#include <bits/stdc++.h>using namespace std;using ll = long long;using VI = vector<int>;using VL = vector<long long>;using PII = pair<int, int>;using PLL = pair<long long, long long>;//#pragma GCC optimize("O3")//#pragma GCC target("avx2")//#pragma GCC target("avx512f")//#pragma GCC optimize("unroll-loops")//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")//#pragma GCC optimize("Ofast")#define V vector#define G(size_1) vector<vector<int>>(size_1, vector<int>())#define SZ(x) ((long long)(x).size())#define READ ({long long t;cin >> t;t;})#define FOR(i, __begin, __end) for (auto i = (__begin) - ((__begin) > (__end)); i != (__end) - ((__begin) > (__end)); i += 1 - 2 * ((__begin) >(__end)))#define REP(i, __end) for (auto i = decltype(__end){0}; i < (__end); ++i)#define ALL(x) (x).begin(),(x).end()#define RALL(x) (x).rbegin(),(x).rend()#define F first#define S second#define y0 y3487465#define y1 y8687969#define j0 j1347829#define j1 j234892#define BIT(n) (1LL<<(n))#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define EB emplace_back#define PB push_back#define fcout cout << fixed << setprecision(12)#define fcerr cerr << fixed << setprecision(12)#define print(x) cout << (x) << '\n'#define printE(x) cout << (x) << '\n';#define fprint(x) cout << fixed << setprecision(12) << (x) << '\n';# define BYE(a) do { cout << (a) << endl; return ; } while (false)#define LB lower_bound#define UB upper_bound#define LBI(c, x) distance((c).begin(), lower_bound((c).begin(), (c).end(), (x)))#define UBI(c, x) distance((c).begin(), upper_bound((c).begin(), (c).end(), (x)))#ifdef DEBUG#define DBG(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(std::cerr,_it, args); }#else#define DBG(args...) {};#define ERR(args...) {};#endifvoid _err(std::ostream& cerr, istream_iterator<string> it){cerr << endl;}template<typename T, typename... Args>void _err(std::ostream& cerr, istream_iterator<string> it, T a, Args... args){cerr << *it << " = " << a << " ";_err(cerr, ++it, args...);}namespace aux{template<std::size_t...>struct seq{};template<std::size_t N, std::size_t... Is>struct gen_seq : gen_seq<N - 1, N - 1, Is...>{};template<std::size_t... Is>struct gen_seq<0, Is...> : seq<Is...>{};template<class Ch, class Tr, class Tuple, std::size_t... Is>void print_tuple(std::basic_ostream<Ch, Tr>& os, Tuple const& t, seq<Is...>){using swallow = int[];(void) swallow{0, (void(os << (Is == 0 ? "" : ",") << std::get<Is>(t)), 0)...};}template<class Ch, class Tr, class Tuple, std::size_t... Is>void read_tuple(std::basic_istream<Ch, Tr>& os, Tuple& t, seq<Is...>){using swallow = int[];(void) swallow{0, (void(os >> std::get<Is>(t)), 0)...};}} // aux::template<class Ch, class Tr, class... Args>auto operator<<(std::basic_ostream<Ch, Tr>& os, std::tuple<Args...> const& t)-> std::basic_ostream<Ch, Tr>&{os << "(";aux::print_tuple(os, t, aux::gen_seq<sizeof...(Args)>());return os << ")";}template<class Ch, class Tr, class... Args>auto operator>>(std::basic_istream<Ch, Tr>& os, std::tuple<Args...>& t)-> std::basic_istream<Ch, Tr>&{aux::read_tuple(os, t, aux::gen_seq<sizeof...(Args)>());return os;}template<class T>inline bool chmax(T& a, const T& b){if(a < b){a = b;return 1;}return 0;}template<class T>inline bool chmin(T& a, const T& b){if(b < a){a = b;return 1;}return 0;}template<typename T, typename U>istream& operator>>(istream& is, pair<T, U>& V){is >> V.F >> V.S;return is;}template<typename T>istream& operator>>(istream& is, vector <T>& V){for(auto&& ele : V)is >> ele;return is;}template<typename T>ostream& operator<<(ostream& os, const vector <T> V){os << "[";int cnt = 0;T curr;if(!V.empty()){for(int i = 0; i < V.size() - 1; ++i){if(V[i] == curr)cnt++;else cnt = 0;if(cnt == 4)os << "... ";if(cnt < 4)os << i << ":" << V[i] << " ";curr = V[i];}os << V.size() - 1 << ":" << V.back();}os << "]\n";return os;}template<typename T, typename U>ostream& operator<<(ostream& os, const pair<T, U> P){os << "(";os << P.first << "," << P.second;os << ")";return os;}template<typename T, typename U>ostream& operator<<(ostream& os, const set<T, U> V){os << "{";if(!V.empty()){auto it = V.begin();for(int i = 0; i < V.size() - 1; ++i){os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template<typename K, typename H, typename P>ostream& operator<<(ostream& os, const unordered_set<K, H, P> V){os << "{";if(!V.empty()){auto it = V.begin();for(int i = 0; i < V.size() - 1; ++i){os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template<typename K, typename C>ostream& operator<<(ostream& os, const multiset<K, C> V){os << "{";if(!V.empty()){auto it = V.begin();for(int i = 0; i < V.size() - 1; ++i){os << *it << " ";it++;}os << *it;}os << "}";return os;}template<typename K, typename T, typename C>ostream& operator<<(ostream& os, const map<K, T, C> V){os << "{";if(!V.empty()){auto it = V.begin();for(int i = 0; i < V.size() - 1; ++i){os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template<typename K, typename T, typename C>ostream& operator<<(ostream& os, const unordered_map<K, T, C> V){os << "{";if(!V.empty()){auto it = V.begin();for(int i = 0; i < V.size() - 1; ++i){os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template<typename T>ostream& operator<<(ostream& os, const deque<T> V){os << "[";if(!V.empty()){for(int i = 0; i < V.size() - 1; ++i){os << V[i] << "->";}if(!V.empty())os << V.back();}os << "]\n";return os;};template<typename T, typename Cont, typename Comp>ostream& operator<<(ostream& os, const priority_queue<T, Cont, Comp> V){priority_queue<T, Cont, Comp> _V = V;os << "[";if(!_V.empty()){while(_V.size() > 1){os << _V.top() << "->";_V.pop();}os << _V.top();}os << "]\n";return os;};template<class F>struct y_combinator{F f; // the lambda will be stored here// a forwarding operator():template<class... Args>decltype(auto) operator()(Args&& ... args) const{// we pass ourselves to f, then the arguments.// the lambda should take the first argument as `auto&& recurse` or similar.return f(*this, std::forward<Args>(args)...);}};// helper function that deduces the type of the lambda:template<class F>y_combinator<std::decay_t<F>> recursive(F&& f){return {std::forward<F>(f)};}struct hash_pair{template<class T1, class T2>size_t operator()(const pair<T1, T2>& p) const{auto hash1 = hash<T1>{}(p.first);auto hash2 = hash<T2>{}(p.second);return hash1^hash2;}};template<typename U>auto vec(int n, U v){return std::vector(n, v);}template<typename... Args>auto vec(int n, Args... args){auto val = vec(std::forward<Args>(args)...);return std::vector<decltype(val)>(n, std::move(val));}template<typename T>auto vec(int n){return std::vector<T>(n);}const double PI = 2*acos(.0);const int INF = 0x3f3f3f3f;template<class T>inline T ceil(T a, T b){return (a + b - 1)/b;}inline long long popcount(ll x){return __builtin_popcountll(x);}class No1285{public:void solve(std::istream&, std::ostream&, std::ostream&);};void No1285::solve(std::istream& cin, std::ostream& cout, std::ostream& cerr){int N;cin >> N;VI a(N);cin >> a;sort(ALL(a));if([&](){REP(i,N-1)if(a[i]+1==a[i+1])return 1;return 0;}())print(2);else print(1);}#undef intint main() {No1285 solver;std::istream& in(std::cin);std::ostream& out(std::cout);std::ostringstream err;in.tie(0); ios::sync_with_stdio(0);solver.solve(in, out,err);return 0;}