Task: | Apple Division |
Sender: | aalto2024a_009 |
Submission time: | 2024-09-04 17:22:12 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | ACCEPTED | 0.00 s | details |
#7 | WRONG ANSWER | 0.01 s | details |
#8 | WRONG ANSWER | 0.01 s | details |
#9 | WRONG ANSWER | 0.01 s | details |
#10 | WRONG ANSWER | 0.01 s | details |
#11 | WRONG ANSWER | 0.01 s | details |
#12 | WRONG ANSWER | 0.01 s | details |
#13 | ACCEPTED | 0.00 s | details |
#14 | ACCEPTED | 0.00 s | details |
#15 | ACCEPTED | 0.00 s | details |
#16 | ACCEPTED | 0.00 s | details |
#17 | WRONG ANSWER | 0.01 s | details |
#18 | ACCEPTED | 0.01 s | details |
Code
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; #define F first #define S second #define PB push_back #define MP make_pair #define REP(i,a,b) for (int i = a; i < b; i++) // const int N = 60000; // ll inputs[N]; int solve(vector<ll> &weights, int idx, int n, ll sum) { ll w = weights[idx]; if(idx == n-1) { ll a = llabs(sum + w); ll b = llabs(sum - w); if(a < b) { return a; } else { return b; } } else { ll incl = solve(weights, idx + 1, n, (ll)(sum + w)); ll excl = solve(weights, idx + 1, n, (ll)(sum - w)); if(incl < excl) { return incl; } else { return excl; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<ll> inputs(n); REP(i, 0, n) { cin >> inputs[i]; } ll sum = 0; ll minim = solve(inputs, 0, n, sum); cout << minim << "\n"; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 603 324 573 493 659 521 654 70... |
correct output |
---|
2 |
user output |
---|
2 |
Test 2
Verdict: ACCEPTED
input |
---|
10 952 775 292 702 859 719 65 943... |
correct output |
---|
1 |
user output |
---|
1 |
Test 3
Verdict: ACCEPTED
input |
---|
10 141 156 14 487 250 230 741 602... |
correct output |
---|
2 |
user output |
---|
2 |
Test 4
Verdict: ACCEPTED
input |
---|
10 963 359 731 826 599 931 40 86 ... |
correct output |
---|
4 |
user output |
---|
4 |
Test 5
Verdict: ACCEPTED
input |
---|
10 238 224 861 461 558 860 318 93... |
correct output |
---|
2 |
user output |
---|
2 |
Test 6
Verdict: ACCEPTED
input |
---|
10 193 848 70 53 864 886 374 31 2... |
correct output |
---|
1 |
user output |
---|
1 |
Test 7
Verdict: WRONG ANSWER
input |
---|
20 13048212 423374770 19874608 81... |
correct output |
---|
8231 |
user output |
---|
-2147472943 |
Test 8
Verdict: WRONG ANSWER
input |
---|
20 314836307 815098885 922742346 ... |
correct output |
---|
1188 |
user output |
---|
-2147430472 |
Test 9
Verdict: WRONG ANSWER
input |
---|
20 846261131 196958704 824235264 ... |
correct output |
---|
11770 |
user output |
---|
-2147460044 |
Test 10
Verdict: WRONG ANSWER
input |
---|
20 92021619 792314463 937735495 8... |
correct output |
---|
4453 |
user output |
---|
-2147472941 |
Test 11
Verdict: WRONG ANSWER
input |
---|
20 452747515 202201476 845758891 ... |
correct output |
---|
4881 |
user output |
---|
-2147478831 |
Test 12
Verdict: WRONG ANSWER
input |
---|
20 934033764 747013925 113297529 ... |
correct output |
---|
5482 |
user output |
---|
-2147448608 |
Test 13
Verdict: ACCEPTED
input |
---|
1 1000000000 |
correct output |
---|
1000000000 |
user output |
---|
1000000000 |
Test 14
Verdict: ACCEPTED
input |
---|
2 1 1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 15
Verdict: ACCEPTED
input |
---|
1 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 16
Verdict: ACCEPTED
input |
---|
5 934033764 2 7 4 1 |
correct output |
---|
934033750 |
user output |
---|
934033750 |
Test 17
Verdict: WRONG ANSWER
input |
---|
20 934033764 747013925 113297529 ... |
correct output |
---|
5483 |
user output |
---|
-2147448607 |
Test 18
Verdict: ACCEPTED
input |
---|
19 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1 |
user output |
---|
1 |