제출 #787044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787044		hariaakas646	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	5576 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

vi find_subset(int l, int u, vi w)
{
    int n = w.size();

    vii w2(n);
    frange(i, n)
    {
        w2[i] = {w[i], i};
    }
    sort(all(w2));
    vi out = {};
    int id = 0;
    lli v = 0;
    while (id < n && v <= u)
    {
        v += w2[id].f;
        out.pb(w2[id].s);
        id++;
    }
    // cout << v << "\n";
    if (v < l)
    {
        out = {};
        // cout << "a\n";
        return out;
    }
    else
    {
        if (v <= u)
        {
            // cout << "b\n";
            return out;
        }
        id--;
        v -= w2[id].f;

        out.pop_back();
        int k = 0;
        for (int i = n - 1; i >= id; i--)
        {
            if (v >= l)
                break;
            if (k >= out.size())
                break;
            v += w2[i].f - w2[k].f;
            out[k] = w2[i].s;
            k++;
        }
        if (v >= l && v <= u)
        {
            return out;
        }
        else
        {
            // cout << "c\n";
            out = {};
            return out;
        }
    }
}

// int main()
// {
//     int n, a, b;
//     cin >> n >> a >> b;
//     vi vec(n);
//     frange(i, n) cin >> vec[i];
//     vi out = find_subset(a, b, vec);

//     for (auto e : out)
//         cout << e << " ";
// }

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

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:77:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             if (k >= out.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