제출 #8010

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
8010	2014-08-27 05:46:21	paulsohn	앱 (KOI13_app)	C++98	21 / 21	0 ms	4996 KiB

app

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
int N, M, m[100] = { 0 }, c[100] = { 0 };
int maxmem[100][10001] = { 0 };
int main(){
  int totalc = 0, minc;
  scanf("%d %d", &N, &M);
  for (int i = 0; i < N; ++i){
    scanf("%d", &m[i]);
  }
  for (int i = 0; i < N; ++i){
    scanf("%d", &c[i]);
    totalc += c[i];
  }
  maxmem[0][c[0]] = m[0];
  for (int i = 1; i < N; ++i){
    for (int cost = 0; cost <= totalc; ++cost){
      int used=0, unused;
      if (cost>c[i] && maxmem[i - 1][cost - c[i]]){
        used = maxmem[i - 1][cost - c[i]] + m[i];
      }
      else if (cost == c[i]){
        if(used < m[i])
          used=m[i];
      }
      unused = maxmem[i-1][cost];
      maxmem[i][cost] = (used > unused ? used : unused);
    }
  }
  for (minc = 0; minc <= totalc; ++minc){
    if (maxmem[N - 1][minc] >= M) break;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3.15 / 3.15
• Subtask 2: 3.15 / 3.15
• Subtask 3: 3.15 / 3.15
• Subtask 4: 3.15 / 3.15
• Subtask 5: 3.15 / 3.15
• Subtask 6: 3.15 / 3.15
• Subtask 7: 2.1 / 2.1