# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703956 | LittleCube | Cubeword (CEOI19_cubeword) | C++14 | 242 ms | 9040 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,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
const int C = 62;
const ll mod = 998'244'353;
int N;
vector<string> v[11];
ll ans, way[C][C][C], edge[C][C], mul[2][2][2];
int id(char c)
{
if ('a' <= c && c <= 'z')
return c - 'a';
else if ('A' <= c && c <= 'Z')
return c - 'A' + 26;
else
return c - '0' + 52;
}
signed main()
{
cin >> N;
mul[0][0][0] = 24;
mul[1][0][0] = mul[0][1][0] = mul[0][0][1] = 12;
mul[1][1][0] = mul[0][1][1] = 4;
# | 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... |