Submission #1184994
Source Code Expand
/*** Template Begin ***/
#define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto init_ = [] {
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed;
return 0;
}();
template <typename T>
inline T in() {
T x;
std::cin >> x;
return x;
}
template <typename T>
inline void in(T &x) {
std::cin >> x;
}
template <typename T, typename... Ts>
inline void in(T &t, Ts &... ts) {
std::cin >> t;
in(ts...);
}
template <typename T, typename U = std::vector<T>>
inline U vin(int n) {
U v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
return v;
}
template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
V vv(h, U(w));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cin >> vv[i][j];
}
}
return vv;
}
template <typename T>
inline void out(const T &x) {
std::cout << x << std::endl;
}
template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &... ts) {
std::cout << t << delimiter;
out(ts...);
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
for (int i = 0; i < n; ++i) {
if (i) std::cout << delimiter;
std::cout << v[i];
}
std::cout << std::endl;
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j) std::cout << delimiter;
std::cout << v[i][j];
}
std::cout << std::endl;
}
}
template <typename T, size_t D>
struct multi_vector_type {
using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};
template <typename T>
struct multi_vector_type<T, 1> {
using type = std::vector<T>;
};
template <typename T>
struct multi_vector_type<T, 0> {
using type = T;
};
template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;
template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
return val;
}
template <typename T, size_t D = 1, typename... Ts,
class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&... args) {
return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}
namespace detail {
template <typename F>
struct Debug {
const char *delim_ = "\n";
F fun;
Debug(F f) : fun(f) {}
~Debug() { fun(delim_); }
Debug &delim(const char *d) {
delim_ = d;
return *this;
}
};
std::deque<std::string> split(const std::string &s, char c) {
std::deque<std::string> v;
std::stringstream ss(s);
std::string x;
while (std::getline(ss, x, c)) v.emplace_back(x);
return v;
}
template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< '\n';
std::cerr << std::flush;
}
template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< delim;
v.pop_front();
deb(delim, std::move(v), args...);
}
template <typename... Args>
auto wrap(std::deque<std::string> v, Args... args) {
auto f = [=](const char *delim = "\n") { deb(delim, v, args...); };
return Debug<decltype(f)>(f);
}
}
#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)
#ifdef USING_BOOST
#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>
inline auto rep(int begin, int end) {
if (begin > end) {
return boost::irange(0, 0);
} else {
return boost::irange(begin, end);
}
}
inline auto rep(int begin, int end, int step) {
if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
return boost::irange(0, 0, step);
} else {
return boost::irange(begin, end, step);
}
}
#endif
#ifdef USING_NAMESPACE
using namespace std;
#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif
/*** Template End ***/
int64_t dp[5001], sum[5001];
int main() {
int n, m;
in(n, m);
auto a = vin<int>(n);
constexpr int mod = 1e9 + 7;
dp[0] = 1;
sum[0] = 1;
int l = -1;
set<int> s;
for (int i : rep(0, n)) {
while (s.count(a[i])) {
l++;
s.erase(a[l]);
}
s.insert(a[i]);
dp[i + 1] = (sum[i] - (l >= 0) * sum[l]) % mod;
sum[i + 1] = (sum[i] + dp[i + 1]) % mod;
}
out(dp[n] % mod);
}
Submission Info
Submission Time |
|
Task |
D - サプリメント |
User |
mino |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
5659 Byte |
Status |
RE |
Exec Time |
107 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
1 ms |
256 KB |
subtask0-sample02.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
WA |
2 ms |
256 KB |
subtask1-02.txt |
AC |
2 ms |
256 KB |
subtask1-03.txt |
WA |
2 ms |
256 KB |
subtask1-04.txt |
WA |
2 ms |
384 KB |
subtask1-05.txt |
WA |
2 ms |
384 KB |
subtask1-06.txt |
WA |
2 ms |
384 KB |
subtask1-07.txt |
AC |
2 ms |
384 KB |
subtask1-08.txt |
WA |
2 ms |
384 KB |
subtask1-09.txt |
AC |
2 ms |
384 KB |
subtask1-10.txt |
WA |
2 ms |
384 KB |
subtask1-11.txt |
AC |
2 ms |
384 KB |
subtask1-12.txt |
WA |
3 ms |
384 KB |
subtask1-13.txt |
WA |
3 ms |
384 KB |
subtask1-14.txt |
WA |
3 ms |
384 KB |
subtask1-15.txt |
WA |
2 ms |
384 KB |
subtask1-16.txt |
WA |
2 ms |
384 KB |
subtask1-17.txt |
WA |
3 ms |
384 KB |
subtask1-18.txt |
AC |
2 ms |
640 KB |
subtask1-19.txt |
AC |
2 ms |
384 KB |
subtask1-20.txt |
WA |
2 ms |
384 KB |
subtask2-01.txt |
RE |
100 ms |
384 KB |
subtask2-02.txt |
RE |
104 ms |
512 KB |
subtask2-03.txt |
RE |
103 ms |
640 KB |
subtask2-04.txt |
RE |
104 ms |
896 KB |
subtask2-05.txt |
RE |
103 ms |
768 KB |
subtask2-06.txt |
RE |
103 ms |
768 KB |
subtask2-07.txt |
RE |
105 ms |
768 KB |
subtask2-08.txt |
RE |
107 ms |
768 KB |
subtask2-09.txt |
RE |
105 ms |
768 KB |
subtask2-10.txt |
RE |
107 ms |
768 KB |
subtask2-11.txt |
RE |
105 ms |
768 KB |
subtask2-12.txt |
RE |
106 ms |
768 KB |
subtask2-13.txt |
RE |
107 ms |
768 KB |
subtask2-14.txt |
RE |
106 ms |
768 KB |
subtask2-15.txt |
RE |
106 ms |
1024 KB |
subtask2-16.txt |
RE |
105 ms |
768 KB |
subtask2-17.txt |
RE |
107 ms |
768 KB |
subtask2-18.txt |
RE |
105 ms |
1024 KB |
subtask2-19.txt |
RE |
106 ms |
768 KB |
subtask2-20.txt |
RE |
107 ms |
1024 KB |