(I2
I50
I5
(dp0
Vnecklace.%l
p1
(Vnecklace.cpp
p2
S"#include <iostream>\r\n#include <algorithm>\r\n#include <cstring>\r\nusing namespace std;\r\n\r\nint n, k;\r\nchar s[100001], c[2];\r\nint a[27][667], br[27], sum;\r\n\r\nint main ( )\r\n{\r\n    cin >> n >> k;\r\n    cin >> s;\r\n    for (int i = 0; i < strlen (s); i ++)\r\n    {\r\n        int l = s[i] - 'a';\r\n        a[l][br[l]] = i;\r\n        br[l] ++;\r\n    }\r\n    for (int i = 0; i < k; i ++)\r\n    {\r\n        cin >> c;\r\n        int l = c[0] - 'a';\r\n        int r = c[1] - 'a';\r\n        if (l == r)\r\n        {\r\n            sum += br[r] * (br[r] - 1) / 2;\r\n        }\r\n        else\r\n        {\r\n            for (int j = 0; j < br[l]; j ++)\r\n            {\r\n                int* p = lower_bound (a[r], a[r] + br[r], a[l][j]);\r\n                sum += br[r] - (p - a[r]);\r\n            }\r\n        }\r\n\r\n    }\r\n    cout << sum << endl;\r\n    return 0;\r\n}\r\n"
p3
tp4
stp5
.