제출 #867171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867171		StefanL2005	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	0 ms	348 KiB

molecules

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
#define ll long long

vector<int> find_subset(int l, int u, vector<int> w)
{
    set<int> Set;
    int n = w.size();
    vector<int> result;
    sort(w.begin(), w.end());
 
    if(l < w[0])
        return result;
    if (l - u < w[n-1] - w[0])
        return result;

    ll sum = 0;
    int i = 0;
    for (i; i < n; i++)
    {
        if (sum + w[i] > l)
            break;
        
        sum+= w[i];
        Set.insert(w[i]);
        
    }

    int dif = l - sum;

    while (i < n && !(u <= sum && sum <= l))
    {
        auto poz = Set.lower_bound(w[i] - dif);
        if (poz == Set.end())
            break;
 
        sum= sum - *poz + w[i];
        Set.erase(poz);
        Set.insert(w[i]);
        i++;
    }
 
    if (u <= sum && sum <= l)
    {
        auto p = Set.begin();
        for(i = 0; i < n; i++)
            if (w[i] == *p)
            {
                result.push_back(i);
                Set.erase(p);
                p = Set.begin();
            }
    }
    
    return result;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:23:10: warning: statement has no effect [-Wunused-value]
   23 |     for (i; i < n; i++)
      |          ^

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