제출 #600120

#제출 시각아이디문제언어결과실행 시간메모리
600120HazemDetecting Molecules (IOI16_molecules)C++14
100 / 100
57 ms6168 KiB
#include "bits/stdc++.h"

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {

    vector<pair<int,int>>vec;
    for(int i=0;i<w.size();i++)
        vec.push_back({w[i],i});

    sort(vec.begin(),vec.end());
    
    int L = 0,R = 0;
    long long sum = vec[0].first;
    
    vector<int>ans;
    while(R<vec.size()){
        if(sum>=l&&sum<=u){
            for(int i=L;i<=R;i++)
                ans.push_back(vec[i].second);
            break;
        }

        if(sum<l)
            sum += vec[++R].first;
        else 
            sum -= vec[L++].first;
    }

    sort(ans.begin(),ans.end());
    return ans;
}

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

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