QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#742963 | #7941. Jackpot | anteon | WA | 43ms | 3696kb | C++23 | 368b | 2024-11-13 17:45:35 | 2024-11-13 17:45:36 |
Judging History
answer
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
long long s1 = 0, s2 = 0;
cin >> n;
int a[2 * n];
for (int i = 0; i < 2 * n; ++i) {
cin >> a[i];
}
for (int i = 0; i < 2 * n; i++) {
s1 += abs(a[i] - a[2*n -i-1]);
}
cout << s1/2<<'\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
input:
3 2 42 42 42 42 1 42 69 3 1 2 3 4 5 6
output:
0 27 9
result:
ok 3 number(s): "0 27 9"
Test #2:
score: -100
Wrong Answer
time: 43ms
memory: 3672kb
input:
47988 3 1 6 4 4 5 6 3 2 1 2 1 1 6 3 2 1 4 1 1 2 3 6 3 1 3 6 1 3 1 2 6 2 4 6 3 1 1 2 1 1 3 3 4 3 3 2 5 4 3 5 1 3 3 4 2 3 6 1 5 4 2 1 3 2 2 6 4 4 4 3 1 3 6 1 2 5 3 1 1 6 4 2 2 3 2 5 3 4 3 4 3 3 5 6 1 4 2 3 5 3 3 2 1 5 3 6 3 2 3 3 5 3 5 4 4 4 6 1 3 6 5 6 4 4 1 3 5 6 4 3 5 4 3 1 3 4 3 6 1 3 5 4 4 3 6 2 ...
output:
6 5 3 10 11 3 3 6 7 6 10 4 5 7 3 2 6 8 3 4 6 5 5 8 7 3 10 8 5 7 6 7 6 7 9 10 11 4 4 4 8 9 4 4 6 6 5 7 8 4 6 6 8 3 7 5 5 2 4 5 7 3 5 2 5 2 7 3 5 3 5 4 6 6 8 8 6 10 3 4 8 5 4 5 7 5 9 5 4 6 2 5 4 10 3 9 7 5 8 4 1 4 3 2 5 9 12 10 3 6 5 6 6 4 3 9 7 7 5 8 4 9 7 9 8 10 7 10 5 9 6 1 4 13 10 3 4 4 4 6 4 10 6...
result:
wrong answer 1st numbers differ - expected: '8', found: '6'