oj.uz

Submission #23082

# Submission time Handle Problem Language Result Execution time Memory
23082 2017-05-02T16:24:23 Z model_code Kas (COCI17_kas) C++14
100 / 100
 236 ms 99760 KB 
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 505;
const int MAXS = 100010; 
const int INF  = 1e9;

int n, sum, sol;
int c[MAXN], memo[MAXN][MAXS/2];

int rek(int pos, int diff) {

  if (diff > sum / 2) 
    return -INF;

  int& memo_ref = memo[pos][diff];

  if (memo_ref != -1)
    return memo_ref;

  if (pos == n)
    return memo_ref = (diff != 0) * (-INF);

  return memo_ref = max(rek(pos + 1, diff), 
                    max(rek(pos + 1, diff + c[pos]) + c[pos], 
                        rek(pos + 1, abs(diff - c[pos])) + max(0, c[pos] - diff)));

}

int main(void) {
 
  memset(memo, -1, sizeof memo);

  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &c[i]);
    sum += c[i];
  }

  sol = rek(0, 0);
  sol += sum - 2 * sol;

  printf("%d\n", sol);

  return 0;

}

Compilation message

kas.cpp: In function 'int main()':
kas.cpp:37:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
kas.cpp:39:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &c[i]);
                       ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 99760 KB Output is correct
2 Correct 13 ms 99760 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 99760 KB Output is correct
2 Correct 0 ms 99760 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 99760 KB Output is correct
2 Correct 6 ms 99760 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 99760 KB Output is correct
2 Correct 3 ms 99760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 99760 KB Output is correct
2 Correct 3 ms 99760 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 99760 KB Output is correct
2 Correct 3 ms 99760 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 99760 KB Output is correct
2 Correct 6 ms 99760 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 99760 KB Output is correct
2 Correct 19 ms 99760 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 99760 KB Output is correct
2 Correct 139 ms 99760 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 99760 KB Output is correct
2 Correct 236 ms 99760 KB Output is correct