제출 #164695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
164695		DS007	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	66 ms	6252 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second

vector<int> find_subset(int l, int u, vector<int> w) {
    long long l1 = l, u1 = u;
    vector<pair<int, int>> v;
    for (int i = 0; i < w.size(); i++)
        v.emplace_back(w[i], i);
    sort(v.begin(), v.end());

    vector<int> ans;
    int low = 1, high = w.size(), mid;
    while (low <= high) {
        mid = (low + high) / 2;
        long long sum = 0;
        int p1 = 0, p2 = mid;
        for (int i = 0; i < mid; i++)
            sum += v[i].x;

        bool check = sum < l1;
        for (int i = mid; i < w.size() && check; i++) {
            p1++, p2++;
            sum += v[i].x - v[i - mid].x;
            check = sum < l1;
        }

        if (!check && sum <= u1) {
            for (int i = p1; i < p2; i++)
                ans.push_back(v[i].y);
            return ans;
        }

        if (check)
            low = mid + 1;
        else
            high = mid - 1;
    }

    return ans;
}

/*signed main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);


    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}*/

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < w.size(); i++)
                     ~~^~~~~~~~~~
molecules.cpp:23:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = mid; i < w.size() && check; i++) {
                           ~~^~~~~~~~~~

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