oj.uz

Submission #249587

# Submission time Handle Problem Language Result Execution time Memory
249587 2020-07-15T10:16:22 Z ne4eHbKa Klavir (COCI17_klavir) C++17
96 / 160
 1000 ms 22008 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];
int t[N];

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(t, -1);
    for(int i = 0, s; i < m; ++i) {
        f[i] = f[i - 1];
        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, m_sum(f[i], -f[j]));
                if(!v) break;
            }
            if(a[0] != a[i] && t[a[0]] < i)
                --v, m_add(s, m_sum(f[i], -f[0]));
            m_add(s, m_prod(v, f[i]));
        }
        m_add(s, n);
        m_add(f[i], s);
    }
    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) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 2 ms 4224 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4224 KB Output is correct
2 Correct 3 ms 4224 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4224 KB Output is correct
2 Correct 3 ms 4352 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4352 KB Output is correct
2 Correct 2 ms 4224 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 3 ms 4224 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4200 KB Output is correct
2 Correct 3 ms 4224 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 6008 KB Output is correct
2 Execution timed out 1095 ms 12100 KB Time limit exceeded

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 22008 KB Output is correct
2 Execution timed out 1094 ms 12024 KB Time limit exceeded

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 22008 KB Output is correct
2 Execution timed out 1095 ms 12024 KB Time limit exceeded

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 22008 KB Output is correct
2 Execution timed out 1099 ms 12024 KB Time limit exceeded