Submission #1183786

#TimeUsernameProblemLanguageResultExecution timeMemory
1183786PakinDioxideKas (COCI17_kas)C++17
70 / 100
239 ms392624 KiB
/* author : PakinDioxide created : 11/04/2025 23:53 task : COCI17_kas */ #include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0); int n; cin >> n; ll a[n+1], s = 0; for (int i = 1; i <= n; i++) cin >> a[i], s += a[i]; ll dp[n+1][100005]; for (int i = 0; i <= 100000; i++) dp[0][i] = LLONG_MIN; dp[0][0] = 0; for (int i = 1; i <= n; i++) { for (int j = 100000; j >= 0; j--) dp[i][j] = max({dp[i-1][j], (j+a[i] <= 100000 ? dp[i-1][j+a[i]] + a[i] : LLONG_MIN), (j-a[i] >= 0 ? dp[i-1][j-a[i]] : LLONG_MIN)}); } cout << s - dp[n][0] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...