oj.uz

답안 #469307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469307 2021-08-31T11:43:58 Z Carmel_Ab1 Cubeword (CEOI19_cubeword) C++17
84 / 100
 460 ms 86880 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    sort(all(a));
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

void solve() {
    int n;
    cin >> n;
    vvl a(n);
    for(int i=0; i<n; i++){
        string s;
        cin >> s;
        a[i].resize(s.size());
        for(int j=0; j<a[i].size(); j++)
            a[i][j]= isupper(s[j])?(16+(s[j]-'A')):(s[j]-'a') ;
    }

    for(int i=0; i<n; i++){
        reverse(all(a[i]));
        a.pb(a[i]);
        reverse(all(a[i]));
    }

    a=UNQ(a);
    vector<vector<vvl>>cnt(32,vector<vvl>(32,vvl(32,vl(11))));
    n=a.size();

    vector<vvl>cnt2(32,vvl(32,vl(11)));
    for(int i=0; i<n; i++)
        cnt2[a[i][0]][a[i].back()][a[i].size()]++;

    ll ans=0,mod=998244353;
    vi AB;
    for(int i=0; i<32; i++)
        AB.pb(i);
    for(int l=1; l<=10; l++)
        for(int c1:AB)
            for(int c2:AB)
                for(int c3:AB)
                    for(int c4:AB){
                        ll cur=1;
                        cur=(cur*cnt2[c1][c4][l])%mod;
                        cur=(cur*cnt2[c2][c4][l])%mod;
                        cur=(cur*cnt2[c3][c4][l])%mod;

                        cnt[c1][c2][c3][l]+=cur;
                    }

    for(int l=1; l<=10; l++) {
        for (int c1:AB)
            for (int c2:AB)
                for (int c3:AB)
                    for (int c4:AB) {
                        ll cur = 1;
                        cur = (cur * cnt[c1][c2 ][c3 ][l]) % mod;
                        cur = (cur * cnt[c1 ][c3][c4 ][l]) % mod;
                        cur = (cur * cnt[c2 ][c3 ][c4][l]) % mod;
                        cur = (cur * cnt[c1 ][c2 ][c4][l]) % mod;
                        ans = (ans + cur) % mod;
                    }
    }
    out(ans)
}

Compilation message

cubeword.cpp: In function 'void solve()':
cubeword.cpp:152:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |         for(int j=0; j<a[i].size(); j++)
      |                      ~^~~~~~~~~~~~
