oj.uz

답안 #447034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447034 2021-07-24T09:22:59 Z yungyao Cubeword (CEOI19_cubeword) C++17
50 / 100
 1100 ms 16436 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
#define pb push_back
#define mkp make_pair

#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) if (!st[len].empty()){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15672 KB Output is correct
2 Correct 181 ms 15664 KB Output is correct
3 Correct 158 ms 15620 KB Output is correct
4 Correct 178 ms 15716 KB Output is correct
5 Correct 159 ms 15684 KB Output is correct
6 Correct 162 ms 15552 KB Output is correct
7 Correct 164 ms 15644 KB Output is correct
8 Correct 163 ms 15564 KB Output is correct
9 Correct 163 ms 15576 KB Output is correct
10 Correct 163 ms 15684 KB Output is correct
11 Correct 167 ms 15684 KB Output is correct
12 Correct 159 ms 15664 KB Output is correct
13 Correct 159 ms 15584 KB Output is correct
14 Correct 164 ms 15680 KB Output is correct
15 Correct 160 ms 15644 KB Output is correct
16 Correct 164 ms 15556 KB Output is correct
17 Correct 167 ms 15760 KB Output is correct
18 Correct 178 ms 15576 KB Output is correct
19 Correct 164 ms 15556 KB Output is correct
20 Correct 174 ms 15668 KB Output is correct
21 Correct 164 ms 15768 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15672 KB Output is correct
2 Correct 181 ms 15664 KB Output is correct
3 Correct 158 ms 15620 KB Output is correct
4 Correct 178 ms 15716 KB Output is correct
5 Correct 159 ms 15684 KB Output is correct
6 Correct 162 ms 15552 KB Output is correct
7 Correct 164 ms 15644 KB Output is correct
8 Correct 163 ms 15564 KB Output is correct
9 Correct 163 ms 15576 KB Output is correct
10 Correct 163 ms 15684 KB Output is correct
11 Correct 167 ms 15684 KB Output is correct
12 Correct 159 ms 15664 KB Output is correct
13 Correct 159 ms 15584 KB Output is correct
14 Correct 164 ms 15680 KB Output is correct
15 Correct 160 ms 15644 KB Output is correct
16 Correct 164 ms 15556 KB Output is correct
17 Correct 167 ms 15760 KB Output is correct
18 Correct 178 ms 15576 KB Output is correct
19 Correct 164 ms 15556 KB Output is correct
20 Correct 174 ms 15668 KB Output is correct
21 Correct 164 ms 15768 KB Output is correct
22 Correct 315 ms 16252 KB Output is correct
23 Correct 318 ms 16324 KB Output is correct
24 Correct 330 ms 16196 KB Output is correct
25 Correct 321 ms 16316 KB Output is correct
26 Correct 323 ms 16196 KB Output is correct
27 Correct 317 ms 16196 KB Output is correct
28 Correct 325 ms 16348 KB Output is correct
29 Correct 309 ms 16192 KB Output is correct
30 Correct 308 ms 16324 KB Output is correct
31 Correct 305 ms 16196 KB Output is correct
32 Correct 316 ms 16300 KB Output is correct
33 Correct 311 ms 16196 KB Output is correct
34 Correct 311 ms 16324 KB Output is correct
35 Correct 315 ms 16220 KB Output is correct
36 Correct 307 ms 16256 KB Output is correct
37 Correct 308 ms 16168 KB Output is correct
38 Correct 333 ms 16248 KB Output is correct
39 Correct 341 ms 16436 KB Output is correct
40 Correct 329 ms 16148 KB Output is correct
41 Correct 310 ms 16208 KB Output is correct
42 Correct 318 ms 16196 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15672 KB Output is correct
2 Correct 181 ms 15664 KB Output is correct
3 Correct 158 ms 15620 KB Output is correct
4 Correct 178 ms 15716 KB Output is correct
5 Correct 159 ms 15684 KB Output is correct
6 Correct 162 ms 15552 KB Output is correct
7 Correct 164 ms 15644 KB Output is correct
8 Correct 163 ms 15564 KB Output is correct
9 Correct 163 ms 15576 KB Output is correct
10 Correct 163 ms 15684 KB Output is correct
11 Correct 167 ms 15684 KB Output is correct
12 Correct 159 ms 15664 KB Output is correct
13 Correct 159 ms 15584 KB Output is correct
14 Correct 164 ms 15680 KB Output is correct
15 Correct 160 ms 15644 KB Output is correct
16 Correct 164 ms 15556 KB Output is correct
17 Correct 167 ms 15760 KB Output is correct
18 Correct 178 ms 15576 KB Output is correct
19 Correct 164 ms 15556 KB Output is correct
20 Correct 174 ms 15668 KB Output is correct
21 Correct 164 ms 15768 KB Output is correct
22 Correct 315 ms 16252 KB Output is correct
23 Correct 318 ms 16324 KB Output is correct
24 Correct 330 ms 16196 KB Output is correct
25 Correct 321 ms 16316 KB Output is correct
26 Correct 323 ms 16196 KB Output is correct
27 Correct 317 ms 16196 KB Output is correct
28 Correct 325 ms 16348 KB Output is correct
29 Correct 309 ms 16192 KB Output is correct
30 Correct 308 ms 16324 KB Output is correct
31 Correct 305 ms 16196 KB Output is correct
32 Correct 316 ms 16300 KB Output is correct
33 Correct 311 ms 16196 KB Output is correct
34 Correct 311 ms 16324 KB Output is correct
35 Correct 315 ms 16220 KB Output is correct
36 Correct 307 ms 16256 KB Output is correct
37 Correct 308 ms 16168 KB Output is correct
38 Correct 333 ms 16248 KB Output is correct
39 Correct 341 ms 16436 KB Output is correct
40 Correct 329 ms 16148 KB Output is correct
41 Correct 310 ms 16208 KB Output is correct
42 Correct 318 ms 16196 KB Output is correct
43 Execution timed out 1192 ms 16416 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15672 KB Output is correct
2 Correct 181 ms 15664 KB Output is correct
3 Correct 158 ms 15620 KB Output is correct
4 Correct 178 ms 15716 KB Output is correct
5 Correct 159 ms 15684 KB Output is correct
6 Correct 162 ms 15552 KB Output is correct
7 Correct 164 ms 15644 KB Output is correct
8 Correct 163 ms 15564 KB Output is correct
9 Correct 163 ms 15576 KB Output is correct
10 Correct 163 ms 15684 KB Output is correct
11 Correct 167 ms 15684 KB Output is correct
12 Correct 159 ms 15664 KB Output is correct
13 Correct 159 ms 15584 KB Output is correct
14 Correct 164 ms 15680 KB Output is correct
15 Correct 160 ms 15644 KB Output is correct
16 Correct 164 ms 15556 KB Output is correct
17 Correct 167 ms 15760 KB Output is correct
18 Correct 178 ms 15576 KB Output is correct
19 Correct 164 ms 15556 KB Output is correct
20 Correct 174 ms 15668 KB Output is correct
21 Correct 164 ms 15768 KB Output is correct
22 Correct 315 ms 16252 KB Output is correct
23 Correct 318 ms 16324 KB Output is correct
24 Correct 330 ms 16196 KB Output is correct
25 Correct 321 ms 16316 KB Output is correct
26 Correct 323 ms 16196 KB Output is correct
27 Correct 317 ms 16196 KB Output is correct
28 Correct 325 ms 16348 KB Output is correct
29 Correct 309 ms 16192 KB Output is correct
30 Correct 308 ms 16324 KB Output is correct
31 Correct 305 ms 16196 KB Output is correct
32 Correct 316 ms 16300 KB Output is correct
33 Correct 311 ms 16196 KB Output is correct
34 Correct 311 ms 16324 KB Output is correct
35 Correct 315 ms 16220 KB Output is correct
36 Correct 307 ms 16256 KB Output is correct
37 Correct 308 ms 16168 KB Output is correct
38 Correct 333 ms 16248 KB Output is correct
39 Correct 341 ms 16436 KB Output is correct
40 Correct 329 ms 16148 KB Output is correct
41 Correct 310 ms 16208 KB Output is correct
42 Correct 318 ms 16196 KB Output is correct
43 Execution timed out 1192 ms 16416 KB Time limit exceeded
44 Halted 0 ms 0 KB -