제출 #524250

#제출 시각아이디문제언어결과실행 시간메모리
524250reniDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms204 KiB
#include "molecules.h" #include<iostream> #include<algorithm> #include<vector> #include<bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector< pair<int,int> > v; for(int i=0;i<w.size();i++) { v.push_back({w[i],i+1}); } sort(v.begin(),v.end()); vector< int > r; long long sum=0, i, j=0; for(i=0;i<v.size();i++) { sum+=v[i].first; if(sum>=l && sum<=u) { for(int d=j;d<=i;d++) { r.push_back(v[d].second); } return r; } if(sum>=l) { sum-=v[j].first; j++; } } return r; }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:17: 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++)
      |                ~^~~~~~~~~
molecules.cpp:20:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |    for(i=0;i<v.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...