# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742529 | Stickfish | Cubeword (CEOI19_cubeword) | C++17 | 226 ms | 10472 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cassert>
using namespace std;
using ll = long long;
const int MAXV = 63;
const ll MOD = 998244353;
ll f[MAXV][MAXV];
ll cnt_repeat[8];
ll dp[MAXV][MAXV][MAXV];
int to_int(char c) {
if ('a' <= c && c <= 'z')
return c - 'a';
if ('A' <= c && c <= 'Z')
return c - 'A' + 26;
return c - '0' + 52;
}
void get_edg(vector<string> v) {
for (int p = 0; p < MAXV; ++p) {
for (int q = 0; q < MAXV; ++q) {
f[p][q] = 0;
}
}
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
# | 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... |