제출 #780717

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
using namespace std;
#define ALL(arr) begin(arr), end(arr)

typedef pair<int, int> ii;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<bool> subset(w.size(), false);
    priority_queue<ii, vector<ii>, greater<ii>> sw;
    priority_queue<ii, vector<ii>, greater<ii>> rsw;
    long int sum = 0;
    for (int i = 0; i < w.size(); i++) {
        sw.push({w[i], i});
        rsw.push({w[i], i});
    }
    while (sum < l) {
        auto [weight, ind] = sw.top();
        sw.pop();
        sum += weight;
        subset[ind] = true;
    }


    for (int attempts = 2*w.size(); attempts >= 0; attempts--) {
        if (sum < l) {
            auto [weight, ind] = sw.top();
            sw.pop();
            subset[ind] = true;
            sum += weight;
        } else if (sum > u) {
            bool suc = false;
            while (!suc) {
                auto [weight, ind] = rsw.top();
                rsw.pop();
                if (subset[ind] = true) {
                    suc = true;
                    subset[ind] = false;
                    sum -= weight;
                }
            } 
        } else {
            vector<int> res;
            for (int n = 0; n < subset.size(); n++) if (subset[n]) res.push_back(n);
            return res;
        }
    }
    
 
    return std::vector<int>(0);
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i = 0; i < w.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:47:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             for (int n = 0; n < subset.size(); n++) if (subset[n]) res.push_back(n);
      |                             ~~^~~~~~~~~~~~~~~

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