oj.uz

답안 #948059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948059 2024-03-17T14:32:42 Z Vladth11 Cubeword (CEOI19_cubeword) C++14
84 / 100
 1100 ms 20876 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;

const ll NMAX = 200002;
const ll INF = (1LL << 58);
const ll nrbits = 20;
const ll MOD = 998244353;

vector <pii> lung[11];

const int VMAX = 63;

int cod(char c){
    if('a' <= c && c <= 'z')
        return c - 'a';
    if('A' <= c && c <= 'Z')
        return (c - 'A') + 26;
    if('0' <= c && c <= '9')
        return (c - '0') + 52;
}

int c[VMAX][VMAX];
int dp[VMAX][VMAX][VMAX];

void add(int &x, int val){
    x += val;
    if(x >= MOD)
        x -= MOD;
    if(x < 0)
        x += MOD;
}

map <string, int> mp;

int main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, i;
    cin >> n;
    for(i = 1; i <= n; i++){
        string s;
        cin >> s;
        mp[s]++;
        if(mp[s] == 1)
            lung[s.size()].push_back({cod(s[0]), cod(s.back())});
        string a= s;
        reverse(a.begin(), a.end());
        mp[a]++;
        if(mp[a] == 1)
            lung[s.size()].push_back({cod(s.back()), cod(s[0])});
    }
    int sol = 0;
    for(int i = 1; i <= 10; i++){
        if(!lung[i].size()) continue;
        for(int j = 0; j < VMAX; j++) for(int t = 0; t < VMAX; t++) c[j][t] = 0;
        for(auto x : lung[i]){
            c[x.first][x.second]++;
        }
        for(int j = 0; j < VMAX; j++){
            for(int t = j; t < VMAX; t++){
                for(int k = t; k < VMAX; k++){
                    dp[j][t][k] = 0;
                    for(int aici = 0; aici < VMAX; aici++){
                        add(dp[j][t][k], (1LL * c[aici][j] * c[aici][t]) % MOD * c[aici][k] % MOD);
                    }
                    /// aici se pune
                    dp[j][k][t] = dp[t][j][k] = dp[t][k][j] = dp[k][j][t] = dp[k][t][j] = dp[j][t][k];
                }
            }
        }
        for(int a = 0; a < VMAX; a++){
            for(int b = 0; b < VMAX; b++){
                for(int c = 0; c < VMAX; c++){
                    for(int d = 0; d < VMAX; d++){
                        add(sol, (1LL * dp[a][b][c] * dp[a][b][d]) % MOD * dp[b][c][d] % MOD * dp[a][c][d] % MOD);
                    }
                }
            }
        }
    }
    cout << sol << "\n";
    return 0;
}

Compilation message

