제출 #946811

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
946811	2024-03-15 05:26:38	galen_colin	Cubeword (CEOI19_cubeword)	C++17	100 / 100	108 ms	47808 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
/* 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++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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