# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446280 | benedict0724 | Cubeword (CEOI19_cubeword) | C++17 | 432 ms | 27076 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;
typedef long long ll;
ll cnt[62][62][11];
ll Pre[62][62][62][11];
ll ans = 0;
const ll mod = 998244353;
map<string, int> M;
int f(char c)
{
if('a' <= c && c <= 'z') return (int)(c - 'a');
if('A' <= c && c <= 'Z') return (int)(c - 'A' + 26);
return c - '0' + 52;
}
int main()
{
int n; cin >> n;
for(int i=1;i<=n;i++)
{
string s; cin >> s;
string p = s;
reverse(p.begin(), p.end());
if(M[p]) continue;
M[s] = 1;
int t = s.size();
# | 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... |