oj.uz

답안 #252764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252764 2020-07-26T08:50:39 Z kartel Savez (COCI15_savez) C++14
96 / 120
 572 ms 65540 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +2000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int st[N], n, i, ans;
map <int, int> f;

int mult(ll x, ll y){return (x * y) % M;}
int sum(ll x, ll y) {return (x + y + M) % M;}

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    map <int, int> hsh[n + 1];
    string s[n + 1];

    st[0] = 1;

    for (i = 1; i <= 2e6; i++)
        st[i] = mult(st[i - 1], 31);

    for (i = 1; i <= n; i++)
        {
            cin >> s[i];
            hsh[i][0] = s[i][0] - 'A' + 1;
            for (int j = 1; j < sz(s[i]); j++)
                hsh[i][j] = sum(hsh[i][j - 1], mult(st[j], s[i][j] - 'A' + 1));
        }

    for (i = 1; i <= n; i++)
    {
        f[hsh[i][sz(s[i]) - 1]]++;

        for (int j = 0; j < sz(s[i]) - 1; j++)
            {
//                cerr << mult(hsh[i][j], st[sz(s[i]) - j - 1]) << " " << sum(hsh[i][sz(s[i]) - 1], -hsh[i][sz(s[i]) - j - 2]) << el;

                if (mult(hsh[i][j], st[sz(s[i]) - j - 1]) == sum(hsh[i][sz(s[i]) - 1], -hsh[i][sz(s[i]) - j - 2]))

                f[hsh[i][sz(s[i]) - 1]] = max(f[hsh[i][j]] + 1, f[hsh[i][sz(s[i]) - 1]]);
            }

        ans = max(ans, f[hsh[i][sz(s[i]) - 1]]);
    }
    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 8320 KB Output is correct
2 Correct 20 ms 8184 KB Output is correct
3 Correct 21 ms 8320 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 8320 KB Output is correct
2 Correct 20 ms 8192 KB Output is correct
3 Correct 39 ms 12024 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 537 ms 56568 KB Output is correct
2 Correct 545 ms 56824 KB Output is correct
3 Correct 572 ms 58108 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 11640 KB Output is correct
2 Correct 392 ms 55260 KB Output is correct
3 Correct 470 ms 57080 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 56664 KB Output is correct
2 Correct 287 ms 57848 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 57592 KB Output is correct
2 Correct 240 ms 57976 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 58792 KB Output is correct
2 Correct 207 ms 59000 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 61944 KB Output is correct
2 Correct 183 ms 62712 KB Output is correct

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 118 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 94 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -