제출 #802841

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

molecules

#include "molecules.h"

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

#define MAX_N 200001
#define ALL(x) x.begin(), x.end()
#define loop(x) for (int i = 0; i < (x); i++)
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef set<int> si;

vi find_subset(int l, int u, vi w)
{
    vii sortedMolecules; // first weight, second real index
    loop(w.size())
    {
        if (w[i] > u)
            continue;
        sortedMolecules.push_back({w[i], i});
    }
    sort(ALL(sortedMolecules));
    si used;
    bitset<MAX_N> usin;
    int totalW = 0;
    while (totalW < l)
    {
        bool added = false;
        for (int i = sortedMolecules.size() - 1; i >= 0; i--)
        {
            if (usin[i])
                continue;
            int W = sortedMolecules[i].first; // weight, real index
            if (totalW + W > u)
            {
                continue;
            }
            added = true;
            used.insert(i);
            usin[i] = true;
            totalW += W;
        }
        if (!added)
            break;
    }
    if (totalW >= l)
    {
        vi indexesOfUsedMols;
        for (int i : used)
        {
            indexesOfUsedMols.push_back(sortedMolecules[i].second);
        }
        return indexesOfUsedMols;
    }
    if (sortedMolecules.size() < 1)
        return {};
    const auto &[W, ix] = sortedMolecules[0];
    used.insert(0);
    totalW += W;
    usin[0] = true;
    si oldUsed(used);            // sorted indexes
    bitset<MAX_N> oldUsin(usin); // sorted indexes
    int oldW = totalW;
    for (int i1 = 0; i1 < sortedMolecules.size(); i1++)
    {
        if (usin[i1])
            continue;
        ii p1 = sortedMolecules[i1];
        for (int i2 : oldUsed)
        {
            ii p2 = sortedMolecules[i2];
            used = oldUsed;
            used.erase(i2);
            used.insert(i1);
            totalW = oldW - p2.first + p1.first;
            if (totalW > u)
                continue;
            while (totalW < l)
            {
                bool added = false;
                for (int i = sortedMolecules.size() - 1; i >= 0; i--)
                {
                    if (usin[i])
                        continue;
                    const auto &[W, ix] = sortedMolecules[i];
                    if (totalW + W > u)
                    {
                        continue;
                    }
                    added = true;
                    used.insert(i);
                    usin[i] = true;
                    totalW += W;
                }
                if (!added)
                    break;
            }
            if (totalW >= l)
            {
                vi indexesOfUsedMols;
                for (int i : used)
                {
                    indexesOfUsedMols.push_back(sortedMolecules[i].second);
                }
                return indexesOfUsedMols;
            }
        }
    }
    return {};
}

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

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:8:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define loop(x) for (int i = 0; i < (x); i++)
      |                                 ~~^~~~~
molecules.cpp:17:5: note: in expansion of macro 'loop'
   17 |     loop(w.size())
      |     ^~~~
molecules.cpp:65:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i1 = 0; i1 < sortedMolecules.size(); i1++)
      |                      ~~~^~~~~~~~~~~~~~~~~~~~~~~~

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