cubeword.cpp: In function 'void usaco(std::string)':
cubeword.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
cubeword.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 57152 KB Output is correct
2 Correct 411 ms 57108 KB Output is correct
3 Correct 408 ms 57176 KB Output is correct
4 Correct 407 ms 57152 KB Output is correct
5 Correct 404 ms 57108 KB Output is correct
6 Correct 410 ms 57108 KB Output is correct
7 Correct 407 ms 57116 KB Output is correct
8 Correct 419 ms 57108 KB Output is correct
9 Correct 460 ms 57108 KB Output is correct
10 Correct 416 ms 57236 KB Output is correct
11 Correct 411 ms 57108 KB Output is correct
12 Correct 430 ms 57124 KB Output is correct
13 Correct 403 ms 57172 KB Output is correct
14 Correct 418 ms 57136 KB Output is correct
15 Correct 412 ms 57104 KB Output is correct
16 Correct 426 ms 57108 KB Output is correct
17 Correct 421 ms 57032 KB Output is correct
18 Correct 414 ms 57148 KB Output is correct
19 Correct 415 ms 57100 KB Output is correct
20 Correct 415 ms 57108 KB Output is correct
21 Correct 416 ms 56996 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 57152 KB Output is correct
2 Correct 411 ms 57108 KB Output is correct
3 Correct 408 ms 57176 KB Output is correct
4 Correct 407 ms 57152 KB Output is correct
5 Correct 404 ms 57108 KB Output is correct
6 Correct 410 ms 57108 KB Output is correct
7 Correct 407 ms 57116 KB Output is correct
8 Correct 419 ms 57108 KB Output is correct
9 Correct 460 ms 57108 KB Output is correct
10 Correct 416 ms 57236 KB Output is correct
11 Correct 411 ms 57108 KB Output is correct
12 Correct 430 ms 57124 KB Output is correct
13 Correct 403 ms 57172 KB Output is correct
14 Correct 418 ms 57136 KB Output is correct
15 Correct 412 ms 57104 KB Output is correct
16 Correct 426 ms 57108 KB Output is correct
17 Correct 421 ms 57032 KB Output is correct
18 Correct 414 ms 57148 KB Output is correct
19 Correct 415 ms 57100 KB Output is correct
20 Correct 415 ms 57108 KB Output is correct
21 Correct 416 ms 56996 KB Output is correct
22 Correct 383 ms 53508 KB Output is correct
23 Correct 413 ms 53540 KB Output is correct
24 Correct 392 ms 53464 KB Output is correct
25 Correct 412 ms 53468 KB Output is correct
26 Correct 393 ms 53704 KB Output is correct
27 Correct 405 ms 53488 KB Output is correct
28 Correct 404 ms 53520 KB Output is correct
29 Correct 394 ms 53540 KB Output is correct
30 Correct 383 ms 53608 KB Output is correct
31 Correct 387 ms 53432 KB Output is correct
32 Correct 416 ms 53524 KB Output is correct
33 Correct 391 ms 53472 KB Output is correct
34 Correct 384 ms 53560 KB Output is correct
35 Correct 386 ms 53472 KB Output is correct
36 Correct 404 ms 53524 KB Output is correct
37 Correct 402 ms 53552 KB Output is correct
38 Correct 393 ms 53596 KB Output is correct
39 Correct 393 ms 53560 KB Output is correct
40 Correct 412 ms 53524 KB Output is correct
41 Correct 388 ms 53524 KB Output is correct
42 Correct 387 ms 53524 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 57152 KB Output is correct
2 Correct 411 ms 57108 KB Output is correct
3 Correct 408 ms 57176 KB Output is correct
4 Correct 407 ms 57152 KB Output is correct
5 Correct 404 ms 57108 KB Output is correct
6 Correct 410 ms 57108 KB Output is correct
7 Correct 407 ms 57116 KB Output is correct
8 Correct 419 ms 57108 KB Output is correct
9 Correct 460 ms 57108 KB Output is correct
10 Correct 416 ms 57236 KB Output is correct
11 Correct 411 ms 57108 KB Output is correct
12 Correct 430 ms 57124 KB Output is correct
13 Correct 403 ms 57172 KB Output is correct
14 Correct 418 ms 57136 KB Output is correct
15 Correct 412 ms 57104 KB Output is correct
16 Correct 426 ms 57108 KB Output is correct
17 Correct 421 ms 57032 KB Output is correct
18 Correct 414 ms 57148 KB Output is correct
19 Correct 415 ms 57100 KB Output is correct
20 Correct 415 ms 57108 KB Output is correct
21 Correct 416 ms 56996 KB Output is correct
22 Correct 383 ms 53508 KB Output is correct
23 Correct 413 ms 53540 KB Output is correct
24 Correct 392 ms 53464 KB Output is correct
25 Correct 412 ms 53468 KB Output is correct
26 Correct 393 ms 53704 KB Output is correct
27 Correct 405 ms 53488 KB Output is correct
28 Correct 404 ms 53520 KB Output is correct
29 Correct 394 ms 53540 KB Output is correct
30 Correct 383 ms 53608 KB Output is correct
31 Correct 387 ms 53432 KB Output is correct
32 Correct 416 ms 53524 KB Output is correct
33 Correct 391 ms 53472 KB Output is correct
34 Correct 384 ms 53560 KB Output is correct
35 Correct 386 ms 53472 KB Output is correct
36 Correct 404 ms 53524 KB Output is correct
37 Correct 402 ms 53552 KB Output is correct
38 Correct 393 ms 53596 KB Output is correct
39 Correct 393 ms 53560 KB Output is correct
40 Correct 412 ms 53524 KB Output is correct
41 Correct 388 ms 53524 KB Output is correct
42 Correct 387 ms 53524 KB Output is correct
43 Correct 414 ms 52116 KB Output is correct
44 Correct 397 ms 52880 KB Output is correct
45 Correct 415 ms 52884 KB Output is correct
46 Correct 430 ms 52824 KB Output is correct
47 Correct 418 ms 53008 KB Output is correct
48 Correct 410 ms 52932 KB Output is correct
49 Correct 437 ms 52988 KB Output is correct
50 Correct 388 ms 52884 KB Output is correct
51 Correct 397 ms 52892 KB Output is correct
52 Correct 399 ms 52828 KB Output is correct
53 Correct 418 ms 52880 KB Output is correct
54 Correct 398 ms 52952 KB Output is correct
55 Correct 412 ms 52820 KB Output is correct
56 Correct 421 ms 52956 KB Output is correct
57 Correct 398 ms 52884 KB Output is correct
58 Correct 402 ms 52892 KB Output is correct
59 Correct 399 ms 52852 KB Output is correct
60 Correct 411 ms 52768 KB Output is correct
61 Correct 396 ms 52884 KB Output is correct
62 Correct 407 ms 52872 KB Output is correct
63 Correct 396 ms 52884 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 57152 KB Output is correct
2 Correct 411 ms 57108 KB Output is correct
3 Correct 408 ms 57176 KB Output is correct
4 Correct 407 ms 57152 KB Output is correct
5 Correct 404 ms 57108 KB Output is correct
6 Correct 410 ms 57108 KB Output is correct
7 Correct 407 ms 57116 KB Output is correct
8 Correct 419 ms 57108 KB Output is correct
9 Correct 460 ms 57108 KB Output is correct
10 Correct 416 ms 57236 KB Output is correct
11 Correct 411 ms 57108 KB Output is correct
12 Correct 430 ms 57124 KB Output is correct
13 Correct 403 ms 57172 KB Output is correct
14 Correct 418 ms 57136 KB Output is correct
15 Correct 412 ms 57104 KB Output is correct
16 Correct 426 ms 57108 KB Output is correct
17 Correct 421 ms 57032 KB Output is correct
18 Correct 414 ms 57148 KB Output is correct
19 Correct 415 ms 57100 KB Output is correct
20 Correct 415 ms 57108 KB Output is correct
21 Correct 416 ms 56996 KB Output is correct
22 Correct 383 ms 53508 KB Output is correct
23 Correct 413 ms 53540 KB Output is correct
24 Correct 392 ms 53464 KB Output is correct
25 Correct 412 ms 53468 KB Output is correct
26 Correct 393 ms 53704 KB Output is correct
27 Correct 405 ms 53488 KB Output is correct
28 Correct 404 ms 53520 KB Output is correct
29 Correct 394 ms 53540 KB Output is correct
30 Correct 383 ms 53608 KB Output is correct
31 Correct 387 ms 53432 KB Output is correct
32 Correct 416 ms 53524 KB Output is correct
33 Correct 391 ms 53472 KB Output is correct
34 Correct 384 ms 53560 KB Output is correct
35 Correct 386 ms 53472 KB Output is correct
36 Correct 404 ms 53524 KB Output is correct
37 Correct 402 ms 53552 KB Output is correct
38 Correct 393 ms 53596 KB Output is correct
39 Correct 393 ms 53560 KB Output is correct
40 Correct 412 ms 53524 KB Output is correct
41 Correct 388 ms 53524 KB Output is correct
42 Correct 387 ms 53524 KB Output is correct
43 Correct 414 ms 52116 KB Output is correct
44 Correct 397 ms 52880 KB Output is correct
45 Correct 415 ms 52884 KB Output is correct
46 Correct 430 ms 52824 KB Output is correct
47 Correct 418 ms 53008 KB Output is correct
48 Correct 410 ms 52932 KB Output is correct
49 Correct 437 ms 52988 KB Output is correct
50 Correct 388 ms 52884 KB Output is correct
51 Correct 397 ms 52892 KB Output is correct
52 Correct 399 ms 52828 KB Output is correct
53 Correct 418 ms 52880 KB Output is correct
54 Correct 398 ms 52952 KB Output is correct
55 Correct 412 ms 52820 KB Output is correct
56 Correct 421 ms 52956 KB Output is correct
57 Correct 398 ms 52884 KB Output is correct
58 Correct 402 ms 52892 KB Output is correct
59 Correct 399 ms 52852 KB Output is correct
60 Correct 411 ms 52768 KB Output is correct
61 Correct 396 ms 52884 KB Output is correct
62 Correct 407 ms 52872 KB Output is correct
63 Correct 396 ms 52884 KB Output is correct
64 Runtime error 217 ms 86880 KB Execution killed with signal 11
65 Halted 0 ms 0 KB -