제출 #1037325

#제출 시각아이디문제언어결과실행 시간메모리
1037325biserailievaDetecting Molecules (IOI16_molecules)C++14
100 / 100
36 ms8248 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define ll long long std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<int> ans; vector<pair<ll, ll>> v; ll n=w.size(); for(int i=0; i<w.size(); i++) { v.push_back({w[i], i}); } sort(v.begin(), v.end()); ll i=0, j=0, sum=0; while(j<n && i<n) { while(j<n && sum<l) { sum+=v[j++].first; } if(sum>=l && sum<=u && v[j-1].first-v[i].first<=u-l) { for(int k=i; k<j; k++) { ans.push_back(v[k].second); } return ans; } sum-=v[i].first; if(sum>=l && sum<=u && v[j-1].first-v[i+1].first<=u-l) { for(int k=i+1; k<j; k++) { ans.push_back(v[k].second); } return ans; } i++; } return ans; }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     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...