# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946811 | galen_colin | Cubeword (CEOI19_cubeword) | C++17 | 108 ms | 47808 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.
/* not my code (obviously i don't code like this wtf) */
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
map<char, int> mp;
int c[11][62][62][62];
int prod[11][62][62][62];
int aa[11][63][63];
const int mod = 998244353;
const int msq = mod * mod;
inline int mul(int x, int y){
if((x*y)>mod) return x*y%mod;
return x*y;
}
void solve(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int cnt=0;
for(int i='a'; i<='z'; i++) mp[i]=cnt++;
for(int i='A'; i<='Z'; i++) mp[i]=cnt++;
for(int i='0'; i<='9'; i++) mp[i]=cnt++;
# | 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... |