結果

問題 No.406 鴨等間隔の法則
ユーザー koyumeishi
提出日時 2016-08-05 22:26:20
言語 C++14
(gcc 8.2.0)
結果
AC  
実行時間 65 ms
コード長 6,506 Byte
コンパイル時間 867 ms
使用メモリ 1,820 KB
最終ジャッジ日時 2018-10-18 20:44:14

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample_01.txt AC 3 ms
1,524 KB
sample_02.txt AC 3 ms
1,524 KB
sample_03.txt AC 3 ms
1,512 KB
system_test1.txt AC 58 ms
1,820 KB
system_test2.txt AC 23 ms
1,552 KB
system_test3.txt AC 24 ms
1,556 KB
system_test4.txt AC 25 ms
1,552 KB
system_test5.txt AC 57 ms
1,816 KB
system_test6.txt AC 63 ms
1,820 KB
system_test7.txt AC 28 ms
1,552 KB
system_test8.txt AC 50 ms
1,556 KB
system_test9.txt AC 32 ms
1,552 KB
system_test10.txt AC 31 ms
1,556 KB
system_test11.txt AC 53 ms
1,552 KB
test_a_small_01.txt AC 6 ms
1,536 KB
test_a_small_02.txt AC 7 ms
1,556 KB
test_a_small_03.txt AC 5 ms
1,540 KB
test_a_small_04.txt AC 7 ms
1,560 KB
test_a_small_05.txt AC 8 ms
1,556 KB
test_b_medium_01.txt AC 10 ms
1,576 KB
test_b_medium_02.txt AC 11 ms
1,580 KB
test_b_medium_03.txt AC 17 ms
1,616 KB
test_b_medium_04.txt AC 35 ms
1,552 KB
test_b_medium_05.txt AC 47 ms
1,552 KB
test_c_large_01.txt AC 63 ms
1,820 KB
test_c_large_02.txt AC 65 ms
1,816 KB
test_c_large_03.txt AC 58 ms
1,816 KB
test_c_large_04.txt AC 57 ms
1,820 KB
test_c_large_05.txt AC 64 ms
1,820 KB
test_c_large_06.txt AC 64 ms
1,816 KB
test_c_large_07.txt AC 60 ms
1,816 KB
テストケース一括ダウンロード

ソースコード

diff #
/*
                                                                                
                                   ### #                                        
                              ############# #                                   
                          #######################                               
                     ################################                           
                 #########################################                      
              ##############################################                    
             #     #####################################     #                  
            ######     ############################     ######                  
            ###########     ###################   # ##########                  
            ################    #########      ###############                  
            ####################        # ####################                  
            #######   ##############  ########################                  
            ########       #########  ########################                  
            ###########      #######  ########################                  
            ############## # #######  ########################                  
            ########################  ########################                  
            ########################  ########################                  
            ########################  ########################                  
              ######################  #######################                   
                 ###################  ###################                       
                      ##############  ###############                           
                          ##########  ##########                                
                              ######  ######                                    
                                  ##  ##                                        
                                                                                
                                                                                
                                                                                
                        #                             #                         
                        #      #                      #                         
        #    #  #    #  #   #      ####   ####     ####   ####   ####           
         #   #  #    #  # ##   #  #      #    #  #    #  #____#  ##             
          # #/  #    #  ## #   #  #      #    #  #    #  #^^^^   #              
           ##    ###/#  #   #  #   ####   ####    ###/#   ####   #              
           #                                                                    
         ##                                                                     
                                                                                
*/

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{
    long long start_, end_, step_;
   public:
    struct range_iterator{
      long long val, step_;
      range_iterator(long long v, long long step) : val(v), step_(step) {}
      long long operator * (){return val;}
      void operator ++ (){val += step_;}
      bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
    };
    range(long long len) : start_(0), end_(len), step_(1) {}
    range(long long start, long long end) : start_(start), end_(end), step_(1) {}
    range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
    range_iterator begin(){ return range_iterator(start_, step_); }
    range_iterator   end(){ return range_iterator(  end_, step_); }
  };

  string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){
    stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
  }

  string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }

}

constexpr long long mod = 9_ten + 7;

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  sort(a.begin(), a.end());
  a.erase( unique(a.begin(), a.end()), a.end());
  if(a.size() != n){
    println("NO");
    return 0;
  }

  int d = a[1] - a[0];
  for(int i=1; i<n; i++){
    if(a[i] - a[i-1] != d){
      println("NO");
      return 0;
    }
  }
  println("YES");
  return 0;
}
0