제출 #1002010

#제출 시각아이디문제언어결과실행 시간메모리
1002010vjudge1Detecting Molecules (IOI16_molecules)C++17
19 / 100
1 ms604 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int>ans;
    vector<pair<ll, ll>>v;
    ll n=w.size();
    for(int i=0; i<w.size(); i++){
        v.push_back({w[i], i});
    }
    ll k=0;
    ll r=1, sum=v[0].first;
    sort(v.begin(), v.end());
    while(k<n){
        while(r<n && sum<l){
            sum+=v[r++].first;
        }
        if(sum>=l && sum<=u){
            for(int j=k; j<r; j++){
                ans.push_back(v[j].second);
                //cout<<v[j].second<<' ';

            }
            return ans;
        }
        sum-=v[k].first;;
        k++;
    }
    return  ans;
}
/*
{} []
7
13 14
2 2 3 3 3 4 4
*/

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

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