#580500 (C++17) No.406 鴨等間隔の法則

• 問題: No.406 鴨等間隔の法則
• ユーザー: rniya
• 提出日時: 2020-11-15 23:27:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 22 ms / 2,000 ms
• コード長: 2,441 bytes
• コンパイル時間: 2,419 ms
• コンパイル使用メモリ: 204,652 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-23 01:23:22
• 合計ジャッジ時間: 3,875 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	10 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	20 ms; 5,376 KB
testcase_05	AC	8 ms; 5,376 KB
testcase_06	AC	9 ms; 5,376 KB
testcase_07	AC	9 ms; 5,376 KB
testcase_08	AC	20 ms; 5,376 KB
testcase_09	AC	22 ms; 5,376 KB
testcase_10	AC	10 ms; 5,376 KB
testcase_11	AC	17 ms; 5,376 KB
testcase_12	AC	12 ms; 5,376 KB
testcase_13	AC	11 ms; 5,376 KB
testcase_14	AC	18 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	4 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	4 ms; 5,376 KB
testcase_22	AC	6 ms; 5,376 KB
testcase_23	AC	12 ms; 5,376 KB
testcase_24	AC	16 ms; 5,376 KB
testcase_25	AC	21 ms; 5,376 KB
testcase_26	AC	22 ms; 5,376 KB
testcase_27	AC	15 ms; 5,376 KB
testcase_28	AC	15 ms; 5,376 KB
testcase_29	AC	22 ms; 5,376 KB
testcase_30	AC	22 ms; 5,376 KB
testcase_31	AC	21 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1000000007;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N; cin >> N;
    vector<int> x(N);
    for (int i=0;i<N;++i) cin >> x[i];

    sort(x.begin(),x.end());
    for (int i=0;i<N-1;++i){
        if (x[i+1]==x[i]||x[i+1]-x[i]!=x[1]-x[0]){
            cout << "NO" << '\n';
            return 0;
        }
    }

    cout << "YES" << '\n';
}