QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#348549#8340. 3 Sumucup-team3215#WA 90ms3856kbC++20878b2024-03-09 19:29:002024-03-09 19:29:01

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 19:29:01]
  • 评测
  • 测评结果:WA
  • 用时:90ms
  • 内存:3856kb
  • [2024-03-09 19:29:00]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

constexpr uint64_t mod = 934871235482355131;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, k; cin >> n >> k;
  vector<uint64_t> a(n);
  vector<int> v;
  for (string s; auto& a: a) {
    cin >> s;
    reverse(s.begin(), s.end());
    v.assign(k, 0);
    for (int i = 0; i < s.size(); ++i) v[i % k] += s[i] - '0';
    for (int c = 0; auto& x: v) c += x, x = c % 10, c /= 10;
    reverse(v.begin(), v.end());
    if (*min_element(v.begin(), v.end()) != 9)
    for (auto& c: v) a = (a * 10 + c) % mod;
  }
  uint64_t m = 0, m2;
  int ans = 0;
  while (k--) m = (m * 10 + 9) % mod;
  m2 = 2 * m % mod;
  for (auto& x: a)
  for (auto& y: a) if (&y > &x) break; else
  for (auto& z: a) if (&z > &y) break; else ans += x + y + z == 0 || x + y + z == m || x + y + z == m2;
  cout << ans << '\n';
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 1
0
1
10
17

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 26ms
memory: 3856kb

input:

500 859
7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 90ms
memory: 3656kb

input:

500 17336
11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: -100
Wrong Answer
time: 46ms
memory: 3628kb

input:

500 1
751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...

output:

2361532

result:

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