oj.uz

Submission #1030424

# Submission time Handle Problem Language Result Execution time Memory
1030424 2024-07-22T05:00:53 Z caterpillow Savez (COCI15_savez) C++17
108 / 120
 47 ms 14308 KB 
#include <bits/stdc++.h>

using namespace std;

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

/*

if a < b and b < c, then a < c
use string hashing

*/

const int m = 27;
const ll mod = 2e6 + 7;

ll powm(ll y) {
    ll x = m;
    ll res = 1;
    while (y) {
        if (y & 1) res = (res * x) % mod;
        y >>= 1; 
        x = (x * x) % mod;
    }
    return res;
}

int n;
vt<int> dp;

void push_back(pl& hash, int c) {
    hash = {(hash.f * m + c + 1) % mod, hash.s + 1};
}

void push_front(pl& hash, int c) {
    hash = {(powm(hash.s) * (c + 1) + hash.f) % mod, hash.s + 1};
}

const pl hid = {0, 0};

int arr[mod];

main() {
    cin.tie(0)->sync_with_stdio(0);

    memset(arr, -1, sizeof(arr));

    cin >> n;
    dp.resize(n, 1);
    F0R (i, n) {
        pl lhs = hid, rhs = hid;
        string st; cin >> st;
        F0R (j, size(st)) {
            push_back(lhs, st[j] - 'A');
            push_front(rhs, st[size(st) - j - 1] - 'A');
            if (lhs.f == rhs.f) {
                if (arr[lhs.f] != -1) {
                    dp[i] = max(dp[arr[lhs.f]] + 1, dp[i]);
                }
            }
        }
        arr[lhs.f] = i;
    }
    cout << *max_element(all(dp)) << endl;
}

Compilation message

savez.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   58 | main() {
      | ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 8284 KB Output is correct
2 Correct 41 ms 8284 KB Output is correct
3 Correct 42 ms 8284 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8280 KB Output is correct
2 Correct 43 ms 8320 KB Output is correct
3 Incorrect 45 ms 8324 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 8280 KB Output is correct
2 Correct 30 ms 8284 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 8248 KB Output is correct
2 Correct 20 ms 8284 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 8284 KB Output is correct
2 Correct 19 ms 8284 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8540 KB Output is correct
2 Correct 21 ms 8540 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 9048 KB Output is correct
2 Correct 22 ms 9052 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 9820 KB Output is correct
2 Correct 25 ms 9820 KB Output is correct
3 Correct 47 ms 14308 KB Output is correct