제출 #612028

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
612028		boris_mihov	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	17 ms	3452 KiB

molecules

#include "molecules.h"
#include <algorithm>
#include <numeric>

typedef long long llong;
const int MAXN = 100000 + 10;

int perm[MAXN], n;
std::vector <int> find_subset(int l, int u, std::vector <int> w) 
{
    n = w.size();
    std::iota(perm+1, perm+1+n, 0);
    std::sort(perm+1, perm+1+n, [&](int x, int y)
    {
        return w[x] < w[y];
    });

    std::sort(w.begin(), w.end());

    int lp = 1;
    llong sum = 0;
    for (int rp = 1 ; rp <= w.size() ; ++rp)
    {
        sum += w[rp - 1];
        while (sum > u) sum -= w[lp++ - 1];
        if (l <= sum && sum <= u)
        {
            std::vector <int> ans;
            for (int j = lp ; j <= rp ; ++j)
            {
                ans.push_back(perm[j]);
            }

            return ans;
        }
    }

    return {};
}

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

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

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