| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 249577 |
2020-07-15T09:56:19 Z |
ne4eHbKa |
Klavir (COCI17_klavir) |
C++17 |
|
1000 ms |
25976 KB |
//{ <defines>
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int M = 1e6 + 5;
const int N = 100;
int n, m;
int a[M], p[M], f[M], fw[M];
int t[N];
int fget(int i) {int v = 0; for(i = M - i - 2; i; i -= i & -i) m_add(v, fw[i]); re v;}
void fupd(int i, int v) {for(i = M - i - 2; i < M; i += i & -i) m_add(fw[i], v);}
void solve() {
md = 1e9 + 7;
cin >> n >> m;
fo(m) cin >> a[i], --a[i];
for(int i = 1; i < m; ++i) {
int j = p[i - 1];
for(; j && a[j] != a[i]; j = p[j - 1]);
if(a[i] == a[j]) ++j;
p[i] = j;
}
clr(f, 0);
clr(fw, 0);
clr(t, -1);
for(int i = 0, S = 0, s; i < m; ++i) {
s = 0;
if(i) {
int v = n - 1;
for(int j = p[i - 1]; j; j = p[j - 1]) {
if(t[a[j]] == i || a[j] == a[i]) continue;
t[a[j]] = i, --v;
m_add(s, fget(j + 1));
}
if(a[0] != a[i] && t[a[0]] < i) {
--v;
m_add(s, m_sum(S, -f[0]));
}
m_add(s, m_prod(v, S));
}
m_add(s, n);
f[i] = s;
fupd(i, f[i]);
m_add(S, f[i]);
}
for(int i = 1; i < m; ++i) m_add(f[i], f[i - 1]);
fo(m) cout << f[i] << '\n';
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
klavir.cpp: In function 'int m_bpow(ll, ll)':
klavir.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
4 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
4 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
4 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
4 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
5 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
5 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
9984 KB |
Output is correct |
| 2 |
Execution timed out |
1076 ms |
16020 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
265 ms |
25976 KB |
Output is correct |
| 2 |
Execution timed out |
1100 ms |
15992 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
262 ms |
25976 KB |
Output is correct |
| 2 |
Execution timed out |
1101 ms |
15992 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
261 ms |
25976 KB |
Output is correct |
| 2 |
Execution timed out |
1099 ms |
17912 KB |
Time limit exceeded |
