# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594054 | penguinhacker | Cubeword (CEOI19_cubeword) | C++17 | 220 ms | 9260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e5, K=62, M=998244353;
int n;
string s[mxN];
ll cnt[K][K], dp[K][K][K];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i)
cin >> s[i];
ll ans=0;
for (int i=3; i<=10; ++i) {
set<string> st;
for (int j=0; j<n; ++j)
if (s[j].size()==i)
for (int rep=0; rep<2; ++rep) {
st.insert(s[j]);
reverse(s[j].begin(), s[j].end());
}
memset(cnt, 0, sizeof(cnt));
for (string x : st) {
int a='a'<=x[0]&&x[0]<='z'?x[0]-'a':'A'<=x[0]&&x[0]<='Z'?26+x[0]-'A':52+x[0]-'0';
int b='a'<=x.back()&&x.back()<='z'?x.back()-'a':'A'<=x.back()&&x.back()<='Z'?26+x.back()-'A':52+x.back()-'0';
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |