QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#433136#6635. Strange Keyboarducup-team3215WA 223ms129400kbC++232.3kb2024-06-08 04:45:392024-06-08 04:45:40

Judging History

你现在查看的是最新测评结果

  • [2024-06-08 04:45:40]
  • 评测
  • 测评结果:WA
  • 用时:223ms
  • 内存:129400kb
  • [2024-06-08 04:45:39]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
#define int long long
constexpr int INF = 5e9+ 7;

struct node {
    map<char, node *> go;
    int val{INF};

    bool can(char c) {
        return go.count(c);
    }
};

void solve() {
    int n, k;
    cin >> n >> k;
    vector<string> a(n);
    vector<int> best(k, INF);
    best[0] = 0;
    for (auto &s: a) {
        cin >> s;
        int re = s.size() % k;
        best[re] = min(best[re], (int) s.size() / k + 1);
    }
    vector<pair<int, int>> e;
    int mx = 0;
    for (int re = 0; re < k; ++re) {
        if (best[re] < INF) {
            mx = max(mx, best[re]);
            e.push_back({re, best[re]});
        }
    }
    mx += 2;
    vector<int> d(k, INF);
    vector<char> used(k, 0);
    d[0] = 0;
    int pos = 0, have = 1;
    vector<queue<int>> q(mx);
    q[0].push(0);
    while (have) {
        while (q[pos % mx].empty())++pos;
        int v = q[pos % mx].front();
        q[pos % mx].pop();
        --have;
        if (used[v])continue;
        used[v] = 1;
        for (auto [re, w]: e) {
            w += (re + v) >= k;
            int to = (re + v) % k;
            if (d[to] > d[v] + w) {
                d[to] = d[v] + w;
                q[d[to] % mx].push(to);
                ++have;
            }
        }
    }

    node *root = new node;
    root->val = 0;
    for (const auto &s: a) {
        node *cur = root;
        for (int i = 0; i < s.size(); ++i) {
            if (!cur->can(s[i])) {
                cur->go[s[i]] = new node;
            }
            cur = cur->go[s[i]];
            int z = (ssize(s) - i - 1);
            int x = (-z % k + k) % k;
            int cost = d[x] + (z + x) / k;
            cur->val = min(cur->val, cost + 1);
        }
    }
    string s;
    cin >> s;
    int t = s.size();
    vector<int> dp(t + 1, INF);
    dp[t] = 0;
    for (int i = t - 1; ~i; --i) {
        node *cur = root;
        for (int j = i; j < t; ++j) {
            if (!cur->can(s[j]))break;
            cur = cur->go[s[j]];
            dp[i] = min(dp[i], cur->val + dp[j + 1]);
        }
    }
    cout << (dp[0] < INF ? dp[0] : -1) << "\n";
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)solve();
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3544kb

input:

2
2 3
defgh
abc
abcde
1 1
a
b

output:

3
-1

result:

ok 2 number(s): "3 -1"

Test #2:

score: 0
Accepted
time: 27ms
memory: 5196kb

input:

1
1413 4867
yumnkkghwtqnhpmmsbfwypcwudihegsvtdaykueuqozagpgdnhbwzoqrqswyctzonwmjdjmmpyzbyihhpyznmqltcuckqmcybbdafoexqztxhzlfjowznisnxtgoiqjztogldyegajmegalqgawrzotuntocmsagvkzdnwhmaewuxiuhvintpzwyrkgapnmegpveyuuorrfvrfakjyetfaoqtvwghlslsvmahrkvzkwpaviufknrpuapicqdnn
yumnkkghwtqnhpmmsbfwypcwudihegsvt...

output:

10

result:

ok 1 number(s): "10"

Test #3:

score: 0
Accepted
time: 76ms
memory: 4316kb

input:

10
446 4905
afigcjhcgagabbiccehjcjajigghgbjjadccicghggijjdfeciaccgheedjdhgfjdfdbgidbbdjaiehhceeehchhabhaideggjbjajgfgicfdggahhbjgdebccbgbiedhehaebdccdfdffaacjcfbgjeegbahhbgcdjigijajheidchbddicehhhjbeiaajgedhdcjiefdgdbjjfaegheeidieheecaicciaajbabiidcecefgiicccdidegeica
afigcjhcgagabbiccehjcjajigghgbj...

output:

3
2
2
11
6
5
1
1
1
1

result:

ok 10 numbers

Test #4:

score: 0
Accepted
time: 223ms
memory: 5548kb

input:

100
140 4879
baabaababbababbaabababaaababbbabbbbbbabbababbbabbbbabbbbbbaabbbbbbbbabaabbbaabaabbbaabbabaabaabbbabbbababbbaabbabaaaaabbaaabbbabb
baa
baabaababbababbaabababaaababbbabbbbbbabbab
baabaababbababbaabababaaabab
baabaababbababbaabababaaababbbabbb
baabaababbababbaabababaaababbbabbbbbbabbababbb...

output:

1
1
1
1
3
1
1
1
1
1
1
3
2
1
1
1
2
1
1
2
1
1
1
1
1
1
1
1
1
4
3
2
1
2
1
1
1
1
1
2
1
1
1
3
1
1
1
2
1
1
1
2
3
1
1
1
2
1
1
1
1
1
1
1
1
3
2
3
1
3
1
1
2
1
2
3
2
1
1
1
3
2
1
2
1
1
1
1
1
1
1
1
1
1
1
1
2
1
4
1

result:

ok 100 numbers

Test #5:

score: 0
Accepted
time: 78ms
memory: 39212kb

input:

1
7 4864
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

205

result:

ok 1 number(s): "205"

Test #6:

score: 0
Accepted
time: 43ms
memory: 123356kb

input:

10
7 4923
baaabbabbbabbbbbabaabaabababbabbaaaabbaaabbbbabbaaababaaaaabaaabbabbbabbaaaabbaabbbaabbaaababaaababbabaababbaababbabaaabaabbaaabaaaababbabbabaabaabaabaabbbbaabaabbbaababbabbabaaaabbbaabbbaaaabaaaaababbaabaaaaababbbbaaaabbbaababbaabbabaabaaaaababaababaabaaaaabababababbabbbabababaaabaababbaa...

output:

4287
228
3671
549
129
372
475
534
336
288

result:

ok 10 numbers

Test #7:

score: 0
Accepted
time: 88ms
memory: 80308kb

input:

100
7 4807
abbababaababbaabbabbaabaababbaaababaabaaabbaaaabababbbaabbaaabababbaabaabbaaaaabbbbaabbbaaabbbbabaabbbaaaaabbbaabbaaaabbaaababbaaabbbbabaabbababababbbabaaabaaaabbbbabbabbbbbaabaaabaababbabaaabbaabbabbabaaababbbabbabbbaababaabaaaabaaabbbbabbaabaababbbabbbbaaaabbabbbaabbaabbbbb
aaaaababaaab...

output:

45
32
11
4
2475
132
50
330
20
6
99
25
126
6
4
14
74
108
208
11
5
67
166
2822
178
1307
548
92
386
493
279
2415
255
262
567
215
46
113
31
651
17
4
8
21
12
100
69
152
15
55
521
146
11
13
181
-1
442
1839
2
5
31
26
122
696
280
77
1
839
11
273
7
178
421
228
6
6
82
116
1
-1
293
519
5
160
15
126
13
31
619
4...

result:

ok 100 numbers

Test #8:

score: -100
Wrong Answer
time: 47ms
memory: 129400kb

input:

1
1 5000
abaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

-1

result:

wrong answer 1st numbers differ - expected: '5023990000', found: '-1'