cubeword.cpp: In function 'int cod(char)':
cubeword.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 892 ms 19560 KB Output is correct
2 Correct 863 ms 19708 KB Output is correct
3 Correct 867 ms 19544 KB Output is correct
4 Correct 877 ms 19692 KB Output is correct
5 Correct 887 ms 19716 KB Output is correct
6 Correct 880 ms 19608 KB Output is correct
7 Correct 862 ms 19488 KB Output is correct
8 Correct 858 ms 19488 KB Output is correct
9 Correct 859 ms 19612 KB Output is correct
10 Correct 863 ms 19724 KB Output is correct
11 Correct 872 ms 19708 KB Output is correct
12 Correct 859 ms 19696 KB Output is correct
13 Correct 879 ms 19728 KB Output is correct
14 Correct 862 ms 19720 KB Output is correct
15 Correct 875 ms 19608 KB Output is correct
16 Correct 864 ms 19832 KB Output is correct
17 Correct 893 ms 19740 KB Output is correct
18 Correct 871 ms 19708 KB Output is correct
19 Correct 895 ms 19488 KB Output is correct
20 Correct 901 ms 19720 KB Output is correct
21 Correct 862 ms 19928 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 892 ms 19560 KB Output is correct
2 Correct 863 ms 19708 KB Output is correct
3 Correct 867 ms 19544 KB Output is correct
4 Correct 877 ms 19692 KB Output is correct
5 Correct 887 ms 19716 KB Output is correct
6 Correct 880 ms 19608 KB Output is correct
7 Correct 862 ms 19488 KB Output is correct
8 Correct 858 ms 19488 KB Output is correct
9 Correct 859 ms 19612 KB Output is correct
10 Correct 863 ms 19724 KB Output is correct
11 Correct 872 ms 19708 KB Output is correct
12 Correct 859 ms 19696 KB Output is correct
13 Correct 879 ms 19728 KB Output is correct
14 Correct 862 ms 19720 KB Output is correct
15 Correct 875 ms 19608 KB Output is correct
16 Correct 864 ms 19832 KB Output is correct
17 Correct 893 ms 19740 KB Output is correct
18 Correct 871 ms 19708 KB Output is correct
19 Correct 895 ms 19488 KB Output is correct
20 Correct 901 ms 19720 KB Output is correct
21 Correct 862 ms 19928 KB Output is correct
22 Correct 869 ms 20424 KB Output is correct
23 Correct 859 ms 20636 KB Output is correct
24 Correct 868 ms 20376 KB Output is correct
25 Correct 893 ms 20404 KB Output is correct
26 Correct 894 ms 20256 KB Output is correct
27 Correct 868 ms 20400 KB Output is correct
28 Correct 882 ms 20416 KB Output is correct
29 Correct 941 ms 20424 KB Output is correct
30 Correct 895 ms 20604 KB Output is correct
31 Correct 866 ms 20412 KB Output is correct
32 Correct 865 ms 20632 KB Output is correct
33 Correct 881 ms 20404 KB Output is correct
34 Correct 863 ms 20256 KB Output is correct
35 Correct 875 ms 20588 KB Output is correct
36 Correct 886 ms 20420 KB Output is correct
37 Correct 870 ms 20256 KB Output is correct
38 Correct 866 ms 20412 KB Output is correct
39 Correct 864 ms 20408 KB Output is correct
40 Correct 887 ms 20408 KB Output is correct
41 Correct 871 ms 20632 KB Output is correct
42 Correct 868 ms 20484 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 892 ms 19560 KB Output is correct
2 Correct 863 ms 19708 KB Output is correct
3 Correct 867 ms 19544 KB Output is correct
4 Correct 877 ms 19692 KB Output is correct
5 Correct 887 ms 19716 KB Output is correct
6 Correct 880 ms 19608 KB Output is correct
7 Correct 862 ms 19488 KB Output is correct
8 Correct 858 ms 19488 KB Output is correct
9 Correct 859 ms 19612 KB Output is correct
10 Correct 863 ms 19724 KB Output is correct
11 Correct 872 ms 19708 KB Output is correct
12 Correct 859 ms 19696 KB Output is correct
13 Correct 879 ms 19728 KB Output is correct
14 Correct 862 ms 19720 KB Output is correct
15 Correct 875 ms 19608 KB Output is correct
16 Correct 864 ms 19832 KB Output is correct
17 Correct 893 ms 19740 KB Output is correct
18 Correct 871 ms 19708 KB Output is correct
19 Correct 895 ms 19488 KB Output is correct
20 Correct 901 ms 19720 KB Output is correct
21 Correct 862 ms 19928 KB Output is correct
22 Correct 869 ms 20424 KB Output is correct
23 Correct 859 ms 20636 KB Output is correct
24 Correct 868 ms 20376 KB Output is correct
25 Correct 893 ms 20404 KB Output is correct
26 Correct 894 ms 20256 KB Output is correct
27 Correct 868 ms 20400 KB Output is correct
28 Correct 882 ms 20416 KB Output is correct
29 Correct 941 ms 20424 KB Output is correct
30 Correct 895 ms 20604 KB Output is correct
31 Correct 866 ms 20412 KB Output is correct
32 Correct 865 ms 20632 KB Output is correct
33 Correct 881 ms 20404 KB Output is correct
34 Correct 863 ms 20256 KB Output is correct
35 Correct 875 ms 20588 KB Output is correct
36 Correct 886 ms 20420 KB Output is correct
37 Correct 870 ms 20256 KB Output is correct
38 Correct 866 ms 20412 KB Output is correct
39 Correct 864 ms 20408 KB Output is correct
40 Correct 887 ms 20408 KB Output is correct
41 Correct 871 ms 20632 KB Output is correct
42 Correct 868 ms 20484 KB Output is correct
43 Correct 943 ms 20876 KB Output is correct
44 Correct 903 ms 20632 KB Output is correct
45 Correct 920 ms 20644 KB Output is correct
46 Correct 948 ms 20640 KB Output is correct
47 Correct 970 ms 20628 KB Output is correct
48 Correct 962 ms 20656 KB Output is correct
49 Correct 928 ms 20644 KB Output is correct
50 Correct 954 ms 20656 KB Output is correct
51 Correct 925 ms 20636 KB Output is correct
52 Correct 919 ms 20580 KB Output is correct
53 Correct 977 ms 20580 KB Output is correct
54 Correct 927 ms 20744 KB Output is correct
55 Correct 963 ms 20636 KB Output is correct
56 Correct 933 ms 20652 KB Output is correct
57 Correct 921 ms 20364 KB Output is correct
58 Correct 911 ms 20644 KB Output is correct
59 Correct 911 ms 20640 KB Output is correct
60 Correct 922 ms 20624 KB Output is correct
61 Correct 908 ms 20632 KB Output is correct
62 Correct 996 ms 20460 KB Output is correct
63 Correct 946 ms 20644 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 892 ms 19560 KB Output is correct
2 Correct 863 ms 19708 KB Output is correct
3 Correct 867 ms 19544 KB Output is correct
4 Correct 877 ms 19692 KB Output is correct
5 Correct 887 ms 19716 KB Output is correct
6 Correct 880 ms 19608 KB Output is correct
7 Correct 862 ms 19488 KB Output is correct
8 Correct 858 ms 19488 KB Output is correct
9 Correct 859 ms 19612 KB Output is correct
10 Correct 863 ms 19724 KB Output is correct
11 Correct 872 ms 19708 KB Output is correct
12 Correct 859 ms 19696 KB Output is correct
13 Correct 879 ms 19728 KB Output is correct
14 Correct 862 ms 19720 KB Output is correct
15 Correct 875 ms 19608 KB Output is correct
16 Correct 864 ms 19832 KB Output is correct
17 Correct 893 ms 19740 KB Output is correct
18 Correct 871 ms 19708 KB Output is correct
19 Correct 895 ms 19488 KB Output is correct
20 Correct 901 ms 19720 KB Output is correct
21 Correct 862 ms 19928 KB Output is correct
22 Correct 869 ms 20424 KB Output is correct
23 Correct 859 ms 20636 KB Output is correct
24 Correct 868 ms 20376 KB Output is correct
25 Correct 893 ms 20404 KB Output is correct
26 Correct 894 ms 20256 KB Output is correct
27 Correct 868 ms 20400 KB Output is correct
28 Correct 882 ms 20416 KB Output is correct
29 Correct 941 ms 20424 KB Output is correct
30 Correct 895 ms 20604 KB Output is correct
31 Correct 866 ms 20412 KB Output is correct
32 Correct 865 ms 20632 KB Output is correct
33 Correct 881 ms 20404 KB Output is correct
34 Correct 863 ms 20256 KB Output is correct
35 Correct 875 ms 20588 KB Output is correct
36 Correct 886 ms 20420 KB Output is correct
37 Correct 870 ms 20256 KB Output is correct
38 Correct 866 ms 20412 KB Output is correct
39 Correct 864 ms 20408 KB Output is correct
40 Correct 887 ms 20408 KB Output is correct
41 Correct 871 ms 20632 KB Output is correct
42 Correct 868 ms 20484 KB Output is correct
43 Correct 943 ms 20876 KB Output is correct
44 Correct 903 ms 20632 KB Output is correct
45 Correct 920 ms 20644 KB Output is correct
46 Correct 948 ms 20640 KB Output is correct
47 Correct 970 ms 20628 KB Output is correct
48 Correct 962 ms 20656 KB Output is correct
49 Correct 928 ms 20644 KB Output is correct
50 Correct 954 ms 20656 KB Output is correct
51 Correct 925 ms 20636 KB Output is correct
52 Correct 919 ms 20580 KB Output is correct
53 Correct 977 ms 20580 KB Output is correct
54 Correct 927 ms 20744 KB Output is correct
55 Correct 963 ms 20636 KB Output is correct
56 Correct 933 ms 20652 KB Output is correct
57 Correct 921 ms 20364 KB Output is correct
58 Correct 911 ms 20644 KB Output is correct
59 Correct 911 ms 20640 KB Output is correct
60 Correct 922 ms 20624 KB Output is correct
61 Correct 908 ms 20632 KB Output is correct
62 Correct 996 ms 20460 KB Output is correct
63 Correct 946 ms 20644 KB Output is correct
64 Execution timed out 1119 ms 20720 KB Time limit exceeded
65 Halted 0 ms 0 KB -