제출 #319593

#제출 시각아이디문제언어결과실행 시간메모리
319593knon0501Detecting Molecules (IOI16_molecules)C++14
100 / 100
52 ms6360 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int> ans;
    vector<pair<int,int>> a;
    for(int i=0 ; i<w.size() ; i++)a.push_back({w[i],i});
    sort(a.begin(),a.end(),[&](pair<int,int> x,pair<int,int> y){
            return x.first>y.first;
         });
    int idx=0;
    for(auto k: w){
        if(k>=l && k<=u){
            ans={idx};
            return ans;
        }
        idx++;
    }
    long long s=0;

    int n=w.size();

    int j=0;

    for(int i=0 ; i<n ; i++){
        while(s<l && j<n){
            s+=a[j].first;
            j++;
        }
        if(s<=u && s>=l){
            for(int k=i ; k<j ; k++)ans.push_back(a[k].second);
            sort(ans.begin(),ans.end());
            return ans;
        }

        s-=a[i].first;
    }
    return {};
}

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

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