제출 #1015609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015609		Unforgettablepl	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	436 KiB

molecules

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

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<pair<int,int>> arr;
    for(int i=0;i<w.size();i++)arr.emplace_back(w[i],i);
    sort(arr.begin(),arr.end());
    int n = arr.size();
    int totsum = 0;
    for(auto[a,b]:arr)totsum+=a;
    map<int,int> lookup;
    lookup[0]=n;
    int currsum = totsum;
    for(int i=n-1;i>=0;i--){
        auto it1 = lookup.lower_bound(l-currsum);
        auto it2 = lookup.upper_bound(u-currsum);
        currsum-=arr[i].first;
        lookup[totsum-currsum]=i;
        if(it1==it2)continue;
        int ix = it1->second;
        vector<int> ans;
        for(int j=0;j<=i;j++)ans.emplace_back(arr[j].second);
        for(int j=ix;j<n;j++)ans.emplace_back(arr[j].second);
        return ans;
    }
    return {};
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:6:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for(int i=0;i<w.size();i++)arr.emplace_back(w[i],i);
      |                 ~^~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31