結果
問題 | No.2126 MEX Game |
ユーザー | shadow9236 |
提出日時 | 2022-11-18 21:35:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,364 bytes |
コンパイル時間 | 2,306 ms |
コンパイル使用メモリ | 212,852 KB |
実行使用メモリ | 8,320 KB |
最終ジャッジ日時 | 2024-09-20 01:59:32 |
合計ジャッジ時間 | 3,362 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 38 ms
6,940 KB |
testcase_11 | AC | 38 ms
6,940 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 36 ms
6,944 KB |
testcase_15 | AC | 37 ms
6,940 KB |
testcase_16 | AC | 38 ms
6,940 KB |
testcase_17 | AC | 18 ms
6,948 KB |
testcase_18 | AC | 20 ms
6,940 KB |
testcase_19 | AC | 7 ms
6,940 KB |
testcase_20 | AC | 8 ms
6,940 KB |
testcase_21 | AC | 44 ms
8,320 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,940 KB |
ソースコード
// हर हर महादेव using namespace std; #include <bits/stdc++.h> #define ll long long int #define ld long double #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count()); #ifdef shivang_ka_laptop #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__); #define booga cerr << "booga" << endl; #else #define debug(...) 42; #define booga 9; #endif template <typename T> std::ostream& operator<<(std::ostream& stream, const vector<T>& vec){ for(size_t i = 0; i < vec.size(); i++){stream << vec[i];if(i != vec.size() - 1)stream << ' ';}; return stream; } template <typename T> std::istream& operator>>(std::istream& stream, vector<T>& vec) { for(T &x : vec)stream >> x;return stream; } template <typename T,typename U> std::ostream& operator<<(std::ostream& stream, const pair<T,U>& pr){ stream << pr.first << ' ' << pr.second; return stream; } template <typename T,typename U> std::istream& operator>>(std::istream& stream, pair<T,U>& pr){ stream >> pr.first >> pr.second; return stream; } template <typename T, typename U> void operator+=(vector<T>& vec, const U value) { for(T &x : vec)x += value; } template <typename T, typename U> void operator-=(vector<T>& vec, const U value) { for(T &x : vec)x -= value; } template <typename T, typename U> void operator*=(vector<T>& vec, const U value) { for(T &x : vec)x *= value; } template <typename T, typename U> void operator/=(vector<T>& vec, const U value) { for(T &x : vec)x /= value; } template <typename T> void operator++(vector<T>& vec) { vec += 1; } template <typename T> void operator++(vector<T>& vec,int) { vec += 1; } template <typename T> void operator--(vector<T>& vec) { vec -= 1; } template <typename T> void operator--(vector<T>& vec,int) { vec -= 1; } template <typename T,typename U, typename V> void operator+=(pair<T,U>& vec, const V value) { vec.first += value;vec.second += value; } template <typename T,typename U, typename V> void operator-=(pair<T,U>& vec, const V value) { vec.first -= value;vec.second -= value; } template <typename T,typename U, typename V> void operator*=(pair<T,U>& vec, const V value) { vec.first *= value;vec.second *= value; } template <typename T,typename U, typename V> void operator/=(pair<T,U>& vec, const V value) { vec.first /= value;vec.second /= value; } template <typename T,typename U> void operator++(pair<T,U>& vec) { vec += 1; } template <typename T,typename U> void operator++(pair<T,U>& vec,int) { vec += 1; } template <typename T,typename U> void operator--(pair<T,U>& vec) { vec -= 1; } template <typename T,typename U> void operator--(pair<T,U>& vec,int) { vec -= 1; } template <typename A, typename B>string to_string(pair<A, B> p); template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return '"' + s + '"'; } string to_string(char c) {string s;s += c;return s; } string to_string(const char* s) {return to_string((string) s); } string to_string(bool b) {return (b ? "1" : "0"); } string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {res += ", ";}first = false;res += to_string(v[i]);}res += "}";return res;} template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) {res += static_cast<char>('0' + v[i]);}return res;} template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;} template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";} template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";} template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";} template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);} void bharo(int N_N) { return; }template <typename Head, typename... Tail>void bharo(int N_N, Head &H, Tail & ... T) {H.resize(N_N);bharo(N_N,T...);} void safai() { return; }template <typename Head, typename... Tail>void safai(Head &H, Tail & ... T) {H.clear();safai(T...);} void testcase(){ int n; cin >> n; vector<int> a(n); map<int,int> freq; for(int i = 0; i < n; i++){ cin >> a[i]; freq[a[i]]++; } int gon = 0; for(int i = 0; i <= n+5; i++){ if(freq[i] >= 2){ gon += 2; continue; } if(freq[i] == 0){ cout << i; return; } gon++; int av = n - gon; cout << i + (av != 0); return; } } int main(){ ios::sync_with_stdio(false); cin.tie(0); int tt = 1; //cin >> tt; while(tt--){ testcase(); } return (0-0); }