제출 #715687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715687		ovidiush11	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	49 ms	6968 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

#define ll long long

std::vector<int> find_subset(int p, int u, std::vector<int> a)
{
    vector<pair<ll,ll>> w(a.size());
    for(ll i = 0;i < a.size();i++)w[i] = {a[i],i};
    sort(w.begin(),w.end());
    ll l = 0,r = 0,s = 0;
    while(r < a.size())
    {
        s += w[r].first;
        while(s > u)
        {
            s -= w[l].first;
            l++;
        }
        if(s >= p && s <= u)
        {
            vector<int> ans;
            for(ll i = l;i <= r;i++)ans.push_back(w[i].second);
            return ans;
        }
        r++;
    }
    return {};
}

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

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

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