oj.uz

Submission #447000

# Submission time Handle Problem Language Result Execution time Memory
447000 2021-07-24T08:04:54 Z yungyao Cubeword (CEOI19_cubeword) C++17
50 / 100
 1100 ms 15612 KB 
using namespace std;
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <utility>
#include <memory.h>
#include <vector>
#include <bitset>

typedef pair<int,int> pii;
typedef long long LL;

#define iter(x) x.begin(),x.end()
#define F first
#define S second

#include <climits>
const int maxn = 70,mod = (119 << 23)^1;

int ctoi(char c){
    if (c >= 'a' and c <= 'z') return c - 'a';
    else if (c >= 'A' and c <= 'Z') return c - 'A' + 26;
    else return c - '0' + 52;
}

LL cnt[maxn][maxn];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    set <string> st[11];
    int n;

    cin >> n;
    for (int i=0;i<n;++i){
        string s; cin >> s;
        st[s.size()].insert(s);
        reverse(iter(s));
        st[s.size()].insert(s);
    }

    LL ans = 0;
    for (int len=3;len<=10;++len){
        memset(cnt,0,sizeof(cnt));
        int mx = 0;
        for (string s:st[len]){
            ++cnt[ctoi(s[0])][ctoi(s.back())];
            mx = max(mx,max(ctoi(s[0]),ctoi(s.back())));
        }
        for (int i=0;i<=mx;++i) for (int j=0;j<=mx;++j) for (int k=0;k<=mx;++k) for (int l=0;l<=mx;++l){
            LL c[4]{};
            for (int p=0;p<=mx;++p){
                c[0] += (cnt[i][p] * cnt[j][p]) % mod * cnt[k][p];
                c[0] %= mod;
            }
            for (int p=0;p<=mx;++p){
                c[1] += (cnt[i][p] * cnt[j][p]) % mod * cnt[l][p];
                c[1] %= mod;
            }
            for (int p=0;p<=mx;++p){
                c[2] += (cnt[i][p] * cnt[k][p]) % mod * cnt[l][p];
                c[2] %= mod;
            }
            for (int p=0;p<=mx;++p){
                c[3] += (cnt[j][p] * cnt[k][p]) % mod * cnt[l][p];
                c[3] %= mod;
            }
            c[0] *= c[1]; c[0] %= mod;
            c[0] *= c[2]; c[0] %= mod;
            c[0] *= c[3]; c[0] %= mod;
            ans = (ans + c[0]) % mod;
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 14820 KB Output is correct
2 Correct 162 ms 14812 KB Output is correct
3 Correct 172 ms 14712 KB Output is correct
4 Correct 153 ms 14788 KB Output is correct
5 Correct 151 ms 14740 KB Output is correct
6 Correct 165 ms 14736 KB Output is correct
7 Correct 168 ms 14788 KB Output is correct
8 Correct 169 ms 14824 KB Output is correct
9 Correct 156 ms 14788 KB Output is correct
10 Correct 160 ms 14720 KB Output is correct
11 Correct 158 ms 14816 KB Output is correct
12 Correct 163 ms 14788 KB Output is correct
13 Correct 158 ms 14788 KB Output is correct
14 Correct 146 ms 14804 KB Output is correct
15 Correct 153 ms 14828 KB Output is correct
16 Correct 180 ms 14932 KB Output is correct
17 Correct 160 ms 14804 KB Output is correct
18 Correct 185 ms 14720 KB Output is correct
19 Correct 182 ms 14724 KB Output is correct
20 Correct 219 ms 14788 KB Output is correct
21 Correct 232 ms 14788 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 14820 KB Output is correct
2 Correct 162 ms 14812 KB Output is correct
3 Correct 172 ms 14712 KB Output is correct
4 Correct 153 ms 14788 KB Output is correct
5 Correct 151 ms 14740 KB Output is correct
6 Correct 165 ms 14736 KB Output is correct
7 Correct 168 ms 14788 KB Output is correct
8 Correct 169 ms 14824 KB Output is correct
9 Correct 156 ms 14788 KB Output is correct
10 Correct 160 ms 14720 KB Output is correct
11 Correct 158 ms 14816 KB Output is correct
12 Correct 163 ms 14788 KB Output is correct
13 Correct 158 ms 14788 KB Output is correct
14 Correct 146 ms 14804 KB Output is correct
15 Correct 153 ms 14828 KB Output is correct
16 Correct 180 ms 14932 KB Output is correct
17 Correct 160 ms 14804 KB Output is correct
18 Correct 185 ms 14720 KB Output is correct
19 Correct 182 ms 14724 KB Output is correct
20 Correct 219 ms 14788 KB Output is correct
21 Correct 232 ms 14788 KB Output is correct
22 Correct 377 ms 15608 KB Output is correct
23 Correct 384 ms 15472 KB Output is correct
24 Correct 324 ms 15404 KB Output is correct
25 Correct 344 ms 15464 KB Output is correct
26 Correct 328 ms 15548 KB Output is correct
27 Correct 326 ms 15472 KB Output is correct
28 Correct 332 ms 15472 KB Output is correct
29 Correct 306 ms 15484 KB Output is correct
30 Correct 336 ms 15468 KB Output is correct
31 Correct 343 ms 15476 KB Output is correct
32 Correct 338 ms 15460 KB Output is correct
33 Correct 320 ms 15584 KB Output is correct
34 Correct 307 ms 15360 KB Output is correct
35 Correct 313 ms 15428 KB Output is correct
36 Correct 313 ms 15580 KB Output is correct
37 Correct 311 ms 15544 KB Output is correct
38 Correct 346 ms 15476 KB Output is correct
39 Correct 318 ms 15376 KB Output is correct
40 Correct 347 ms 15432 KB Output is correct
41 Correct 310 ms 15480 KB Output is correct
42 Correct 316 ms 15488 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 14820 KB Output is correct
2 Correct 162 ms 14812 KB Output is correct
3 Correct 172 ms 14712 KB Output is correct
4 Correct 153 ms 14788 KB Output is correct
5 Correct 151 ms 14740 KB Output is correct
6 Correct 165 ms 14736 KB Output is correct
7 Correct 168 ms 14788 KB Output is correct
8 Correct 169 ms 14824 KB Output is correct
9 Correct 156 ms 14788 KB Output is correct
10 Correct 160 ms 14720 KB Output is correct
11 Correct 158 ms 14816 KB Output is correct
12 Correct 163 ms 14788 KB Output is correct
13 Correct 158 ms 14788 KB Output is correct
14 Correct 146 ms 14804 KB Output is correct
15 Correct 153 ms 14828 KB Output is correct
16 Correct 180 ms 14932 KB Output is correct
17 Correct 160 ms 14804 KB Output is correct
18 Correct 185 ms 14720 KB Output is correct
19 Correct 182 ms 14724 KB Output is correct
20 Correct 219 ms 14788 KB Output is correct
21 Correct 232 ms 14788 KB Output is correct
22 Correct 377 ms 15608 KB Output is correct
23 Correct 384 ms 15472 KB Output is correct
24 Correct 324 ms 15404 KB Output is correct
25 Correct 344 ms 15464 KB Output is correct
26 Correct 328 ms 15548 KB Output is correct
27 Correct 326 ms 15472 KB Output is correct
28 Correct 332 ms 15472 KB Output is correct
29 Correct 306 ms 15484 KB Output is correct
30 Correct 336 ms 15468 KB Output is correct
31 Correct 343 ms 15476 KB Output is correct
32 Correct 338 ms 15460 KB Output is correct
33 Correct 320 ms 15584 KB Output is correct
34 Correct 307 ms 15360 KB Output is correct
35 Correct 313 ms 15428 KB Output is correct
36 Correct 313 ms 15580 KB Output is correct
37 Correct 311 ms 15544 KB Output is correct
38 Correct 346 ms 15476 KB Output is correct
39 Correct 318 ms 15376 KB Output is correct
40 Correct 347 ms 15432 KB Output is correct
41 Correct 310 ms 15480 KB Output is correct
42 Correct 316 ms 15488 KB Output is correct
43 Execution timed out 1190 ms 15612 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 14820 KB Output is correct
2 Correct 162 ms 14812 KB Output is correct
3 Correct 172 ms 14712 KB Output is correct
4 Correct 153 ms 14788 KB Output is correct
5 Correct 151 ms 14740 KB Output is correct
6 Correct 165 ms 14736 KB Output is correct
7 Correct 168 ms 14788 KB Output is correct
8 Correct 169 ms 14824 KB Output is correct
9 Correct 156 ms 14788 KB Output is correct
10 Correct 160 ms 14720 KB Output is correct
11 Correct 158 ms 14816 KB Output is correct
12 Correct 163 ms 14788 KB Output is correct
13 Correct 158 ms 14788 KB Output is correct
14 Correct 146 ms 14804 KB Output is correct
15 Correct 153 ms 14828 KB Output is correct
16 Correct 180 ms 14932 KB Output is correct
17 Correct 160 ms 14804 KB Output is correct
18 Correct 185 ms 14720 KB Output is correct
19 Correct 182 ms 14724 KB Output is correct
20 Correct 219 ms 14788 KB Output is correct
21 Correct 232 ms 14788 KB Output is correct
22 Correct 377 ms 15608 KB Output is correct
23 Correct 384 ms 15472 KB Output is correct
24 Correct 324 ms 15404 KB Output is correct
25 Correct 344 ms 15464 KB Output is correct
26 Correct 328 ms 15548 KB Output is correct
27 Correct 326 ms 15472 KB Output is correct
28 Correct 332 ms 15472 KB Output is correct
29 Correct 306 ms 15484 KB Output is correct
30 Correct 336 ms 15468 KB Output is correct
31 Correct 343 ms 15476 KB Output is correct
32 Correct 338 ms 15460 KB Output is correct
33 Correct 320 ms 15584 KB Output is correct
34 Correct 307 ms 15360 KB Output is correct
35 Correct 313 ms 15428 KB Output is correct
36 Correct 313 ms 15580 KB Output is correct
37 Correct 311 ms 15544 KB Output is correct
38 Correct 346 ms 15476 KB Output is correct
39 Correct 318 ms 15376 KB Output is correct
40 Correct 347 ms 15432 KB Output is correct
41 Correct 310 ms 15480 KB Output is correct
42 Correct 316 ms 15488 KB Output is correct
43 Execution timed out 1190 ms 15612 KB Time limit exceeded
44 Halted 0 ms 0 KB -