제출 #604783

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
604783	2022-07-25 09:46:27	1bin	Cubeword (CEOI19_cubeword)	C++14	100 / 100	428 ms	50568 KiB

cubeword

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e5 + 5;
const ll mod = 998244353;
ll n, ans, t[11][64][64], cnt[64][64][64], a, b, m[64][64][64][64];
string s;
set<string> st;
int chg(char c){
    if(c >= '0' && c <= '9') return c - '0';
    else if(c >= 'a' && c <= 'z') return c - 'a' + 10;
    else return c - 'A' + 36;
}
void solve(int l){
    memset(cnt, 0, sizeof(cnt));
    for(int i = 0; i < 64; i++)
        for(int j = i; j < 64; j++)
            for(int k = j; k < 64; k++)
                for(int x = 0; x < 64; x++)
                    cnt[i][j][k] += t[l][i][x] * t[l][j][x] * t[l][k][x], cnt[i][j][k] %= mod;
    
    for(int i = 0; i < 64; i++)
        for(int j = i; j < 64; j++)
            for(int k = j; k < 64; k++)
                for(int l = k; l < 64; l++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 21 / 21
• Subtask 2: 29 / 29
• Subtask 3: 34 / 34
• Subtask 4: 16 / 16