제출 #472844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
472844		Erik_Gepard	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	296 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> find_subset(int ll, int uu, std::vector<int> w) {
    long long n=w.size();
    long long l=ll;
    long long u=uu;
    vector<pair<long long, long long> > a(w.size());
    for(long long i=0; i<w.size(); i++){
        a[i].first=w[i];
        a[i].second=i;
    }
    sort(a.begin(), a.end());
    long long sum=0;
    long long j=0;
    long long helyesi=-1, helyesj=-1;
    for(long long i=0; i<n; i++){
        while(sum<l && j<n){
            sum+=w[j];
            j++;
        }
        if(sum<=u && sum>=l){
            helyesi=i;
            helyesj=j;
        }
        sum-=a[i].first;
    }
    vector<int> ans;
    for(long long i=helyesi; i<helyesj; i++){
        ans.push_back(a[i].second);
    }
    if(helyesi!=-1) return ans;
    else return vector<int>(0);
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(long long i=0; i<w.size(); i++){
      |                        ~^~~~~~~~~

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