제출 #788097

#제출 시각아이디문제언어결과실행 시간메모리
788097YassirSalamaDetecting Molecules (IOI16_molecules)C++14
100 / 100
43 ms6208 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; vector<int> v; int L,U,N; #define all(v) v.begin(),v.end() #define pb push_back vector<int> find_subset(int l, int u, vector<int> w) { vector<pair<int,int>> v; int n=w.size(); for(int i=0;i<w.size();i++){ v.pb({w[i],i}); } sort(all(v)); int i=0; int j=-1; ll ans=0; while(j<n){ if(l<=ans&&ans<=u){ vector<int> anns; for(int k=i;k<=j;k++) anns.pb(v[k].second); return anns; } j++; ans+=v[j].first; while(ans>u){ ans-=v[i].first; i++; } } 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:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     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...