제출 #262190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262190		stoyan_malinin	Detecting Molecules (IOI16_molecules)	C++14	46 / 100	1089 ms	2556 KiB

molecules

#include "molecules.h"
//#include "grader.cpp"

#include <bitset>
#include <cstring>

using namespace std;

const int MAXN = 5e5 + 5;

int dp[MAXN];

void filterVector(vector <int> &v, int lim)
{
    vector <int> newVal;
    for(int x: v)
    {
        if(x<=lim) newVal.push_back(x);
    }

    v = newVal;
}

vector<int> find_subset(int l, int u, vector <int> w)
{
    memset(dp, -1, sizeof(dp));
    filterVector(w, u);

    dp[0] = -2;
    for(int i = 0;i<w.size();i++)
    {
        for(int j = u-w[i];j>=0;j--)
        {
            if(dp[j]!=-1 && dp[ j + w[i] ]==-1) dp[ j + w[i] ] = i;
        }
    }

    for(int i = l;i<=u;i++)
    {
        if(dp[i]!=-1)
        {
            vector <int> answer;

            int x = i;
            while(x!=0)
            {
                answer.push_back(dp[x]);
                x = x - w[ dp[x] ];
            }

            return answer;
        }
    }

    return vector <int> {};
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0;i<w.size();i++)
      |                   ~^~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31