제출 #539169

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
539169		astoria	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	71 ms	6184 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int N = w.size();
    vector<pair<int,int> > wni;
    for (int i=0; i<N; i++){
        wni.push_back(make_pair(w[i],i));
    }
    sort(wni.begin(), wni.end());
    long long sum = 0;
    int leftbound=0;
    vector<int> finalelements;
    for (int i=0; i<w.size(); i++){
        sum += wni[i].first;
        if (sum >= l && sum <= u){
            for (int j=leftbound; j<=i; j++){
                finalelements.push_back(wni[j].second);
            }
            return finalelements;
        }
        if (sum > u){
            sum -= wni[leftbound].first;
            leftbound++;
            if (sum>=l && sum<=u){
                for (int j=leftbound; j<=i; j++){
                    finalelements.push_back(wni[j].second);
                }
                return finalelements;
            }
        }
    }
    
    return finalelements;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     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