QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#576465 | #8340. 3 Sum | guodong | WA | 72ms | 42904kb | C++14 | 850b | 2024-09-19 20:30:12 | 2024-09-19 20:30:12 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(x, l, r) for(int x = l; x <= r; x++)
#define repd(x, r, l) for(int x = r; x >= l; x--)
using namespace std;
typedef unsigned long long ull;
const int MAXN = 505;
const int MAXM = 2e4 + 5;
int a[MAXN][MAXM];
ull h[MAXN];
char st[MAXM];
int main(){
int n, m;
scanf("%d%d", &n, &m);
rep(i, 1, n){
scanf("%s", st);
int len = strlen(st);
repd(j, len, 1){
a[i][j] += st[j - 1] - '0';
if(j > m){
a[i][j - m] += a[i][j];
a[i][j] = 0;
}
}
repd(j, m, 1){
h[i] = h[i] * 10 + a[i][j];
}
}
ull c = 0;
rep(i, 1, m){
c = c * 10 + 9;
}
ull d = 2 * c;
int ans = 0;
rep(i, 1, n)
rep(j, i, n)
rep(k, j, n){
if(h[i] + h[j] + h[k] == 0 || h[i] + h[j] + h[k] == c || h[i] + h[j] + h[k] == d) ans++;
}
printf("%d\n", ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3804kb
input:
4 1 0 1 10 17
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 24ms
memory: 7828kb
input:
500 859 7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 48ms
memory: 42892kb
input:
500 17336 11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: -100
Wrong Answer
time: 72ms
memory: 42904kb
input:
500 1 751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...
output:
0
result:
wrong answer 1st numbers differ - expected: '2327631', found: '0'