-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
130 lines (103 loc) · 2.83 KB
/
Copy pathB.cpp
File metadata and controls
130 lines (103 loc) · 2.83 KB
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
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Modular {
int val;
static int constexpr mod() { return T::value; };
Modular(long long v = 0) {
val = v % mod();
if (val < 0) val += mod();
}
Modular(long long a, long long b) : val(0) {
*this += a;
*this /= b;
}
Modular &operator+=(Modular const &b) {
val += b.val;
if (val >= mod()) val -= mod();
return *this;
}
Modular &operator-=(Modular const &b) {
val -= b.val;
if (val < 0) val += mod();
return *this;
}
Modular &operator*=(Modular const &b) {
val = (long long) val * b.val % mod();
return *this;
}
friend Modular mexp(Modular a, long long e) {
Modular res = 1;
while (e) {
if (e & 1) res *= a;
a *= a;
e >>= 1;
}
return res;
}
friend Modular inverse(Modular a) {
return mexp(a, mod() - 2);
}
Modular &operator/=(Modular const &b) {
return *this *= inverse(b);
}
friend Modular
operator+(Modular a, Modular const b) { return a += b; }
friend Modular
operator-(Modular a, Modular const b) { return a -= b; }
friend Modular operator-(Modular const a) {
return 0 - a;
}
friend Modular
operator*(Modular a, Modular const b) { return a *= b; }
friend Modular
operator/(Modular a, Modular const b) { return a /= b; }
friend Modular operator%(Modular a, Modular const b) {
return a.val %= b.val;
}
friend std::ostream &
operator<<(std::ostream &os, Modular const &a) {
return os << a.val;
}
#define IMPLEMENT_COMPARE_OPERATOR(x) \
friend bool operator x (Modular const& a, Modular const& b) { \
return a.val x b.val; \
}
IMPLEMENT_COMPARE_OPERATOR(<)
IMPLEMENT_COMPARE_OPERATOR(>)
IMPLEMENT_COMPARE_OPERATOR(<=)
IMPLEMENT_COMPARE_OPERATOR(>=)
IMPLEMENT_COMPARE_OPERATOR(==)
IMPLEMENT_COMPARE_OPERATOR(!=)
};
struct VarMod { static int value; };
int VarMod::value;
int& MOD = VarMod::value;
using Mint = Modular<VarMod>;
//int constexpr MOD = 1e9 + 7;
//using Mint = Modular<std::integral_constant<int, MOD>>;
int dp[1010][1010];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (auto &i : a) cin >> i;
if (n >= m) {
cout << "YES\n";
return 0;
}
dp[0][0] = 1;
MOD = m;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < m; j++) {
dp[i][j] = dp[i - 1][j];
Mint last = j;
last -= Mint(a[i - 1]);
dp[i][j] = max(dp[i - 1][last.val] ? dp[i - 1][last.val] + 1 : 0, dp[i][j]);
}
}
cout << (dp[n][0] >= 2 ? "YES" : "NO");
return 0;
}