Submission #30922282
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define STRINGIFY(n) #n
#define TOSTRING(n) STRINGIFY(n)
#define PREFIX "#" TOSTRING(__LINE__) "| "
#define debug(x) \
{ \
std::cout << PREFIX << #x << " = " << x << std::endl; \
}
std::ostream& output_indent(std::ostream& os, int ind) {
for(int i = 0; i < ind; i++) os << " ";
return os;
}
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p);
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
return (os << "(" << p.first << ", " << p.second << ")");
}
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
os << "[";
for(int i = 0;i < v.size();i++) os << v[i] << ", ";
return (os << "]");
}
template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) { return std::vector<T>(n, std::forward<T>(val)); }
template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}
#include <iostream>
using i64 = long long;
template<i64 M> struct modint { i64 a;
constexpr modint(const i64 x = 0): a((x%M+M)%M){}
constexpr i64 value() const { return a; }
constexpr modint inv() const { return this->pow(M-2); }
constexpr modint pow(i64 r) const {
modint ans(1); modint aa = *this;
while(r) { if(r & 1) ans *= aa; aa *= aa; r >>= 1; }
return ans;
}
constexpr bool operator==(const modint& r) const { return a == r.a; }
constexpr bool operator!=(const modint& r) const { return a != r.a; }
constexpr modint& operator=(const i64 r) { a = (r % M + M) % M; return *this; }
constexpr modint& operator+=(const modint r) { a += r.a; if(a >= M) a -= M; return *this; }
constexpr modint& operator-=(const modint r) { a -= r.a; if(a < 0) a += M; return *this; }
constexpr modint& operator*=(const modint r) { a = a * r.a % M; return *this; }
constexpr modint& operator/=(const modint r) { (*this) *= r.inv(); return *this; }
constexpr modint operator+(const modint r) const { return modint(*this) += r; }
constexpr modint operator-(const modint r) const { return modint(*this) -= r; }
constexpr modint operator-() const { return modint(0) - modint(*this); }
constexpr modint operator*(const modint r) const { return modint(*this) *= r; }
constexpr modint operator/(const modint r) const { return modint(*this) /= r; }
constexpr bool operator!=(const modint r) const { return this->value() != r.value(); }
};
template<const i64 M> std::ostream& operator<<(std::ostream& os, const modint<M>& m) { os << m.value(); return os; }
using fp = modint<(i64)(1e9+7)>;
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> A(N);
rep(i,0,N) {
cin >> A[i];
A[i]++;
}
vector<fp> dp(K + 1);
dp[0] = 1;
rep(i,0,N) {
for(i64 j = K + 1; j --> A[i];) {
dp[j] -= dp[j - A[i]];
}
}
rep(i,0,N) {
rep(j,1,K + 1) {
dp[j] += dp[j - 1];
}
}
cout << dp[K] << endl;
}
Submission Info
| Submission Time |
|
| Task |
M - Candies |
| User |
niuez |
| Language |
C++ (GCC 9.2.1) |
| Score |
100 |
| Code Size |
3327 Byte |
| Status |
AC |
| Exec Time |
34 ms |
| Memory |
3976 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
| ^
./Main.cpp:67:3: note: in expansion of macro ‘rep’
67 | rep(i,0,N) {
| ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
| ^
./Main.cpp:73:3: note: in expansion of macro ‘rep’
73 | rep(i,0,N) {
| ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
| ^
./Main.cpp:78:3: note: in expansion of macro ‘rep’
78 | rep(i,0,N) {
| ^~~
./Main.cpp:4:28: warning: unnecessary parentheses in declaration of ‘j’ [-Wparentheses]
4 | #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
| ^
./Main.cpp:79:5: note: in expansion of macro ‘rep’
79 | rep(j,1,K + 1) {
| ^~~
Judge Result
| Set Name |
All |
| Score / Max Score |
100 / 100 |
| Status |
|
| Set Name |
Test Cases |
| All |
0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11 |
| Case Name |
Status |
Exec Time |
Memory |
| 0_00 |
AC |
6 ms |
3512 KiB |
| 0_01 |
AC |
2 ms |
3468 KiB |
| 0_02 |
AC |
2 ms |
3384 KiB |
| 0_03 |
AC |
6 ms |
3948 KiB |
| 1_00 |
AC |
3 ms |
3388 KiB |
| 1_01 |
AC |
4 ms |
3880 KiB |
| 1_02 |
AC |
2 ms |
3604 KiB |
| 1_03 |
AC |
32 ms |
3876 KiB |
| 1_04 |
AC |
31 ms |
3964 KiB |
| 1_05 |
AC |
34 ms |
3944 KiB |
| 1_06 |
AC |
32 ms |
3820 KiB |
| 1_07 |
AC |
32 ms |
3848 KiB |
| 1_08 |
AC |
30 ms |
3792 KiB |
| 1_09 |
AC |
29 ms |
3936 KiB |
| 1_10 |
AC |
29 ms |
3976 KiB |
| 1_11 |
AC |
34 ms |
3900 KiB |