#748844 (C++17) No.1884 Sequence

• 問題: No.1884 Sequence
• ユーザー: harurun
• 提出日時: 2022-03-25 23:03:44
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 3,117 bytes
• コンパイル時間: 3,386 ms
• コンパイル使用メモリ: 176,684 KB
• 最終ジャッジ日時: 2025-01-28 12:30:40
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 35 WA * 5

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <queue>
#include <string>
#include <iomanip>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <stdio.h>
#include <math.h>
#include <assert.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll=long long;
long long gcd(long long x,long long y){
  long long tmp;
  while(y!=0){
    tmp=y;
    y=x%y;
    x=tmp;
  }
  return x;
}
int main(){
  ll N;
  cin>>N;
  vector<ll>A(N);
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  ll cnt=0;
  vector<ll> B;
  B.reserve(N);
  for(int i=0;i<N;i++){
    if(A[i]==0){
      cnt++;
    }else{
      B.emplace_back(A[i]);
    }
  }
  sort(B.begin(),B.end());
  ll sa=0;
  for(int i=0;i<(int)B.size()-1;i++){
    sa=gcd(sa,B[i+1]-B[i]);
  }
  if(sa==0){
    for(ll i:B){
      if(i!=B[0]){
        sa=1000000000000000LL;
        for(int i=0;i<(int)B.size()-1;i++){
          sa=min(sa,B[i+1]-B[i]);
        }
        if(sa==0){
          for(ll i:B){
            if(i!=B[0]){
              cout<<"No"<<endl;
              return 0;
            }
          }
          cout<<"Yes"<<endl;
          return 0;
        }
        ll must=0;
        for(int i=0;i<(int)B.size()-1;i++){
          if((B[i+1]-B[i])%sa){
            cout<<"No"<<endl;
            return 0;
          }
          must+=(B[i+1]-B[i])/sa-1;
        }
        //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
        if(must>cnt){
          cout<<"No"<<endl;
        }else{
          cout<<"Yes"<<endl;
        }
        return 0;
      }
    }
    cout<<"Yes"<<endl;
    return 0;
  }
  ll must=0;
  for(int i=0;i<(int)B.size()-1;i++){
    if((B[i+1]-B[i])%sa){
      sa=1000000000000000LL;
      for(int i=0;i<(int)B.size()-1;i++){
        sa=min(sa,B[i+1]-B[i]);
      }
      if(sa==0){
        for(ll i:B){
          if(i!=B[0]){
            cout<<"No"<<endl;
            return 0;
          }
        }
        cout<<"Yes"<<endl;
        return 0;
      }
      ll must=0;
      for(int i=0;i<(int)B.size()-1;i++){
        if((B[i+1]-B[i])%sa){
          cout<<"No"<<endl;
          return 0;
        }
        must+=(B[i+1]-B[i])/sa-1;
      }
      //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
      if(must>cnt){
        cout<<"No"<<endl;
      }else{
        cout<<"Yes"<<endl;
      }
      return 0;
    }
    must+=(B[i+1]-B[i])/sa-1;
  }
  //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
  if(must>cnt){
    sa=1000000000000000LL;
    for(int i=0;i<(int)B.size()-1;i++){
      sa=min(sa,B[i+1]-B[i]);
    }
    if(sa==0){
      for(ll i:B){
        if(i!=B[0]){
          cout<<"No"<<endl;
          return 0;
        }
      }
      cout<<"Yes"<<endl;
      return 0;
    }
    ll must=0;
    for(int i=0;i<(int)B.size()-1;i++){
      if((B[i+1]-B[i])%sa){
        cout<<"No"<<endl;
        return 0;
      }
      must+=(B[i+1]-B[i])/sa-1;
    }
    //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
    if(must>cnt){
      cout<<"No"<<endl;
    }else{
      cout<<"Yes"<<endl;
    }
  }else{
    cout<<"Yes"<<endl;
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX