oj.uz

답안 #427909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427909 2021-06-15T04:50:23 Z Amylopectin Knapsack (NOI18_knapsack) C++14
0 / 100
 1 ms 340 KB 
#include <iostream>
#include <stdio.h>
using namespace std;
const int mxn = 1e3 + 10;
int ta[mxn] = {},nru[mxn] = {},chc[mxn] = {};
int fima(int l,int r)
{
    if(l > r)
        return l;
    return r;
}
int main()
{
    int i,j,n,m,cva,cwe,cco,cma = 0;
    scanf("%d %d",&m,&n);
    for(i=0; i<n; i++)
    {
        scanf("%d %d %d",&cva,&cwe,&cco);

        for(j=cwe; j<=m; j++)
        {
            if(chc[j-cwe] == cco)
            {
//                nru[j] = fima(ta[j-(cco * cwe)] + (cco * cva), ta[j]);
                if(ta[j-(cco * cwe)] + (cco * cva) > ta[j])
                {
                    nru[j] = ta[j-(cco * cwe)] + (cco * cva);
                    chc[j] = cco;
                }
                else
                {
                    nru[j] = ta[j];
                }
//                chc[j] = cco;
            }
            else
            {
//                nru[j] = fima(, ta[j]);
                if(nru[j-cwe] + cva > ta[j])
                {
                    nru[j] = nru[j-cwe] + cva;
                    chc[j] = chc[j-cwe] + 1;
                }
                else
                {
                    nru[j] = ta[j];
                }
            }
        }
        for(j=cwe; j<=m; j++)
        {
            chc[j] = 0;
            ta[j] = nru[j];
            nru[j] = 0;
        }
    }
    for(i=0; i<=m; i++)
    {
        cma = fima(cma,ta[i]);
    }
    printf("%d\n",cma);
    return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d %d",&m,&n);
      |     ~~~~~^~~~~~~~~~~~~~~
knapsack.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf("%d %d %d",&cva,&cwe,&cco);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -