Submission #262183

#TimeUsernameProblemLanguageResultExecution timeMemory
262183stoyan_malininDetecting Molecules (IOI16_molecules)C++14
46 / 100
164 ms640 KiB
#include "molecules.h" //#include "grader.cpp" #include <bitset> #include <cstring> using namespace std; const int MAXN = 1e4 + 5; int dp[MAXN]; vector<int> find_subset(int l, int u, vector <int> w) { memset(dp, -1, sizeof(dp)); 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> {}; }

Compilation message (stderr)

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