oj.uz

답안 #1040778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040778 2024-08-01T09:07:52 Z anton Cubeword (CEOI19_cubeword) C++17
21 / 100
 285 ms 58924 KB 
#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>

const int MOD = 998244353LL;
const int MAX_N = 40LL;
int nbP[MAX_N][MAX_N];
int RES = 0;

vector<pii> cube_edges = {
{0, 1},
{1, 2},
{2, 3},
{3, 0},
{4, 5},
{5, 6},
{6, 7},
{7, 4},
{0, 4},
{1, 5}, 
{2, 6},
{3, 7},
};


bool is_palindrome(string s){
    bool ok = true;
    for(int i = 0; i<(s.size()+1)/2; i++){
        ok &= (s[i] == s[s.size()-i-1]);
    }
    return ok;
}

int mexp(int a, int b){
    int res = 1;
    vector<int>pows(1, a);


    for(int i= 1; i<35; i++){
        pows.push_back((pows.back()*pows.back())%MOD);
    }
    
    for(int i = 0; i<35; i++){
        if(0LL!=((1LL<<i)&b)){
            res = (res * pows[i])%MOD;
        }
    }

    return res;
}

unordered_map<int, int> inv;
int modinv(int a){
    if(inv.find(a)!=inv.end()){
        return inv[a];
    }
    int b= mexp(a, MOD-2);
    inv[a] = b;
    assert((a*b)%MOD == 1);
    return b;
}
vector<pair<int, vector<int>>> iterate_all(int nbSteps, int maxC){
    vector<int> cur = vector<int>(nbSteps, 0);
    vector<pair<int, vector<int>>> res;

    bool ok = true;

    for(int first_v = 0; first_v <maxC; first_v++){
        cur =vector<int>(nbSteps, 0);
        cur[0] = first_v;
        ok =true;
        while(ok){
            cur.back()++;
            for(int i = nbSteps-1; i>1; i--){
                if(cur[i]>first_v){
                    cur[i-1]++;
                    cur[i] = 0;
                }
            }

            if(cur[1] >first_v){
                ok = false;
                cur[1] = 0;
            }
            int nb_same = 0;
            for(auto e: cur){
                if(e == first_v){
                    nb_same++;
                }
            }
            res.push_back({nbSteps * modinv(nb_same), cur});
        }
        

    }
    return res;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    cin>>N;
    vector<set<string>> words(11);

    for(int i = 0; i<N; i++){
        string s;
        cin>>s;
        if(is_palindrome(s)){
            words[s.size()].insert(s);
        }
        else{
            words[s.size()].insert(s);
            reverse(s.begin(), s.end());
            words[s.size()].insert(s);
        }
    }

    vector<pair<int, vector<int>>> colorings=  iterate_all(8, 6);

    for(int len = 3; len<=10; len++){
        fill(&nbP[0][0], &nbP[MAX_N][0], 0);


        for(auto e: words[len]){
            int a=  e[0]-'a';
            int b= e.back()-'a';
            nbP[a][b]++;
        }

        for(auto list: colorings){
            int nb_cur = 1;
            for(auto edge: cube_edges){
                nb_cur = (nb_cur * nbP[list.second[edge.first]][list.second[edge.second]])%MOD;
            }
            nb_cur = (nb_cur * list.first)%MOD;
            RES = (RES + nb_cur)%MOD;
        }
    }

    cout<<RES<<endl;
}

Compilation message

