oj.uz

Submission #1078071

# Submission time Handle Problem Language Result Execution time Memory
1078071 2024-08-27T12:13:18 Z khactrung1912 Lozinke (COCI17_lozinke) C++14
85 / 100
 176 ms 3720 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=2e4+5, mod=1e9+3777;
 
#define ll long long
 
ll n, c[nx][12], sz[nx], res, p[nx], vl[nx];
string s;
map<ll, ll> mp;
 
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    p[0]=1;
    for (int i=1; i<=10; i++) p[i]=(p[i-1]*30)%mod;
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>s;
        sz[i]=s.size();
        for (int j=1; j<=sz[i]; j++) c[i][j]=s[j-1]-'a'+1;
    }
    for (int i=1; i<=n; i++)
    {
        set<ll> s;
        for (int j=1; j<=sz[i]; j++)
        {
            ll tmp=0;
            for (int k=j; k<=sz[i]; k++)
            {
                tmp=(tmp+c[i][k]*p[k-j])%mod;
                s.insert(tmp);
                if (j==1&&k==sz[i]) vl[i]=tmp;
            }
        }
        for (auto x:s) if (mp.find(x)!=mp.end()) res+=mp[x];
        mp[vl[i]]++;
    }
    mp.clear();
    for (int i=n; i>=1; i--)
    {
        set<ll> s;
        for (int j=1; j<=sz[i]; j++)
        {
            ll tmp=0;
            for (int k=j; k<=sz[i]; k++)
            {
                tmp=(tmp+c[i][k]*p[k-j])%mod;
                s.insert(tmp);
            }
        }
        for (auto x:s) if (mp.find(x)!=mp.end()) res+=mp[x];
        mp[vl[i]]++;
    }
    cout<<res;
}

Subtask #1
85.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 472 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 10 ms 604 KB Output is correct
8 Correct 11 ms 808 KB Output is correct
9 Correct 52 ms 1964 KB Output is correct
10 Incorrect 64 ms 2036 KB Output isn't correct
11 Correct 107 ms 2768 KB Output is correct
12 Correct 133 ms 2740 KB Output is correct
13 Correct 144 ms 3380 KB Output is correct
14 Incorrect 176 ms 3720 KB Output isn't correct
15 Incorrect 144 ms 3468 KB Output isn't correct
16 Correct 116 ms 2896 KB Output is correct
17 Correct 26 ms 2652 KB Output is correct
18 Correct 22 ms 2652 KB Output is correct
19 Correct 143 ms 3444 KB Output is correct
20 Correct 82 ms 2896 KB Output is correct