제출 #740504

#제출 시각아이디문제언어결과실행 시간메모리
740504JakobZorzDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms212 KiB
#include "molecules.h" #include <algorithm> using namespace std; #define ll long long vector<int> find_subset(int l, int u, vector<int> w) { int sum=0; vector<pair<int,int>> w2; for(int i=0;i<w.size();i++) w2.push_back({w[i],i+1}); sort(w2.begin(),w2.end()); int m1=0; for(int m2=0;m2<w.size();m2++){ sum+=w2[m2].first; while(sum>u){ sum-=w2[m1].first; m1++; } if(sum>=l){ vector<int> res; for(int i=m1;i<=m2;i++) res.push_back(w2[i].second); return res; } } return {}; }

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

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