結果

問題 No.1692 Expectations
ユーザー ninoinuininoinui
提出日時 2021-12-26 11:53:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 3,368 bytes
コンパイル時間 2,125 ms
コンパイル使用メモリ 208,484 KB
実行使用メモリ 14,080 KB
最終ジャッジ日時 2024-09-22 19:08:41
合計ジャッジ時間 3,307 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 19 ms
5,376 KB
testcase_11 AC 20 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 7 ms
5,376 KB
testcase_15 AC 65 ms
9,728 KB
testcase_16 AC 8 ms
5,376 KB
testcase_17 AC 32 ms
7,040 KB
testcase_18 AC 14 ms
5,376 KB
testcase_19 AC 76 ms
10,752 KB
testcase_20 AC 63 ms
12,544 KB
testcase_21 AC 75 ms
14,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#ifndef _DEBUG
#define _DEBUG
#include __FILE__

int main() {
    long N, M;
    cin >> N >> M;
    vector<long> A(N);
    for (auto&& a : A) cin >> a;

    set<long> SE;
    for (const auto& a : A) SE.insert(a);

    cout << (int)SE.size() << " " << ((int)SE.size() == 1 && N == M ? 1 : 0) << '\n';
}

#else
// #undef _DEBUG
#include <bits/stdc++.h>
using namespace std;

template <typename T, typename T2>
bool cmin(T& a, const T2& b) {
    return a > b ? a = b, true : false;
}

template <typename T, typename T2>
bool cmax(T& a, const T2& b) {
    return a < b ? a = b, true : false;
}

__attribute__((constructor)) void ios_setup() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec);

template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T> >& vec);

template <typename T>
ostream& operator<<(ostream& os, const vector<vector<vector<T> > >& vec);

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template <typename A, typename B, typename C>
ostream& operator<<(ostream& os, const tuple<A, B, C>& t) {
    const auto& [a, b, c] = t;
    return os << "(" << a << ", " << b << ", " << c << ")";
}

template <typename A, typename B, typename C, typename D>
ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t) {
    const auto& [a, b, c, d] = t;
    return os << "(" << a << ", " << b << ", " << c << ", " << d << ")";
}

template <typename T>
ostream& operator<<(ostream& os, priority_queue<T> pq) {
    os << "{";
    while (!pq.empty()) os << pq.top() << (pq.size() > 1 ? " " : ""), pq.pop();
    return os << "}";
}

#define FOREACH(it, a) for (auto it = (a).begin(); it != (a).end(); it++)

template <typename T>
ostream& operator<<(ostream& os, const set<T>& se) {
    os << "{";
    FOREACH (it, se) { os << (it == se.begin() ? "" : " ") << *it; }
    return os << "}";
}

template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& ms) {
    os << "{";
    FOREACH (it, ms) { os << (it == ms.begin() ? "" : " ") << *it; }
    return os << "}";
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& ma) {
    os << "{";
    FOREACH (it, ma) { os << (it == ma.begin() ? "" : " ") << *it; }
    return os << "}";
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "{";
    FOREACH (it, vec) { os << (it == vec.begin() ? "" : " ") << *it; }
    return os << "}";
}

template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T> >& vec) {
    os << "{\n";
    FOREACH (it, vec) { os << (it == vec.begin() ? " " : "\n ") << *it; }
    return os << "\n}";
}

template <typename T>
ostream& operator<<(ostream& os, const vector<vector<vector<T> > >& vec) {
    os << "{\n";
    FOREACH (it, vec) {
        os << (it == vec.begin() ? "" : "\n") << "(" << it - vec.begin() << ") " << *it;
    }
    return os << "\n}";
}

void dump() {}
template <typename Head, typename... Tail>
void dump(const Head& head, const Tail&... tail) {
    cout << head << (sizeof...(tail) ? ", " : "\n"), dump(tail...);
}

#ifdef _DEBUG
#define DUMP(...) cout << "[" << (#__VA_ARGS__) << "] ", dump(__VA_ARGS__)
#else
#define DUMP(...) (void)0
#endif

#endif
0