제출 #788004

#제출 시각아이디문제언어결과실행 시간메모리
788004YassirSalamaDetecting Molecules (IOI16_molecules)C++14
46 / 100
277 ms27348 KiB
#include "molecules.h" #include<bits/stdc++.h> using namespace std; #define ll long long #define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl; const int MAXM=20000; vector<vector<int>> dp(MAXM); vector<int> v; int L,U,N; void find(int x){ } vector<int> find_subset(int l, int u, vector<int> w) { L=l; U=u; v=w; N=w.size(); dp[0].push_back({0}); for(int i=0;i<N;i++){ for(int j=u;j>=v[i];j--){ if(dp[j-v[i]].size()){ dp[j]=dp[j-v[i]]; dp[j].push_back(i); if(j>=l) { vector<int> ans; for(int k=1;k<dp[j].size();k++) ans.push_back(dp[j][k]); return ans; } } } } return vector<int>(0); } // int main() { // int n, l, u; // assert(3 == scanf("%d %d %d", &n, &l, &u)); // std::vector<int> w(n); // for (int i = 0; i < n; i++) // assert(1 == scanf("%d", &w[i])); // std::vector<int> result = find_subset(l, u, w); // printf("%d\n", (int)result.size()); // for (int i = 0; i < (int)result.size(); i++) // printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]); // }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:27:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |                     for(int k=1;k<dp[j].size();k++) ans.push_back(dp[j][k]);
      |                                 ~^~~~~~~~~~~~~
#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...