# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546572 | LucaDantas | Cubeword (CEOI19_cubeword) | C++17 | 1186 ms | 15432 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 16, mod = 998244353; // subtasks 1-2
int ans;
int edge[11][maxn][maxn];
int value_triad[11][maxn][maxn][maxn];
int id(char c) { return c-'a'; } // subtaks 1-2
set<string> mark;
void add(int& a, int b) { a += b; if(a >= mod) a -= mod; }
int main() {
int n; cin >> n;
string s;
for(int i = 0; i < n; i++) {
cin >> s;
for(int rep = 0; rep < 2; rep++, reverse(s.begin(), s.end())) if(!mark.count(s)) {
edge[s.size()][id(s[0])][id(s.back())]++;
mark.insert(s);
}
}
# | 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... |