oj.uz

Submission #447001

# Submission time Handle Problem Language Result Execution time Memory
447001 2021-07-24T08:08:46 Z yungyao Cubeword (CEOI19_cubeword) C++17
50 / 100
 1100 ms 15656 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 <= 'p') return c - 'a';
    else if (c >= 'A' and c <= 'P') return c - 'A' + 16;
    else if (c > 'p' and c <= 'z') return c - 'p' + 31;
    else if (c > 'P' and c <= 'Z') return c - 'P' + 41;
    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 155 ms 14788 KB Output is correct
2 Correct 194 ms 14800 KB Output is correct
3 Correct 150 ms 14816 KB Output is correct
4 Correct 160 ms 14756 KB Output is correct
5 Correct 161 ms 14820 KB Output is correct
6 Correct 146 ms 14800 KB Output is correct
7 Correct 158 ms 14888 KB Output is correct
8 Correct 168 ms 14928 KB Output is correct
9 Correct 161 ms 14808 KB Output is correct
10 Correct 166 ms 14824 KB Output is correct
11 Correct 173 ms 14816 KB Output is correct
12 Correct 160 ms 14804 KB Output is correct
13 Correct 202 ms 14788 KB Output is correct
14 Correct 161 ms 14784 KB Output is correct
15 Correct 177 ms 14752 KB Output is correct
16 Correct 169 ms 14832 KB Output is correct
17 Correct 172 ms 14820 KB Output is correct
18 Correct 167 ms 14808 KB Output is correct
19 Correct 188 ms 14792 KB Output is correct
20 Correct 174 ms 14772 KB Output is correct
21 Correct 146 ms 14784 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 14788 KB Output is correct
2 Correct 194 ms 14800 KB Output is correct
3 Correct 150 ms 14816 KB Output is correct
4 Correct 160 ms 14756 KB Output is correct
5 Correct 161 ms 14820 KB Output is correct
6 Correct 146 ms 14800 KB Output is correct
7 Correct 158 ms 14888 KB Output is correct
8 Correct 168 ms 14928 KB Output is correct
9 Correct 161 ms 14808 KB Output is correct
10 Correct 166 ms 14824 KB Output is correct
11 Correct 173 ms 14816 KB Output is correct
12 Correct 160 ms 14804 KB Output is correct
13 Correct 202 ms 14788 KB Output is correct
14 Correct 161 ms 14784 KB Output is correct
15 Correct 177 ms 14752 KB Output is correct
16 Correct 169 ms 14832 KB Output is correct
17 Correct 172 ms 14820 KB Output is correct
18 Correct 167 ms 14808 KB Output is correct
19 Correct 188 ms 14792 KB Output is correct
20 Correct 174 ms 14772 KB Output is correct
21 Correct 146 ms 14784 KB Output is correct
22 Correct 303 ms 15488 KB Output is correct
23 Correct 322 ms 15452 KB Output is correct
24 Correct 350 ms 15492 KB Output is correct
25 Correct 308 ms 15468 KB Output is correct
26 Correct 330 ms 15460 KB Output is correct
27 Correct 327 ms 15524 KB Output is correct
28 Correct 312 ms 15428 KB Output is correct
29 Correct 303 ms 15488 KB Output is correct
30 Correct 404 ms 15472 KB Output is correct
31 Correct 335 ms 15472 KB Output is correct
32 Correct 384 ms 15580 KB Output is correct
33 Correct 322 ms 15656 KB Output is correct
34 Correct 328 ms 15560 KB Output is correct
35 Correct 341 ms 15476 KB Output is correct
36 Correct 359 ms 15556 KB Output is correct
37 Correct 301 ms 15476 KB Output is correct
38 Correct 318 ms 15480 KB Output is correct
39 Correct 329 ms 15556 KB Output is correct
40 Correct 340 ms 15472 KB Output is correct
41 Correct 315 ms 15532 KB Output is correct
42 Correct 319 ms 15480 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 14788 KB Output is correct
2 Correct 194 ms 14800 KB Output is correct
3 Correct 150 ms 14816 KB Output is correct
4 Correct 160 ms 14756 KB Output is correct
5 Correct 161 ms 14820 KB Output is correct
6 Correct 146 ms 14800 KB Output is correct
7 Correct 158 ms 14888 KB Output is correct
8 Correct 168 ms 14928 KB Output is correct
9 Correct 161 ms 14808 KB Output is correct
10 Correct 166 ms 14824 KB Output is correct
11 Correct 173 ms 14816 KB Output is correct
12 Correct 160 ms 14804 KB Output is correct
13 Correct 202 ms 14788 KB Output is correct
14 Correct 161 ms 14784 KB Output is correct
15 Correct 177 ms 14752 KB Output is correct
16 Correct 169 ms 14832 KB Output is correct
17 Correct 172 ms 14820 KB Output is correct
18 Correct 167 ms 14808 KB Output is correct
19 Correct 188 ms 14792 KB Output is correct
20 Correct 174 ms 14772 KB Output is correct
21 Correct 146 ms 14784 KB Output is correct
22 Correct 303 ms 15488 KB Output is correct
23 Correct 322 ms 15452 KB Output is correct
24 Correct 350 ms 15492 KB Output is correct
25 Correct 308 ms 15468 KB Output is correct
26 Correct 330 ms 15460 KB Output is correct
27 Correct 327 ms 15524 KB Output is correct
28 Correct 312 ms 15428 KB Output is correct
29 Correct 303 ms 15488 KB Output is correct
30 Correct 404 ms 15472 KB Output is correct
31 Correct 335 ms 15472 KB Output is correct
32 Correct 384 ms 15580 KB Output is correct
33 Correct 322 ms 15656 KB Output is correct
34 Correct 328 ms 15560 KB Output is correct
35 Correct 341 ms 15476 KB Output is correct
36 Correct 359 ms 15556 KB Output is correct
37 Correct 301 ms 15476 KB Output is correct
38 Correct 318 ms 15480 KB Output is correct
39 Correct 329 ms 15556 KB Output is correct
40 Correct 340 ms 15472 KB Output is correct
41 Correct 315 ms 15532 KB Output is correct
42 Correct 319 ms 15480 KB Output is correct
43 Execution timed out 1188 ms 15608 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 14788 KB Output is correct
2 Correct 194 ms 14800 KB Output is correct
3 Correct 150 ms 14816 KB Output is correct
4 Correct 160 ms 14756 KB Output is correct
5 Correct 161 ms 14820 KB Output is correct
6 Correct 146 ms 14800 KB Output is correct
7 Correct 158 ms 14888 KB Output is correct
8 Correct 168 ms 14928 KB Output is correct
9 Correct 161 ms 14808 KB Output is correct
10 Correct 166 ms 14824 KB Output is correct
11 Correct 173 ms 14816 KB Output is correct
12 Correct 160 ms 14804 KB Output is correct
13 Correct 202 ms 14788 KB Output is correct
14 Correct 161 ms 14784 KB Output is correct
15 Correct 177 ms 14752 KB Output is correct
16 Correct 169 ms 14832 KB Output is correct
17 Correct 172 ms 14820 KB Output is correct
18 Correct 167 ms 14808 KB Output is correct
19 Correct 188 ms 14792 KB Output is correct
20 Correct 174 ms 14772 KB Output is correct
21 Correct 146 ms 14784 KB Output is correct
22 Correct 303 ms 15488 KB Output is correct
23 Correct 322 ms 15452 KB Output is correct
24 Correct 350 ms 15492 KB Output is correct
25 Correct 308 ms 15468 KB Output is correct
26 Correct 330 ms 15460 KB Output is correct
27 Correct 327 ms 15524 KB Output is correct
28 Correct 312 ms 15428 KB Output is correct
29 Correct 303 ms 15488 KB Output is correct
30 Correct 404 ms 15472 KB Output is correct
31 Correct 335 ms 15472 KB Output is correct
32 Correct 384 ms 15580 KB Output is correct
33 Correct 322 ms 15656 KB Output is correct
34 Correct 328 ms 15560 KB Output is correct
35 Correct 341 ms 15476 KB Output is correct
36 Correct 359 ms 15556 KB Output is correct
37 Correct 301 ms 15476 KB Output is correct
38 Correct 318 ms 15480 KB Output is correct
39 Correct 329 ms 15556 KB Output is correct
40 Correct 340 ms 15472 KB Output is correct
41 Correct 315 ms 15532 KB Output is correct
42 Correct 319 ms 15480 KB Output is correct
43 Execution timed out 1188 ms 15608 KB Time limit exceeded
44 Halted 0 ms 0 KB -