Submission #1531596
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lli; typedef vector<lli> vll; typedef vector<bool> vbl; typedef vector<vector<lli> > mat; typedef vector<vector<bool> > matb; typedef vector<string> vst; typedef pair<lli,lli> pll; typedef pair<double,double> pdd; typedef vector<map<lli,lli>> graph; int n; vll s; lli sum; mat dp; int main(){ cin >> n; s = vll(n); for(lli i = 0;i < n;i++) cin >> s[i]; sum = accumulate(s.begin(), s.end(),0); dp = mat(n+1,vll(sum+1)); dp[0][0] = 1; for(lli i = 0;i < n;i++){ for(lli j = 0;j <= sum-s[i];j++){ dp[i+1][j] |= dp[i][j]; dp[i+1][j+s[i]] |= dp[i][j]; } } for(lli i = sum;i >= 0;i--){ if(dp[n][i] && i%10){ cout << i << endl; return 0; } } cout << 0 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | deoxy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 803 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 8192 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 7 ms | 8192 KB |
b06 | AC | 2 ms | 1920 KB |
b07 | AC | 4 ms | 4480 KB |
b08 | AC | 4 ms | 4224 KB |
b09 | AC | 5 ms | 6144 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 7 ms | 8192 KB |
b12 | AC | 4 ms | 4864 KB |