oj.uz

Submission #88916

# Submission time Handle Problem Language Result Execution time Memory
88916 2018-12-09T19:33:28 Z heon Kas (COCI17_kas) C++11
40 / 100
 526 ms 198380 KB 
#include<bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
typedef vector <int> vi;
typedef pair<int,int> ii;
typedef long long ll;

const int MOD = 1e9 + 7;

vi v;
int dp[100005][505];

int f(int n, int ind, int diff, int sum){
	if(ind == n && diff != 0) return 0;
	if(ind == n && diff == 0) return sum;
	if(dp[diff][ind] != -1) return dp[diff][ind];
	return dp[diff][ind] = max({f(n, ind + 1, diff + v[ind], sum + v[ind]), f(n, ind + 1, abs(diff - v[ind]), sum + v[ind]),
							f(n, ind + 1, diff, sum)});
}


int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    v.resize(n);
    memset(dp, -1, sizeof(dp));
    for(int i = 0; i < n; i++){
    	cin >> v[i];
    }
    int sum = accumulate(all(v), 0);
    int ret = f(n, 0, 0, 0);
    cout << ret / 2 + (sum - ret);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 198008 KB Output is correct
2 Correct 171 ms 198248 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 192 ms 198248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 198248 KB Output is correct
2 Incorrect 160 ms 198248 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 166 ms 198248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 175 ms 198248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 198248 KB Output is correct
2 Correct 152 ms 198248 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 198248 KB Output is correct
2 Correct 174 ms 198248 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 313 ms 198300 KB Output is correct
2 Correct 184 ms 198300 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 198380 KB Output is correct
2 Incorrect 338 ms 198380 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 526 ms 198380 KB Output isn't correct
2 Halted 0 ms 0 KB -