cubeword.cpp: In function 'bool is_palindrome(std::string)':
cubeword.cpp:30:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0; i<(s.size()+1)/2; i++){
      |                    ~^~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 57680 KB Output is correct
2 Correct 265 ms 58552 KB Output is correct
3 Correct 261 ms 57864 KB Output is correct
4 Correct 275 ms 57260 KB Output is correct
5 Correct 260 ms 58548 KB Output is correct
6 Correct 285 ms 58292 KB Output is correct
7 Correct 260 ms 57780 KB Output is correct
8 Correct 254 ms 58800 KB Output is correct
9 Correct 269 ms 57512 KB Output is correct
10 Correct 266 ms 58912 KB Output is correct
11 Correct 262 ms 56976 KB Output is correct
12 Correct 261 ms 57512 KB Output is correct
13 Correct 260 ms 58044 KB Output is correct
14 Correct 271 ms 58044 KB Output is correct
15 Correct 284 ms 58696 KB Output is correct
16 Correct 285 ms 57780 KB Output is correct
17 Correct 263 ms 58792 KB Output is correct
18 Correct 256 ms 57772 KB Output is correct
19 Correct 263 ms 58040 KB Output is correct
20 Correct 272 ms 58924 KB Output is correct
21 Correct 262 ms 58804 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 57680 KB Output is correct
2 Correct 265 ms 58552 KB Output is correct
3 Correct 261 ms 57864 KB Output is correct
4 Correct 275 ms 57260 KB Output is correct
5 Correct 260 ms 58548 KB Output is correct
6 Correct 285 ms 58292 KB Output is correct
7 Correct 260 ms 57780 KB Output is correct
8 Correct 254 ms 58800 KB Output is correct
9 Correct 269 ms 57512 KB Output is correct
10 Correct 266 ms 58912 KB Output is correct
11 Correct 262 ms 56976 KB Output is correct
12 Correct 261 ms 57512 KB Output is correct
13 Correct 260 ms 58044 KB Output is correct
14 Correct 271 ms 58044 KB Output is correct
15 Correct 284 ms 58696 KB Output is correct
16 Correct 285 ms 57780 KB Output is correct
17 Correct 263 ms 58792 KB Output is correct
18 Correct 256 ms 57772 KB Output is correct
19 Correct 263 ms 58040 KB Output is correct
20 Correct 272 ms 58924 KB Output is correct
21 Correct 262 ms 58804 KB Output is correct
22 Incorrect 263 ms 58552 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 57680 KB Output is correct
2 Correct 265 ms 58552 KB Output is correct
3 Correct 261 ms 57864 KB Output is correct
4 Correct 275 ms 57260 KB Output is correct
5 Correct 260 ms 58548 KB Output is correct
6 Correct 285 ms 58292 KB Output is correct
7 Correct 260 ms 57780 KB Output is correct
8 Correct 254 ms 58800 KB Output is correct
9 Correct 269 ms 57512 KB Output is correct
10 Correct 266 ms 58912 KB Output is correct
11 Correct 262 ms 56976 KB Output is correct
12 Correct 261 ms 57512 KB Output is correct
13 Correct 260 ms 58044 KB Output is correct
14 Correct 271 ms 58044 KB Output is correct
15 Correct 284 ms 58696 KB Output is correct
16 Correct 285 ms 57780 KB Output is correct
17 Correct 263 ms 58792 KB Output is correct
18 Correct 256 ms 57772 KB Output is correct
19 Correct 263 ms 58040 KB Output is correct
20 Correct 272 ms 58924 KB Output is correct
21 Correct 262 ms 58804 KB Output is correct
22 Incorrect 263 ms 58552 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 57680 KB Output is correct
2 Correct 265 ms 58552 KB Output is correct
3 Correct 261 ms 57864 KB Output is correct
4 Correct 275 ms 57260 KB Output is correct
5 Correct 260 ms 58548 KB Output is correct
6 Correct 285 ms 58292 KB Output is correct
7 Correct 260 ms 57780 KB Output is correct
8 Correct 254 ms 58800 KB Output is correct
9 Correct 269 ms 57512 KB Output is correct
10 Correct 266 ms 58912 KB Output is correct
11 Correct 262 ms 56976 KB Output is correct
12 Correct 261 ms 57512 KB Output is correct
13 Correct 260 ms 58044 KB Output is correct
14 Correct 271 ms 58044 KB Output is correct
15 Correct 284 ms 58696 KB Output is correct
16 Correct 285 ms 57780 KB Output is correct
17 Correct 263 ms 58792 KB Output is correct
18 Correct 256 ms 57772 KB Output is correct
19 Correct 263 ms 58040 KB Output is correct
20 Correct 272 ms 58924 KB Output is correct
21 Correct 262 ms 58804 KB Output is correct
22 Incorrect 263 ms 58552 KB Output isn't correct
23 Halted 0 ms 0 KB -