제출 #249554

#제출 시각아이디문제언어결과실행 시간메모리
249554ne4eHbKaKlavir (COCI17_klavir)C++17
0 / 160
64 ms12024 KiB
//{ <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 < n; ++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; } int u = m_bpow(n, md - 2); clr(f, 0); clr(fw, 0); int S {}, s, v; for(int i = 0; i < n; ++i) { if(i) { memset(t, 0, n << 2); s = 0, v = n - 1; t[a[i]] = i + 1; for(int j = p[i - 1]; j; j = p[j - 1]) { if(t[a[j]]) continue; t[a[j]] = j + 1; m_add(s, fget(j + 1)); --v; } if(!t[a[0]]) { t[a[0]] = 1; m_add(s, fget(1)); --v; } m_add(s, m_prod(v, S)); } else { s = 0; } m_add(s, n); f[i] = s; fupd(i, f[i]); m_add(S, f[i]); } for(int i = 1; i < n; ++i) m_add(f[i], f[i - 1]); fo(n) 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; }

컴파일 시 표준 에러 (stderr) 메시지

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) {
                       ~~~^~~~~~~~~~~~~~~~~~~~
klavir.cpp: In function 'void solve()':
klavir.cpp:83:9: warning: unused variable 'u' [-Wunused-variable]
     int u = m_bpow(n, md - 2);
         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...