제출 #777748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777748		JoenPoenMan	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	297 ms	26988 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef unsigned long long int lli;
vector<vector<int>> dp;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    dp.resize(u+100);
    for (int i = 0; i < (int)w.size(); i++) {
        for (lli j = dp.size()-1; j > 0; j--) {
            if (dp[j].size() > 0 && j+w[i] <= u) {
                dp[j+w[i]] = dp[j];
                dp[j+w[i]].push_back(i);
                if (j+w[i] >= l) return dp[j+w[i]]; 
            }
        }
        dp[w[i]] = {(lli)i};
        if (w[i] >= l && w[i] <= u) return dp[w[i]];
    }
 
    return std::vector<int>(0);
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:13:44: warning: comparison of integer expressions of different signedness: 'lli' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
   13 |             if (dp[j].size() > 0 && j+w[i] <= u) {
      |                                     ~~~~~~~^~~~
molecules.cpp:16:28: warning: comparison of integer expressions of different signedness: 'lli' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
   16 |                 if (j+w[i] >= l) return dp[j+w[i]];
      |                     ~~~~~~~^~~~
molecules.cpp:19:21: warning: narrowing conversion of '(lli)i' from 'lli' {aka 'long long unsigned int'} to 'int' [-Wnarrowing]
   19 |         dp[w[i]] = {(lli)i};
      |                     ^~~~~~
molecules.cpp:19:21: warning: narrowing conversion of '(lli)i' from 'lli' {aka 'long long unsigned int'} to 'int' [-Wnarrowing]

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