oj.uz

Submission #555453

# Submission time Handle Problem Language Result Execution time Memory
555453 2022-05-01T01:09:02 Z SmolBrain Lozinke (COCI17_lozinke) C++17
100 / 100
 206 ms 14300 KB 
// Om Namah Shivaya
// GM in 93 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
const int p = 31;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<string> a(n);
    rep(i, n) cin >> a[i];

    auto comp = [&](string s1, string s2) {
        return sz(s1) > sz(s2);
    };

    sort(all(a), comp);
    map<ll, ll> mp1, mp2;

    ll ans = 0;

    rep(i, n) {
        string &s = a[i];
        ll siz = sz(s);
        ll hash = 0;

        rep(j, siz) {
            hash *= p;
            hash += (s[j] - 'a' + 1);
        }

        ans += mp1[hash];

        set<ll> hashes;

        rep(j, siz) {
            hash = 0;

            for (int k = j; k < siz; ++k) {
                hash *= p;
                hash += (s[k] - 'a' + 1);

                int len = k - j + 1;

                if (len == siz) {
                    mp2[hash]++;
                }
                else {
                    hashes.insert(hash);
                }
            }
        }

        trav(x, hashes) mp1[x]++;
    }

    trav(p, mp2) ans += (p.ss * (p.ss - 1));
    cout << ans << endl;
}

int main()
{
    chrono::steady_clock::time_point begin = chrono::steady_clock::now();

    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    chrono::steady_clock::time_point end = chrono::steady_clock::now();
    cerr << "[Finished in " << chrono::duration_cast<chrono::microseconds>(end - begin).count() / 1000 << "ms]" << endl;

    return 0;
}

Compilation message

lozinke.cpp: In function 'void usaco(std::string)':
lozinke.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lozinke.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 320 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 9 ms 1364 KB Output is correct
8 Correct 16 ms 1932 KB Output is correct
9 Correct 34 ms 2380 KB Output is correct
10 Correct 81 ms 6560 KB Output is correct
11 Correct 62 ms 4144 KB Output is correct
12 Correct 204 ms 14156 KB Output is correct
13 Correct 96 ms 3304 KB Output is correct
14 Correct 147 ms 13228 KB Output is correct
15 Correct 206 ms 14300 KB Output is correct
16 Correct 90 ms 1456 KB Output is correct
17 Correct 23 ms 1076 KB Output is correct
18 Correct 19 ms 1120 KB Output is correct
19 Correct 121 ms 7852 KB Output is correct
20 Correct 45 ms 1388 KB Output is correct