제출 #849108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
849108		abcvuitunggio	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	38 ms	6352 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector <pair <int, int>> v;
vector <int> res;
vector <int> find_subset(int l, int u, vector<int> w){
    for (int i=0;i<w.size();i++)
        v.push_back({w[i],i});
    sort(v.begin(),v.end());
    int lo=w.size()+1,hi=w.size(),sum=0,pos=0;
    for (int i=0;i<v.size();i++){
        if (sum>u-v[i].first){
            hi=i;
            break;
        }
        sum+=v[i].first;
    }
    sum=0;
    for (int i=v.size()-1;i>=0;i--){
        if (sum>=l-v[i].first){
            lo=v.size()-i;
            break;
        }
        sum+=v[i].first;
    }
    if (lo>hi)
        return {};
    sum=0;
    for (int i=0;i<lo;i++)
        sum+=v[i].first;
    if (sum<l){
        for (int i=lo;i<v.size();i++){
            if (sum>=l-v[i].first+v[i-lo].first){
                pos=i-lo+1;
                break;
            }
            sum+=v[i].first-v[i-lo].first;
        }
    }
    for (int i=pos;i<pos+lo;i++)
        res.push_back(v[i].second);
    sort(res.begin(),res.end());
    return res;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:7:19: 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++)
      |                  ~^~~~~~~~~
molecules.cpp:11:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (int i=0;i<v.size();i++){
      |                  ~^~~~~~~~~
molecules.cpp:32:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for (int i=lo;i<v.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