제출 #424931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424931		Ahmadsm2005	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	57 ms	6164 KiB

molecules

#include "molecules.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
vector<int>find_subset(int l,int u,vector<int>w){
vector<int>ANS;
long long SUM=0;
int L=0;
vector<pair<int,int>>CRAP;
for(int i=0;i<w.size();i++)
CRAP.push_back({w[i],i});
sort(CRAP.begin(),CRAP.end());
for(int i=0;i<w.size();i++){
SUM+=CRAP[i].first;
while(SUM>u)
SUM-=CRAP[L].first,L++;
if(SUM>=l&&SUM<=u){
for(int l=L;l<=i;l++)
ANS.push_back(CRAP[l].second);
return ANS;
}
}
return ANS;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:14: 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:13:14: 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++){
      |             ~^~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31