제출 #810801

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

molecules

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

typedef long long ll;
std::vector<int> find_subset(int lower, int upper, std::vector<int> wOriginal) {
    ll sum = 0;
    // size, index
    vector<pair<int, int>> weights(wOriginal.size());
    for (int i = 0; i < wOriginal.size(); i++) {
        weights[i] = {wOriginal[i], i};
    }

    sort(weights.rbegin(), weights.rend());

    vector<int> answer;
    for (int i = 0; i < weights.size(); i++) {
        auto [w, index] = weights[i];
        sum += w;
        answer.push_back(index);

        if (sum >= lower) {
            if (sum > upper) {
                return {};
            }
            return answer;
        }
    }

    return {};
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (int i = 0; i < wOriginal.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
molecules.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < weights.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~

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