| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1275452 | chanhchuong123 | Lozinke (COCI17_lozinke) | C++20 | 495 ms | 17080 KiB | 
#include<bits/stdc++.h>
using namespace std;
const bool multiTest = false;
#define task "C"
#define fi first
#define se second
#define MASK(i) (1LL << (i))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define BIT(mask, i) ((mask) >> (i) & 1)
template<typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) a = b; else return 0; return 1;
}
template<typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) a = b; else return 0; return 1;
}
const int MAX = 20020;
int n;
string s[MAX];
map<string, int> myMap;
void process(void) {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
    }
    int ans = 0;
    for (int _ = 0; _ < 2; ++_) {
        for (int i = 1; i <= n; ++i) {
            vector<string> temp;
            for (int l = 0; l < int(s[i].size()); ++l) {
                string cur = "";
                for (int r = l; r < int(s[i].size()); ++r) {
                    cur += s[i][r];
                    temp.push_back(cur);
                }
            }
            sort(all(temp));
            temp.resize(unique(all(temp)) - temp.begin());
            for (string &s: temp) {
                ans += myMap[s];
            }
            ++myMap[s[i]];
        }
        reverse(s + 1, s + 1 + n);
        myMap.clear();
    }
    cout << ans;
}
int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	if (fopen(task".inp", "r")) {
		freopen(task".inp", "r",  stdin);
		freopen(task".out", "w", stdout);
	}
	int nTest = 1; if (multiTest) cin >> nTest;
	while (nTest--) {
		process();
	}
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
