QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#348332#8340. 3 Sumucup-team206#WA 120ms14048kbC++171.6kb2024-03-09 17:55:162024-03-09 17:55:20

Judging History

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

  • [2024-09-20 10:20:30]
  • hack成功,自动添加数据
  • (/hack/848)
  • [2024-03-18 21:48:05]
  • hack成功,自动添加数据
  • (/hack/579)
  • [2024-03-18 21:45:33]
  • hack成功,自动添加数据
  • (/hack/578)
  • [2024-03-09 17:55:20]
  • 评测
  • 测评结果:WA
  • 用时:120ms
  • 内存:14048kb
  • [2024-03-09 17:55:16]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = (1ll << 61) - 1;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> val(n);
    for (int vi = 0; vi < n; ++vi) {
        static string s;
        static vector<int> a(k);
        cin >> s;
        fill(a.begin(), a.end(), 0);
        for (int i = s.size() - 1, j = 0; ~i; --i, j = (j + 1 == k ? 0 : j + 1)) {
            a[j] += s[i] - '0';
        }
        for (int i = 0; i + 1 < k; ++i) {
            int t = a[i] / 10;
            a[i + 1] += t;
            a[i] -= t * 10;
        } 
        while (a.back() >= 10) {
            int t = a.back() / 10;
            a[0] += t;
            a.back() -= t * 10;
            for (int i = 0; i + 1 < k; ++i) {
                int t = a[i] / 10;
                a[i + 1] += t;
                a[i] -= t * 10;
            } 
        }
        int sm = 0;
        for (int i = k - 1; ~i; --i) {
            sm = ((__int128)sm * 10 + a[i]) % mod;
        }
        val[vi] = sm;
    }
    int cnt0 = count(val.begin(), val.end(), 0);
    int ans = cnt0 * (cnt0 + 1) * (cnt0 + 2) / 6;
    unordered_map<int, int> mp;
    int S = 1;
    for (int i = 0; i < k; ++i) S = (__int128)S * 10 % mod;
    S = (S + mod - 1) % mod;
    for (int i = 0; i < n; ++i) {
        ++mp[val[i]];
        for (int j = i; j < n; ++j) {
            int tar1 = (S - val[i] - val[j] + 2 * mod) % mod;
            int tar2 = (S + tar1) % mod;
            ans += mp[tar1] + mp[tar2];
        }
    }
    cout << ans << endl;
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3632kb

input:

4 1
0
1
10
17

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 29ms
memory: 13740kb

input:

500 859
7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 120ms
memory: 14048kb

input:

500 17336
11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: -100
Wrong Answer
time: 26ms
memory: 3840kb

input:

500 1
751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...

output:

2277515

result:

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